The influence of orthogonality on the Arnoldi method

Linear Algebra and Its Applications

Volumn 309, Issue 1-3, 2000, Pages 307-323

  Braconnier, T ^a   Langlois, P ^a   Rioual, J C ^a  

^a UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Arnoldi method; Backward error; Eigenvalues; QR factorization

Indexed keywords

EID: 0034418186     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00100-7     Document Type: Article

References (23)

1. Arioli M., Fassino C. Roundoff error analysis of algorithms based on Krylov subspace methods. BIT. 36(2):1996;189-205.
2. Arnoldi W.E. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9(1):1951;17-29.
3. M. Bennani, A propos de la stabilité de la résolution d' équations sur ordinateurs, Ph.D. Dissertation, Institut National Polytechnique de Toulouse, 1991.
4. M. Bennani, T. Braconnier. Stopping criteria for eigensolvers, Tech. Rep. TR/PA/94/22, CERFACS, 1994.
5. Bjorck A. Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT. 7:1967;257-278.
6. Bjorck A. Numerics of Gram-Schmidt orthogonalization. Linear Algebra Appl. 197:1994;297-316.
7. A. Bjorck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
8. F. Chaitin-Chatelin, V. Fraysse, Lecture on Finite Precision Computations, SIAM, Philadelphia, 1996.
9. Daniel J., Gragg W.B., Kaufman L., Stewart G.W. Reorthogonlization and stable algorithm for updating the Gram-Schmidt QR factorization. Mathematics of Computation. 30:1976;772-795.
10. Deif A. A relative backward perturbation theorem for the eigenvalue problem. Numer. Math. 56:1989;625-626.
11. Drko s ová J., Greenbaum A., Rozlo z ník M., Strako s Z. Numerical stability of GMRES. BIT. 35(3):1995;309-330.
12. Gentleman W.M. Least squares computation by Givens transformations without square roots. J. Inst. Math. Applic. 12:1973;329-336.
13. Greenbaum A., Rozlo z ník M., Strako s Z. Numerical behaviour of the modified Gram-Schmidt GMRES implementation. BIT. 37(3):1997;706-719.
14. Higham N.J. The matrix sign decomposition and its relation to the polar decomposition. Linear Algebra Appl. 212:1994;3-20.
15. N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
16. Hoffmann W. Iterative algorithms for the Gram-Schmidt orthogonalization. Computing. 41:1989;335-348.
17. Paige C.C. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. J. Inst. Math. Applic. 18:1976;341-349.
18. C.C. Paige, Krylov subspace processes, Krylov subspace methods, and iteration polynomials, in: J.K. Brown, M.T. Chu, D.C. Ellison, R.J. Plemmons (Eds.), Proceedings of the Cornelius Lanczos International Centenary Conference, SIAM, Philadelphia, 1994, pp. 83-92.
19. Y. Saad, Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing, Manchester University Press, Manchester, UK, 1992.
20. Scott J.A. An Arnoldi code for computing selected eigenvalues of sparse large real unsymmetric matrices. ACM Trans. Mathematical Software. 21:1995;432-475.
21. G.W. Stewart, J. Sun, Matrix Perturbation Theory, Academic Press, 1991.
22. L.N. Trefethen, Pseudospectra of matrices, in: D.F. Griffiths, G.A. Watson (Eds.), 14th Dundee Biennial Conference on Numerical Analysis, 1991.
23. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, 1965.