Geometric aspects of the theory of Krylov subspace methods

Acta Numerica

Volumn 10, Issue , 2001, Pages 251-312

  Eiermann, Michael ^a   Ernst, Oliver G ^a  

^a TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85095808297     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492901000046     Document Type: Article

References (83)

1. S. F. Ashby, T. A. Manteuffel and P. E. Saylor (1990), 'A taxonomy for conjugate gradient methods', SIAM J. Numer. Anal. 27, 1542-1568.
2. O. Axelsson (1994), Iterative Solution Methods, Cambridge University Press, Cambridge.
3. T. Barth and T. A. Manteuffel (1994), Variable metric conjugate gradient algorithms, in Advances in Numerical Methods for Large Sparse Sets of Linear Systems (M. Natori and T. Nodera, eds), Vol. 10 of Parallel Processing for Scientific Computing, Keio University, Yokohama, Japan, pp. 165-188.
4. A. Björck and G. H. Golub (1973), 'Numerical methods for computing angles between linear subspaces', Math. Comp. 27, 579-594.
5. S. C. Brenner and L. R. Scott (1994), The Mathematical Theory of Finite Element Methods, Vol. 15 of Texts in Applied Mathematics, Springer, New York.
6. P. N. Brown (1991), 'A theoretical comparison of the Arnoldi and GMRES algorithms', SIAM J. Sci. Statist. Comput. 12, 58-77.
7. A. M. Bruaset (1995), A Survey of Preconditioned Iterative Methods, Vol. 328 of Pitman Research Notes in Mathematics, Longman Scientific and Technical, Harlow.
8. T. F. Chan, E. Gallopoulos, V. Simoncini, T. Szeto and C. H. Tong (1994), 'A quasiminimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems', SIAM J. Sci. Comput. 15, 338-347.
9. F. Chatelin (1993), Eigenvalues of Matrices, Wiley, New York.
10. J. Cullum and A. Greenbaum (1996), 'Relations between Galerkin and norm-minimizing iterative methods for solving linear systems.', SIAM J. Matrix Anal. Appl. 17, 223-247.
11. C. Davis and W. M. Kahan (1970), 'The rotation of eigenvectors by a perturbation, III', SIAM J. Numer. Anal. 7, 1-46.
12. M. Eiermann (1993), 'Fields of values and iterative methods', Linear Algebra Appl. 180, 167-197.
13. M. Eiermann, O. G. Ernst and O. Schneider (2000), 'Analysis of acceleration strategies for restarted minimal residual methods', J. Comput. Appl. Math. 123, 261-292.
14. T. Eirola and O. Nevanlinna (1989), 'Accelerating with rank-one updates', Linear Algebra Appl. 121, 511-520.
15. S. C. Eisenstat, H. C. Elman and M. H. Schultz (1983), 'Variational iterative methods for nonsymmetric systems of linear equations', SIAM J. Sci. Comput. 20, 345-357.
16. H. C. Elman (1982), Iterative methods for sparse, nonsymmetric systems of linear equations, PhD thesis, Yale University, Department of Computer Science.
17. M. Embree (1999), How descriptive are GMRES convergence bounds, Technical Report 99/08, Oxford University Computing Laboratory. Available from: http://web.comlab.ox.ac.uk/oucl/work/mark.embree/.
18. O. G. Ernst (2000), 'Residual-minimizing Krylov subspace methods for stabilized discretizations of convection-diffusion equations.', SIAM J. Matrix Anal. Appl. 21, 1079-1101.
19. B. Fischer (1996), Polynomial Based Iteration Methods for Symmetric Linear Systems, Wiley-Teubner, Leipzig.
20. R. W. Freund (1992), 'Quasi-kernel polynomials and their use in non-Hermitian matrix iterations', J. Comput. Appl. Math. 43, 135-158.
21. R. W. Freund (1993), 'A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems', SIAM J. Sci. Comput. 14, 470-482.
22. R. W. Freund (1994), Transpose-free quasi-minimal residual methods for non-Hermitian linear systems, in Recent Advances in Iterative Methods (G. Golub, A. Greenbaum and M. Luskin, eds), Vol. 60 of Mathematics and its Applications, IMA, Springer, New York, pp. 69-94.
23. R. W. Freund and N. M. Nachtigal (1991), 'QMR: a quasi-minimal residual method for non-Hermitian linear systems', Numer. Math. 60, 315-339.
24. R. W. Freund, G. H. Golub and N. M. Nachtigal (1992), Recent advances in iterative methods, in Acta Numerica (A. Iserles, ed.), Vol. 1, Cambridge University Press, Cambridge, pp. 57-100.
25. R. W. Freund, M. Gutknecht and N. M. Nachtigal (1993), 'An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices', SIAM J. Sci. Comput. 14, 137-158.
26. G. H. Golub and H. A. van der Vorst (1997), Closer to the solution: iterative linear solvers, in The State of the Art in Numerical Analysis (I. S. Duff and G. A. Watson, eds), Clarendon Press, Oxford, pp. 63-92.
27. G. H. Golub and C. F. Van Loan (1996), Matrix Computations, 3rd edn, Johns Hopkins University Press.
28. A. Greenbaum (1997), Iterative Methods for Solving Linear Systems, Vol. 17 of Frontiers in Applied Mathematics, SIAM, Philadelphia, PA.
29. A. Greenbaum and Z. Strakoš (1994), Matrices that generate the same Krylov residual spaces, in Recent Advances in Iterative Methods (G. H. Golub, A. Green-baum and M. Luskin, eds), Springer, New York, pp. 95-118.
30. A. Greenbaum, M. Rozložník and Z. Strakoš (1997), 'Numerical behaviour of the modified Gram-Schmidt GMRES implementation', BIT 37, 706-719.
31. A. Greenbaum, Z. Strakoš and V. Ptak (1996), 'Any nonincreasing convergence curve is possible for GMRES', SIAM J. Matrix Anal. Appl. 17, 465-469.
32. L. F. Greengard and V. Rokhlin (1987), 'A fast algorithm for particle simulations', J. Comput. Phys. 73, 325-348.
33. T. N. E. Greville (1974), 'Solutions of the matrix equation XAX = X and relations between oblique and orthogonal projectors', SIAM J. Appl. Math. 26, 828-832.
34. K. E. Gustafson and D. K. M. Rao (1996), Numerical Range: the Field of Values of Operators and Matrices, Springer, New York.
35. M. H. Gutknecht (1993a), 'Changing the norm in conjugate gradient type algorithms', SIAM J. Numer. Anal. 30, 40-56.
36. M. H. Gutknecht (1993b), 'Variants of BiCGStab for matrices with complex spectrum', SIAM J. Sci. Statist. Comput. 14, 1020-1033.
37. M. H. Gutknecht (1997), Lanczos-type solvers for nonsymmetric linear systems of equations, in Acta Numerica (A. Iserles, ed.), Vol. 6, Cambridge University Press, Cambridge, pp. 271-397.
38. W. Hackbusch and Z. P. Nowak (1989), 'On the fast matrix multiplication in the boundary element method by panel clustering', Numer. Math. 54, 463-491.
39. L. A. Hageman and D. M. Young (1981), Applied Iterative Methods, Academic Press, New York.
40. M. R. Hestenes and E. Stiefel (1952), 'Methods of conjugate gradients for solving linear systems', J. Res. Nat. Bur. Standards 49, 409-436.
41. M. Hochbruck and C. Lubich (1998), 'Error analysis of Krylov methods in a nutshell', SIAM J. Sci. Comput. 19, 695-701.
42. R. A. Horn and C. R. Johnson (1991), Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK.
43. A. S. Householder (1964), The Theory of Matrices in Numerical Analysis, Dover, New York.
44. W. D. Joubert (1994), 'On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems', Numer. Lin. Alg. Appl. 1, 427-447.
45. T. Kato (1960), 'Estimation of iterated matrices, with application to the von Neumann condition', Numer. Math. 2, 22-29.
46. A. N. Krylov (1931), 'On the numerical solution of the equation by which the frequency of small oscillations is determined in technical problems', Isz. Akad. Nauk SSSR Ser. Fiz.-Math. 4, 491-539.
47. C. Lanczos (1950), 'An iteration method for the solution of the eigenvalue problem of linear differential and integral operators', J. Res. Nat. Bur. Standards 45, 255-282.
48. C. Lanczos (1952), 'Solution of systems of linear equations by minimized iterations', J. Res. Nat. Bur. Standards 49, 33-53.
49. C. Le Calvez and Y. Saad (1999), 'Modified Krylov acceleration for parallel environments', Appl. Numer. Math. 30, 191-212.
50. J. Liesen (2000), 'Computable convergence bounds for GMRES', SIAM J. Matrix Anal. Appl. 21, 882-903.
51. G. Meurant (1999), Computer Solution of Large Linear Systems, Vol. 28 of Studies in Mathematics and its Applications, Elsevier, Amsterdam.
52. I. Moret (1997), 'A note on the superlinear convergence of GMRES', SIAM J. Numer. Anal. 34, 513-516.
53. R. B. Morgan (2000), 'Implicitly restarted GMRES and Arnoldi methods for non-symmetric systems of equations', SIAM J. Matrix Anal. Appl. 21, 1112-1135.
54. C. C. Paige and M. A. Saunders (1975), 'Solution of sparse indefinite systems of linear equations', SIAM J. Numer. Anal. 12, 617-629.
55. K. J. Ressel and M. H. Gutknecht (1998), 'QMR-smoothing for Lanczos-type product methods based on three-term recurrences', SIAM J. Sci. Comput. 19, 55-73.
56. J. R. Ringrose (1971), Compact Non-Self-Adjoint Operators, Van Nostrand Reinhold Company, London.
57. M. Rozložník and Z. Strakoš (1996), Variants of the residual minimizing Krylov space methods, in Proceedings of the XI. School 'Software and Algorithms of Numerical Mathematics', Zelezna Ruda, University of West Bohemia (I. Marek, ed.), pp. 208-225.
58. M. Rozložník, Z. Strakoš and M. Tůma (1996), On the role of orthogonality in the GMRES method, in SOFSEM'96: Theory and Practice of Informatics (K. Jeffery, J. Kral and M. Bartosek, eds), Vol. 1175 of Lecture Notes in Computer Science, Springer, Berlin, pp. 409-416.
59. Y. Saad (1981), 'Krylov subspace methods for solving large unsymmetric linear systems', Math. Comp. 37, 105-126.
60. Y. Saad (1982), 'The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems', SIAM J. Numer. Anal. 19, 470-484.
61. Y. Saad (1993), 'A flexible inner-outer preconditioned GMRES algorithm', SIAM J. Sci. Comput. 14, 461-469.
62. Y. Saad (1996), Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston.
63. Y. Saad (2000), 'Further analysis of minimum residual iterations', Numer. Lin. Alg. Appl. 7, 67-93.
64. Y. Saad and M. H. Schultz (1986), 'GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems', SIAM J. Sci. Comput. 7, 856-869.
65. P. Sonneveld (1989), 'CGS, a fast Lanczos-type solver for nonsymmetric linear systems.', SIAM J. Sci. Statist. Comput. 10, 36-52.
66. G. Starke (1994), 'Iterative methods and decomposition-based preconditioners for nonsymmetric elliptic boundary value problems', Habilitationsschrift, Universität Karlsruhe.
67. G. Starke (1997), 'Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems', Numer. Math. 78, 103-117.
68. G. W. Stewart (1998), Matrix Algorithms, Vol. I: Basic Decompositions, SIAM, Philadelphia, PA.
69. E. L. Stiefel (1958), 'Kernel polynomials in linear algebra and their numerical applications', J. Res. Nat. Bur. Standards, Appl. Math. Ser. 49, 1-22.
70. E. de Sturler (1999), 'Truncation strategies for optimal Krylov subspace methods', SIAM J. Numer. Anal. 36, 864-889.
71. L. N. Trefethen (1992), Pseudospectra of matrices, in Numerical Analysis 1991 (D. F. Griffiths and G. A. Watson, eds), Longman, pp. 234-266.
72. R. S. Varga (1999), Matrix Iterative Analysis, 2nd edn, Springer, Berlin.
73. H. A. van der Vorst (1992), 'BICGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems', SIAM J. Sci. Statist. Comput. 13, 631-644.
74. H. A. van der Vorst and Y. Saad (2000), 'Iterative solution of linear systems in the 20th century', J. Comput. Appl. Math. 123 1-33.
75. H. A. van der Vorst and C. Vuik (1994), 'GMRESR: a family of nested GMRES methods', Numer. Lin. Alg. Appl. 1, 369-386.
76. H. F. Walker (1995), 'Residual smoothing and peak/plateau behavior in Krylov subspace methods', Appl. Numer. Math. 19, 279-286.
77. H. Walker and L. Zhou (1994), 'A simpler GMRES', Numer. Lin. Alg. Appl. 1, 571-581.
78. P. A. Wedin (1983), On angles between subspaces of a finite dimensional inner product space, in Matrix Pencils (B. Kågström and A. Ruhe, eds), Vol. 273 of Lecture Notes in Mathematics, Springer, New York, pp. 263-285.
79. R. Weiss (1994), 'Properties of generalized conjugate gradient methods', Numer. Lin. Alg. Appl. 1, 45-63.
80. R. Weiss (1997), Parameter-free Iterative Linear Solvers, Akademie Verlag, Berlin.
81. H. Wielandt (1996), Topics in the analytic theory of matrices, in Helmut Wielandt, Mathematical Works (B. Huppert and H. Schneider, eds), Vol. 2, Walter de Gruyter, Berlin, pp. 271-352.
82. R. Winther (1980), 'Some superlinear convergence results for the conjugate gradient method', SIAM J. Numer. Anal. 17, 14-17.
83. L. Zhou and H. F. Walker (1994), 'Residual smoothing techniques for iterative methods', SIAM J. Sci. Comput. 15, 297-312.