Conjugate gradient-like algorithms for solving nonsymmetric linear systems

Saad, Youcef; Schultz, Martin H.

doi:10.1090/S0025-5718-1985-0777273-9

Conjugate gradient-like algorithms for solving nonsymmetric linear systems
HTML articles powered by AMS MathViewer

by Youcef Saad and Martin H. Schultz PDF

Math. Comp. 44 (1985), 417-424 Request permission

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.

References

W. E. Arnoldi, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9 (1951), 17–29. MR 42792, DOI 10.1090/S0033-569X-1951-42792-9
O. Axelsson, A generalized conjugate direction method and its application on a singular perturbation problem, Numerical analysis (Proc. 8th Biennial Conf., Univ. Dundee, Dundee, 1979), Lecture Notes in Math., vol. 773, Springer, Berlin, 1980, pp. 1–11. MR 569457
Owe Axelsson, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Linear Algebra Appl. 29 (1980), 1–16. MR 562745, DOI 10.1016/0024-3795(80)90226-8
Paul Concus and Gene H. Golub, A generalized conjugate gradient method for nonsymmetric systems of linear equations, Computing methods in applied sciences and engineering (Second Internat. Sympos., Versailles, 1975) Lecture Notes in Econom. and Math. Systems, Vol. 134, Springer, Berlin, 1976, pp. 56–65. MR 0468130
Stanley C. Eisenstat, Howard C. Elman, and Martin H. Schultz, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal. 20 (1983), no. 2, 345–357. MR 694523, DOI 10.1137/0720023

Iterative Methods for Large Sparse Nonsymmetric Systems of Linear Equations

David M. Young and Kang C. Jea, Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods, Linear Algebra Appl. 34 (1980), 159–194. MR 591431, DOI 10.1016/0024-3795(80)90165-2
M. A. Krasnosel′skiĭ, G. M. Vaĭnikko, P. P. Zabreĭko, Ya. B. Rutitskii, and V. Ya. Stetsenko, Approximate solution of operator equations, Wolters-Noordhoff Publishing, Groningen, 1972. Translated from the Russian by D. Louvish. MR 0385655

Introduction to Linear and Nonlinear Programming

Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp. 37 (1981), no. 155, 105–126. MR 616364, DOI 10.1090/S0025-5718-1981-0616364-6
Y. Saad, The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19 (1982), no. 3, 485–506. MR 656464, DOI 10.1137/0719031
Youcef Saad, Practical use of some Krylov subspace methods for solving indefinite and nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 5 (1984), no. 1, 203–228. MR 731892, DOI 10.1137/0905015

GMRES

A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems

Proc. Fourth Symposium on Reservoir Simulation

Olof Widlund, A Lanczos method for a class of nonsymmetric systems of linear equations, SIAM J. Numer. Anal. 15 (1978), no. 4, 801–812. MR 483345, DOI 10.1137/0715053