Results 1  10
of
14,566
Parallel Frontal Solvers for Large Sparse Linear Systems
 COMPUTERS IN CHEMICAL ENGINEERING
, 2003
"... Many applications in science and engineering give rise to large sparse linear systems of equations that need to be solved as efficiently as possible. As the size of the problems of interest increases, it can become necessary to consider exploiting multiprocessors to solve these systems. We report o ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Many applications in science and engineering give rise to large sparse linear systems of equations that need to be solved as efficiently as possible. As the size of the problems of interest increases, it can become necessary to consider exploiting multiprocessors to solve these systems. We report
Solving Large Sparse Linear Systems Over Finite Fields
, 1991
"... Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can ..."
Abstract

Cited by 89 (3 self)
 Add to MetaCart
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can
Multipolebased preconditioners for large sparse linear systems
, 2003
"... Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block lowrank approximations and hierarchical multipole approximations, the cost of computin ..."
Abstract
 Add to MetaCart
Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block lowrank approximations and hierarchical multipole approximations, the cost
Amesos2 and Belos: Direct and iterative solvers for large sparse linear systems
 Scientific Programming
, 2012
"... Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix fact ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix
Parallel multilevel block ILU preconditioning techniques for large sparse linear systems
 In Proceedings of International Parallel and Distributed Processing Symposium
, 2003
"... We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two alg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two
A Sparse QSDecomposition for Large Sparse Linear System of Equations
"... Summary. A direct solver for large scale sparse linear system of equations is presented in this paper. As a direct solver, this method is among the most efficient direct solvers available so far with flop count as O(n logn) in onedimensional situations and O(n 3/2 ) in second dimensional situation ..."
Abstract
 Add to MetaCart
Summary. A direct solver for large scale sparse linear system of equations is presented in this paper. As a direct solver, this method is among the most efficient direct solvers available so far with flop count as O(n logn) in onedimensional situations and O(n 3/2 ) in second dimensional
The Efficient Parallel Iterative Solution Of Large Sparse Linear Systems
, 1992
"... The development of efficient, generalpurpose software for the iterative solution of sparse linear systems on a parallel MIMD computer requires an interesting combination of expertise. Parallel graph heuristics, convergence analysis, and basic linear algebra implementation issues must all be conside ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The development of efficient, generalpurpose software for the iterative solution of sparse linear systems on a parallel MIMD computer requires an interesting combination of expertise. Parallel graph heuristics, convergence analysis, and basic linear algebra implementation issues must all
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge
 J. Symbolic Comput
, 1998
"... this paper appeared in "Design and Implementation of Symbolic Computation Systems," A. Miola (ed.), Springer Lect. Notes Comput. Science, 722, 6680 (1993). ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
this paper appeared in "Design and Implementation of Symbolic Computation Systems," A. Miola (ed.), Springer Lect. Notes Comput. Science, 722, 6680 (1993).
Parallel Solution of Large Sparse Linear Systems by a Balance Scheme Preconditioner
"... Abstract A parallel algorithm for preconditioning large and sparse linear systems is proposed. Both structural and numerical dropping are used to construct a preconditioner with proper structure. The Balance method is used to solve the linear system involving such preconditioner in each iteration. ..."
Abstract
 Add to MetaCart
Abstract A parallel algorithm for preconditioning large and sparse linear systems is proposed. Both structural and numerical dropping are used to construct a preconditioner with proper structure. The Balance method is used to solve the linear system involving such preconditioner in each iteration
Results 1  10
of
14,566