Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Low-rank modification of the unsymmetric Lanczos algorithm

Author: Thomas Huckle
Journal: Math. Comp. 64 (1995), 1577-1588
MSC: Primary 65F10
MathSciNet review: 1312097
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The unsymmetric Lanczos algorithm is an important method for eigenvalue estimation and for solving linear equations. Unfortunately, the algorithm may break down without providing useful information; this is referred to as a serious breakdown in the literature. Here, we introduce a low-rank modification of the original matrix A in the case of a serious breakdown. This modification can be used to cure a serious breakdown as long as we have orthogonality of the already computed Lanczos vectors. We can switch to a new rank-1 modified matrix $ \tilde A = A + a{b^T}$ such that

- the Lanczos algorithm has no serious breakdown in this step when applied on $ \tilde A$,

- the already computed variables in the Lanczos algorithm for A and $ \tilde A$ coincide,

- using a Lanczos-based iterative solver, e.g. BCG or QMR, with start vectors $ {x_0} = 0$ and $ {v_1} = f$, we have $ {A^{ - 1}}f = {\tilde A^{ - 1}}f$, and thus by continuing the Lanczos algorithm with $ \tilde A$ we automatically get the desired solution $ {A^{ - 1}}f$.

Also, if the Lanczos vectors have lost their orthogonality, we show theoretically and by numerical examples that the modified Lanczos method has the same convergence behavior as the Lanczos method without breakdown. Thus, in the case of a serious breakdown we only have to compute the new rank-1 modified matrix $ \tilde A$ and step further in the original algorithm now using $ \tilde A$.

References [Enhancements On Off] (What's this?)

  • [1] J. Cullum and R. A. Willoughby, A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices, Large Scale Eigenvalue Problems (J. Cullum and R. A. Willoughby, eds.), North-Holland, Amsterdam, 1986, pp. 193-240. MR 875438 (88a:65040)
  • [2] R. W. Freund, G. H. Golub, and N. M. Nachtigal, Iterative solution of linear systems, Acta Numerica (1991), 1-44. MR 1165723 (93g:65046)
  • [3] R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Statist. Comput. 14 (1993), 137-158. MR 1201315 (93h:65048)
  • [4] R. W. Freund and N. M. Nachtigal, QMR: a quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60 (1991), 315-339. MR 1137197 (92g:65034)
  • [5] R. Fletcher, Conjugate gradient methods for indefinite systems, Numerical Analysis Dundee 1975 (G. A. Watson, ed.), Lecture Notes in Math., vol. 506, Springer, Berlin, 1976, pp. 73-89. MR 0461857 (57:1841)
  • [6] M. H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, and the QD algorithm, Proc. Copper Mountain Conference on Iterative Methods, Computational Math Group, The University of Colorado at Denver, 1990.
  • [7] W. D. Jaubert, Generalized conjugate gradient and Lanczos methods for the solution of non-symmetric systems of linear equations, Ph.D. Dissertation, University of Texas, Austin, TX, 1990.
  • [8] C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral equations, J. Res. Nat. Bur. Standards 45 (1950), 255-282. MR 0042791 (13:163d)
  • [9] -, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Standards 49 (1952), 33-53. MR 0051583 (14:501g)
  • [10] B. N. Parlett, A new look at the Lanczos algorithm for solving systems of linear equations, Linear Algebra Appl. 29 (1980), 323-346. MR 562767 (83e:65064)
  • [11] B. N. Parlett, D. R. Taylor and Z. A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985), 105-124. MR 771034 (86f:65072)
  • [12] B. N. Parlett, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl. 13 (1992), 567-593. MR 1152769 (93c:65059)
  • [13] Y. Saad, The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19 (1982), 485-506. MR 656464 (84g:65045)
  • [14] D. R. Taylor, Analysis of the look ahead Lanczos algorithm, Ph.D. Dissertation, University of California, Berkeley, CA, 1982.
  • [15] Q. Ye, A breakdown-free variation of the nonsymmetric Lanczos algorithm, Math. Comp. 62 (1994), 179-207. MR 1201072 (94c:65049)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F10

Retrieve articles in all journals with MSC: 65F10

Additional Information

Article copyright: © Copyright 1995 American Mathematical Society

American Mathematical Society