The idea behind Krylov methods

American Mathematical Monthly

Volumn 105, Issue 10, 1998, Pages 889-899

  Ipsen, Ilse C F ^a   Meyer, Carl D ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032280255     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589281     Document Type: Article

References (19)

1. O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
2. A. Berman and R. J. Plemmons, Nonnegatiue Matrices in the Mathematical Sciences, SIAM Classics In Applied Mathematics, SIAM, Philadelphia, 1994.
3. P. N. Brown and H. F. Walker, GMRES on (nearly) singular systems, SIAM J. Matrix Anal. Appl. 18 (1997) 37-51.
4. S. L. Campbell, I. C. F. Ipsen, C. T. Kelley, and C. D. Meyer, GMRES and the minimal polynomial. BIT 36 (1996) 664-675.
5. S. L. Campbell and C. D. Meyer, Generalized Inverses of Linear Transformations, Dover, New York, 1979.
6. M. P. Drazin, Pseudoinverses in associate rings and semigroups. Amer. Math. Monthly 65 (1968) 506-514.
7. W. Eberly and E. Kaltofen, On randomized Lanczos algorithms. In W. Küchlin, editor, Proc. Internat. Symp. Symbolic Algebraic Comput. ISSAC '97. ACM Press, New York, 1997, pp. 176-183.
8. M. Eiermann, I. Marek, and W. Niethammer, On the solution of singular linear systems of algebraic equations by semiiterative methods, Numer. Math. 53 (1988) 265-283.
9. V. N. Faddeeva, Computational Methods of Linear Algebra. Dover, New York, 1959.
10. R. W. Freund, G. H. Golub, and N. M. Nachtigal, Iterative solution of linear systems, In Acta Numerica 1992. Cambridge University Press, 1992, pp. 57-100.
11. R. W. Freund and M. Hochbruck, On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling, Num. Linear Algebra Appl. 1 (1994) 403-420.
12. G. H. Golub and C. F. van Loan, Matrix Computations, The Johns Hopkins Press, Baltimore, second edition, 1989.
13. A. S. Householder, The Theory of Matrices in Numerical Analysis. Dover, New York, 1964.
14. E. Kaltofen and A. Lobo, Distributed matrix-free solution of large sparse linear systems over finite fields. In A. M. Tentner, editor, Proc. High Performance Computing '96. Simulation Councils, Inc., San Diego, 1996, pp. 244-247.
15. C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations. SIAM, Philadelphia, 1995.
16. C. D. Meyer and R. J. Plemmons, Convergent powers of a matrix with applications to iterative methods for singular linear systems, SIAM J. Numer. Anal. 14 (1977) 699-705.
17. 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.
18. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, 1996.
19. Y. Saad and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM Sci. Stat. Comput. 7 (1986) 856-869.