A comparison of direct and preconditioned iterative techniques for sparse, unsymmetric systems of linear equations
- 1 April 1989
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 28 (4), 801-815
- https://doi.org/10.1002/nme.1620280406
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear SystemsMathematics of Computation, 1985
- Conjugate gradient-like algorithms for solving nonsymmetric linear systemsMathematics of Computation, 1985
- Algorithm 583: LSQR: Sparse Linear Equations and Least Squares ProblemsACM Transactions on Mathematical Software, 1982
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problemsJournal of Computational Physics, 1981
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- An incomplete factorization technique for positive definite linear systemsMathematics of Computation, 1980
- A class of preconditioned conjugate gradient methods for the solution of a mixed finite element discretization of the biharmonic operatorInternational Journal for Numerical Methods in Engineering, 1979
- A class of first order factorization methodsBIT Numerical Mathematics, 1978
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-MatrixMathematics of Computation, 1977