Abstract
In this paper, an adaptive algorithm based on the normal equations for solving large nonsymmetric linear systems is presented. The new algorithm is a hybrid method combining polynomial preconditioning with the CGNR method. Residual polynomial is used in the preconditioning to estimate the eigenvalues of the s.p.d. matrix A T A, and the residual polynomial is generated from several steps of CGNR by recurrence. The algorithm is adaptive during its implementation. The robustness is maintained, and the iteration convergence is speeded up. A numerical test result is also reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.F. Ashby, T.A. Manteuffel and J.S. Otto, A comparison of adaptive Chebyshev and least squares polynomial preconditionings for Hermitian positive definite linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 1–29.
A.M. Bruaset, A Survey of Preconditioned Iterative Methods, Pitman Research Notes in Mathematics Series No. 328 (Longman Scientific Technical, UK, 1995).
P.H. Davis, Interpolation and Approximation (Blaisdell, Watham, MA, 1963).
I.S. Duff, R.G. Grimes and J.G. Lewis, User's guide for the Harwell-Boeing sparse matrix collection (release I), Technical report No. TR/PA/92/86.
R. Ehrig and P. Deuflhard, GMERR-an error minimizing variant of GMRES, Technical report of ZIB, 1997, download from http://www.zib.de/.
B. Fischer, Polynomial Based Iterative Methods for Symmetric Systems (Wiley and Teubner, UK, 1996).
M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. 49 (1952) 409–436.
C. Li, Some researches on the iterative methods for solving large sparse linear systems, Ph.D. Thesis, Xi an Jiaotong University (1999).
C. Li and Z. You, On a new algorithm of ABS-CG type with preconditioning properties, J. Numerical Methods and Computer Applications 20(2) (1999) 131–137.
J. Meijerink and H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Mathematics of Computation 31 (1977) 148–162.
N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl. 13 (1992) 778–795.
Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math. 24 (1988) 89–105.
Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996).
Y. Saad and M. Schultz, GMRES:A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986) 856–869.
P.E. Saylor and D.C. Smolarski, Implementation of an adaptive algrithm for Richardson's method, Linear Algebra Appl. 154-156 (1991) 615–646.
J. Stoer, Solution of large linear systems of equations by conjugate gradient type methods, in: Mathematical Programming: The State of the Art, eds. A. Bachem, M. Grotochel and B. Korte (1982) pp. 540-565.
R. Weiss, Error-minimizing Krylov subspace methods, SIAM J. Sci. Comput. 15 (1994) 511–527.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, C. An Adaptive CGNR Algorithm for Solving Large Linear Systems. Annals of Operations Research 103, 329–338 (2001). https://doi.org/10.1023/A:1012979827681
Issue Date:
DOI: https://doi.org/10.1023/A:1012979827681