## 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

## 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

- Jane Cullum and Ralph A. Willoughby,
*A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices*, Large scale eigenvalue problems (Oberlech, 1985) North-Holland Math. Stud., vol. 127, North-Holland, Amsterdam, 1986, pp. 193–240. MR**875438**, DOI 10.1016/S0304-0208(08)72647-1 - Roland W. Freund, Gene H. Golub, and Noël M. Nachtigal,
*Iterative solution of linear systems*, Acta numerica, 1992, Acta Numer., Cambridge Univ. Press, Cambridge, 1992, pp. 57–100. MR**1165723**, DOI 10.1017/s0962492900002245 - Roland W. Freund, Martin H. Gutknecht, and Noël M. Nachtigal,
*An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices*, SIAM J. Sci. Comput.**14**(1993), no. 1, 137–158. MR**1201315**, DOI 10.1137/0914009 - Roland W. Freund and Noël M. Nachtigal,
*QMR: a quasi-minimal residual method for non-Hermitian linear systems*, Numer. Math.**60**(1991), no. 3, 315–339. MR**1137197**, DOI 10.1007/BF01385726 - R. Fletcher,
*Conjugate gradient methods for indefinite systems*, Numerical analysis (Proc 6th Biennial Dundee Conf., Univ. Dundee, Dundee, 1975) Lecture Notes in Math., Vol. 506, Springer, Berlin, 1976, pp. 73–89. MR**0461857**
M. H. Gutknecht, - Cornelius Lanczos,
*An iteration method for the solution of the eigenvalue problem of linear differential and integral operators*, J. Research Nat. Bur. Standards**45**(1950), 255–282. MR**0042791** - Cornelius Lanczos,
*Solution of systems of linear equations by minimized-iterations*, J. Research Nat. Bur. Standards**49**(1952), 33–53. MR**0051583** - B. N. Parlett,
*A new look at the Lanczos algorithm for solving symmetric systems of linear equations*, Linear Algebra Appl.**29**(1980), 323–346. MR**562767**, DOI 10.1016/0024-3795(80)90248-7 - Beresford N. Parlett, Derek R. Taylor, and Zhishun A. Liu,
*A look-ahead Lánczos algorithm for unsymmetric matrices*, Math. Comp.**44**(1985), no. 169, 105–124. MR**771034**, DOI 10.1090/S0025-5718-1985-0771034-2 - Beresford N. Parlett,
*Reduction to tridiagonal form and minimal realizations*, SIAM J. Matrix Anal. Appl.**13**(1992), no. 2, 567–593. MR**1152769**, DOI 10.1137/0613036 - Y. Saad,
*The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems*, SIAM J. Numer. Anal.**19**(1982), no. 3, 485–506. MR**656464**, DOI 10.1137/0719031
D. R. Taylor, - Qiang Ye,
*A breakdown-free variation of the nonsymmetric Lanczos algorithms*, Math. Comp.**62**(1994), no. 205, 179–207. MR**1201072**, DOI 10.1090/S0025-5718-1994-1201072-2

*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. 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.

*Analysis of the look ahead Lanczos algorithm*, Ph.D. Dissertation, University of California, Berkeley, CA, 1982.

## Additional Information

- © Copyright 1995 American Mathematical Society
- Journal: Math. Comp.
**64**(1995), 1577-1588 - MSC: Primary 65F10
- DOI: https://doi.org/10.1090/S0025-5718-1995-1312097-1
- MathSciNet review: 1312097