Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- 1 April 1985
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 44 (170), 417-424
- https://doi.org/10.2307/2007961
Abstract
This paper presents a unified formulation of a class of the conjugate gradient-like algorithms for solving nonsymmetric linear systems. The common framework is the Petrov-Galerkin method on Krylov subspaces. We discuss some practical points concerning the methods and point out some of the interrelations between them.Keywords
This publication has 11 references indexed in Scilit:
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1984
- Variational Iterative Methods for Nonsymmetric Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1983
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric SystemsSIAM Journal on Numerical Analysis, 1982
- Krylov Subspace Methods for Solving Large Unsymmetric Linear SystemsMathematics of Computation, 1981
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methodsLinear Algebra and its Applications, 1980
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equationsLinear Algebra and its Applications, 1980
- A generalized conjugate direction method and its application on a singular perturbation problemPublished by Springer Science and Business Media LLC ,1980
- A Generalized Conjugate Gradient Method for Nonsymmetric Systems of Linear EquationsPublished by Springer Science and Business Media LLC ,1976
- Approximate Solution of Operator EquationsPublished by Springer Science and Business Media LLC ,1972
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951