Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Low-rank modification of the unsymmetric Lanczos algorithm
HTML articles powered by AMS MathViewer

by Thomas Huckle PDF
Math. Comp. 64 (1995), 1577-1588 Request permission


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$.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F10
  • Retrieve articles in all journals with MSC: 65F10
Additional Information
  • © Copyright 1995 American Mathematical Society
  • Journal: Math. Comp. 64 (1995), 1577-1588
  • MSC: Primary 65F10
  • DOI:
  • MathSciNet review: 1312097