Further Analysis of Minimum Residual Iterations

Numerical Linear Algebra with Applications

Volumn 7, Issue 2, 2000, Pages 67-93

  Saad, Yousef ^a  

^a University of Minnesota   (United States)

Author keywords

Krylov subspace techniques; Minimal residual methods

Indexed keywords

EID: 0034403876     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(200003)7:2<67::AID-NLA186>3.0.CO;2-8     Document Type: Article

References (19)

1. Eisenstat SC, Elman HC, Schultz MH. Variational iterative methods for nonsymmetric systems of linear equations. SIAM Journal on Numerical Analysis, 1983;2:345-357.
2. Chapman A, Saad Y. Deflated and augmented Krylov subspace techniques. Numerical Linear Algebra with Applications, 1997;4:43-66.
3. Morgan RB. A restarted GMRES method augmented with eigenvectors. SIAM Journal on Matrix Analysis and Applications, 1995;16:1154-1171.
4. Sorensen DC. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM Journal on Matrix Analysis and Applications, 1992;13:357-385.
5. Stathopoulos A, Saad Y, Wu K. Dynamic thick restarting of the davidson, and the implicitly restarted arnoldi methods. SIAM Journal on Scientific Computing, 1998;19:227-245.
6. Gustafson K. Operator trigonometry of iterative methods. Numerical Linear Algebra with Applications, 1997;4:333-347.
7. Nachtigal NM, Reddy SC, Trefethen LN. How fast are nonsymmetric matrix iterations. SIAM Journal on Matrix Analysis and Applications, 1992;13:778-795.
8. Greenbaum A, Trefethen LN. GMRES/CR and Arnoldi/Lanczos as matrix approximation problems. SIAM Journal on Scientific Computing, 1994;15:359-368.
9. Greenbaum A, Strakos Z. Matrices that generate the same Krylov residual spaces. In Recent Advances in Iterative Methods, IMA Volumes in Mathematics and Its Applications, Golub G, Luskin M, Greenbaum A (eds), vol. 60. Springer Verlag: New York, 1994; 95-119.
10. Nevanlinna O. How fast can iterative methods be? In Recent Advances in Iterative Methods, IMA Volumes in Mathematics and Its Applications, Golub G, Luskin M, Greenbaum A (eds), vol. 60. Springer Verlag: New York, 1994.
11. Godunov SK, Antonov AG, Kirilyuk OP, Kostin VI. Guaranteed accuracy in numerical linear algebra. Kluwer, Dordrecht, 1994.
12. Trefethen LN. Pseudospectra of matrices. In Numerical Analysis, 1991, Griffiths DF, Watson GA (eds), Longman, 1992; 234-246.
13. Saad Y. Iterative Methods for Sparse Linear Systems. PWS publishing: New York, 1996.
14. Elman HC. Iterative Methods for Large Sparse Nonsymmetric Systems of Linear Equations. PhD thesis, Yale University, Computer Science Dept., New Haven, CT., 1982.
15. Kato T. Perturbation Theory for Linear Operators. Springer Verlag: New York, 1965.
16. Golub GH, Van Loan C. Matrix Computations. The John Hopkins University Press, Baltimore, 1989.
17. Saad Y. Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM Journal on Numerical Analysis, 1992;29:209-228.
18. Axelsson O. Iterative Solution Methods. Cambridge University Press: New York, 1994.
19. Axelsson O, Makarov M. On a generalized conjugate gradient orthogonal residual method. Numerical Linear Algebra with Applications, 1995;2:467-479.