ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 20 (4) , 1060-1082
- https://doi.org/10.1137/s0895479897317806
Abstract
This work presents an adaptive block Lanczos method for large-scale non-Hermitian Eigenvalue problems (henceforth the ABLE method). The ABLE method is a block version of the non-Hermitian Lanczos algorithm. There are three innovations. First, an adaptive blocksize scheme cures (near) breakdown and adapts the blocksize to the order of multiple or clustered eigenvalues. Second, stopping criteria are developed that exploit the semiquadratic convergence property of the method. Third, a well-known technique from the Hermitian Lanczos algorithm is generalized to monitor the loss of biorthogonality and maintain semibiorthogonality among the computed Lanczos vectors. Each innovation is theoretically justified. Academic model problems and real application problems are solved to demonstrate the numerical behaviors of the method.Keywords
This publication has 32 references indexed in Scilit:
- Algorithm 776: SRRITACM Transactions on Mathematical Software, 1997
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized EigenproblemsSIAM Journal on Matrix Analysis and Applications, 1994
- Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problemMathematics of Computation, 1994
- Computing selected eigenvalues of sparse unsymmetric matrices using subspace iterationACM Transactions on Mathematical Software, 1993
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- The nonsymmetric Lanczos algorithm and controllabilitySystems & Control Letters, 1991
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weightsNumerical Algorithms, 1991
- A generalized nonsymmetric Lanczos procedureComputer Physics Communications, 1989
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951