Iterative solution of linear systems
- 1 January 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 1, 57-100
- https://doi.org/10.1017/s0962492900002245
Abstract
Recent advances in the field of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for nonHermitian matrices.Keywords
This publication has 70 references indexed in Scilit:
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric MatricesNorth-Holland Mathematics Studies, 1986
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear SystemsMathematics of Computation, 1985
- A Look-Ahead Lanczos Algorithm for Unsymmetric MatricesMathematics of Computation, 1985
- Algebraic Methods for Toeplitz-like Matrices and OperatorsPublished by Springer Nature ,1984
- Solution of Large Linear Systems of Equations by Conjugate Gradient Type MethodsPublished by Springer Nature ,1983
- Krylov Subspace Methods for Solving Large Unsymmetric Linear SystemsMathematics of Computation, 1981
- A Generalized Conjugate Gradient Method for Nonsymmetric Systems of Linear EquationsPublished by Springer Nature ,1976
- A Class of Methods for Solving Nonlinear Simultaneous EquationsMathematics of Computation, 1965
- The N‐Step Iteration ProceduresJournal of Mathematics and Physics, 1955