Using nonorthogonal Lanczos vectors in the computation of matrix functions

SIAM Journal on Scientific Computing

Volumn 19, Issue 1, 1998, Pages 38-54

  Druskin, V ^a   Greenbaum, A ^b   Knizhnerman, L ^c  

^a SCHLUMBERGER DOLL RESEARCH   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c Bldg 3   (Russian Federation)

Author keywords

Finite precision arithmetic; Iterative methods; Lanczos algorithm; Matrix exponential

Indexed keywords

EID: 0002346411     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596303661     Document Type: Article

References (29)

1. W. E. ARNOLDI, The principal of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. J. CULLUM, Iterative methods for solving Ax = b, GMRES/FOM versus QMR/BiCG, Adv. Comput. Math., 6 (1996), pp. 1-24.
3. V. L. DRUSKIN AND L. A. KNIZHNERMAN, A spectral semi-discrete method for the numerical solution of 3D nonstationary problems in electrical prospecting, Izv. Acad. Sci. U.S.S.R., Physics of Solid Earth, 24 (1988), pp. 641-648. (English edition published by American Geophysical Union.)
4. V. DRUSKIN AND L. KNIZHNERMAN, Two polynomial methods for calculating functions of symmetric matrices, U.S.S.R. Comput. Math, and Math. Phys., 29 (1989), pp. 112-121. (English edition by Pergamon Press.)
5. V. DRUSKIN AND L. KNIZHNERMAN, Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues, U.S.S.R. Comput. Math, and Math. Phys., 31 (1991), pp. 20-30. (English edition by Pergamon Press.)
6. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
7. R. A. FRIESNER, L. S. TUCKERMAN, B. C. DORNBLACER, AND T. V. Russo, A method of exponential propagation of large systems of stiff nonlinear differential equations, J. Sci. Comput., 4 (1989), pp. 327-335.
8. E. GALLOPOULOS, Exponential propagation of symmetric matrices in Lanczos coordinates, unpublished manuscript, 1991.
9. E. GALLOPOULOS AND Y. SAAD, Efficient solution of parabolic equations by Krylov approximation methods, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 1236-1264.
10. G. H. GOLUB AND Z. STRAKOŠ, Estimates in quadratic formulas, Numerical Algorithms, 8 (1994), pp. 241-268.
11. A. GREENBAUM, Comparison of splittings used with the conjugate gradient algorithm, Numer. Math., 33 (1979), pp. 181-194.
12. A. GREENBAUM, Behavior of slightly perturbed Lanczos and conjugate gradient recurrences, Linear Algebra Appl., 113 (1989), pp. 7-63.
13. A. GREENBAUM AND L. GURVITS, Max-min properties of matrix factor norms, SIAM J. Sci. Comput., 15 (1994), pp. 348-358.
14. A. GREENBAUM, V. PTAK, AND Z. STRAKOŠ, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 465-469.
15. A. GREENBAUM AND Z. STRAKOŠ, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121-137.
16. W. A. JOUBERT, A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems, SIAM J. Sci. Comput., 15 (1994), pp. 427-439.
17. L. KNIZHNERMAN, Quality of approximations to a well-separated eigenvalue and location of Ritz values in the simple Lanczos process, U.S.S.R. Comput. Math, and Math. Phys., 35 (1995), pp. 1175-1187. (English edition by Pergamon Press.)
18. A. NAUTS AND R. E. WYATT, New approach to many state quantum dynamics: The recursive-residue-generation method, Phys. Rev. Lett., 51 (1983), pp. 2238-2241.
19. B. NOUR-OMID AND R. W. CLOUGH, Dynamic analysis of structure using Lanczos coordinates, Earthquake Engrg. and Struct. Dynamics, 12 (1984), pp. 565-577.
20. C. C. PAIGE, Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), pp. 341-349.
21. C. C. PAIGE, Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigen-problem, Linear Algebra Appl., 34 (1980), pp. 235-258.
22. C. C. PAIGE, Krylov subspace processes, Krylov subspace methods, and iteration polynomials, in Proceedings of the Cornelius Lanczos International Centenary Conference, J. Brown, M. Chu, D. Ellison, and R. Plemmons, eds., SIAM, Philadelphia, PA, 1993.
23. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 11 (1974), pp. 197-209.
24. T. J. PARK AND J. C. LIGHT, Unitary quantum time evolution by iterative Lanczos reduction, J. Chem. Phys., 85 (1986), pp. 5870-5876.
25. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
26. Z. STRAKOŠ, On the real convergence rate of the conjugate gradient method, Linear Algebra Appl., 154/156 (1991), pp. 535-549.
27. H. TAL-EZER, Spectral methods in time for parabolic problems, SIAM J. Numer. Anal., 26 (1989), pp. 1-11.
28. L. N. TREFETHEN, Approximation theory and numerical linear algebra, in Algorithms for Approximation II, J. C. Mason and M. G. Cox, eds., Chapman and Hall, London, 1990.
29. H. A. VAN DER VORST, An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix A, J. Comput. Appl. Math., 18 (1987), pp. 249-263.