Abstract
Convergence of the implicitly restarted Arnoldi (IRA) method for nonsymmetric eigenvalue problems has often been studied by deriving bounds for the angle between a desired eigenvector and the Krylov projection subspace. Bounds for residual norms of approximate eigenvectors have been less studied and this paper derives a new a-posteriori residual bound for nonsymmetric matrices with simple eigenvalues. The residual vector is shown to be a linear combination of exact eigenvectors and a residual bound is obtained as the sum of the magnitudes of the coefficients of the eigenvectors. We numerically illustrate that the convergence of the residual norm to zero is governed by a scalar term, namely the last element of the wanted eigenvector of the projected matrix. Both cases of convergence and non-convergence are illustrated and this validates our theoretical results. We derive an analogous result for implicitly restarted refined Arnoldi (IRRA) and for this algorithm, we numerically illustrate that convergence is governed by two scalar terms appearing in the linear combination which drives the residual norm to zero. We provide a set of numerical results that validate the residual bounds for both variants of Arnoldi methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnoldi, W.E.: The principle of minimized iteration in the solution of the matrix eigenvalue problem. Q. Appl. Math. 9, 17–29 (1951)
Bai, Z., Barret, R., Day, D., Demmel, J., Dongarra, J.: Test Matrix Collection for Non-Hermitian Eigenvalue Problems. Technical report, Department of Mathematics, University of Kentucky, KY (1995)
Beattie, C., Embree, M., Rossi, J.: Convergence of restarted Krylov subspaces to invariant subspaces. SIAM J. Matrix Anal. Appl. 25(4), 1074–1109 (2004)
Beattie, C., Embree, M., Sorensen, D.C.: Convergence of polynomial restart Krylov methods for eigenvalue computations. SIAM Rev. 47(3), 492–515 (2005)
Jia, Z.: Some Numerical Methods for Large Unsymmetric Eigenproblems. PhD thesis, Mathematics Department, University of Bielefeld, Germany (1994)
Jia, Z.: Refined iterative algorithms based on Arnoldi’s process for large unsymmetric eigenproblem. Linear Algebra Appl. 259, 1–23 (1997)
Jia, Z.: Polynomial characterisation of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm. Linear Algebra Appl. 287, 191–214 (1999)
Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45, 255–282 (1950)
Lehoucq, R.B.: Implicitly restarted Arnoldi methods and subspace iteration. SIAM J. Matrix. Anal. Appl. 23, 551–562 (2001)
Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK User’s Guide: Solution of Large Scale Eigenvalue Problems With Implicitly Restarted Arnoldi Methods. SIAM, Philadephia, PA (1998)
Morgan, R.B.: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Math. Comput. 65, 1213–1230 (1996)
Morgan, R.B., Zeng, M.: Harmonic projecton methods for large non-symmetric eigenvalue problems. Numer. Linear Algebr. Appl. 5, 33–55 (1998)
Morgan, R.B., Zeng, M.: A harmonic restarted Arnoldi for calculating eigenvalues and determining multiplicity. Linear Algebra Appl. 415, 96–113 (2006)
Saad, Y.: Variants on Arnoldi’s method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34, 269–295 (1980)
Sorensen, D.C.: Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13(1), 357–385 (1992)
Stewart, G.W.: A Krylov-Schur algorithm for large eigenproblrems. SIAM J. Matrix Anal. Appl. 23, 601–614 (2001)
Watkins, D.S., Elsner, L.: Convergence of algorithms of decomposition type for the eigenvalue problem. Linear Algebra Appl. 143, 19–47 (1991)
Wu, K., Simon, H.: Thick-restart Lanczos method for symmetric eigenvalue problems. SIAM J. Matrix Anal. Appl. 22, 602–616 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research of K. Dookhitram was supported by a postgraduate research fellowship from the Tertiary Education Commission and the University of Mauritius.
Rights and permissions
About this article
Cite this article
Dookhitram, K., Boojhawon, R., Gopaul, A. et al. A-posteriori residual bounds for Arnoldi’s methods for nonsymmetric eigenvalue problems. Numer Algor 56, 481–495 (2011). https://doi.org/10.1007/s11075-010-9400-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-010-9400-2