An oblique projection method is adapted to solve large, sparse, unstructured systems of linear equations. This row-projection technique is a direct method which can be interpreted as an oblique Kaczmarz-type algorithm, and is also related to other standard solution methods. When a sparsity-preserving pivoting strategy is incorporated, it is demonstrated that the technique can be superior, in terms of both fill-in and arithmetic complexity, to more standard sparse algorithms based on gaussian elimination. This is especially true for systems arising from stiff ordinary differential equations problems in chemical kinetics studies
This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equati...
This paper deals with background and practical experience with preconditioned gradient methods for s...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...
Large and sparse systems of linear equations arise in many important applications [1] as radi-ation ...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
For large scale problems in electric circuit simulation as well as in chemical process simulation, t...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
234 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1989.Row projection (RP) methods f...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Abstract. The problem of finding a vector with the fewest nonzero elements that satisfies an underde...
The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equati...
This paper deals with background and practical experience with preconditioned gradient methods for s...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...
Large and sparse systems of linear equations arise in many important applications [1] as radi-ation ...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
For large scale problems in electric circuit simulation as well as in chemical process simulation, t...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
234 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1989.Row projection (RP) methods f...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Abstract. The problem of finding a vector with the fewest nonzero elements that satisfies an underde...
The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equati...
This paper deals with background and practical experience with preconditioned gradient methods for s...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...