Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- 1 September 1996
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (3) , 470-493
- https://doi.org/10.1007/bf01731928
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Any Nonincreasing Convergence Curve is Possible for GMRESSIAM Journal on Matrix Analysis and Applications, 1996
- Lectures on Finite Precision ComputationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1996
- Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problemMathematics of Computation, 1994
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- A breakdown-free Lanczos type algorithm for solving linear systemsNumerische Mathematik, 1992
- Large-scale complex eigenvalue problemsJournal of Computational Physics, 1989
- A generalized nonsymmetric Lanczos procedureComputer Physics Communications, 1989
- A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric MatricesNorth-Holland Mathematics Studies, 1986
- Residual Bounds on Approximate Eigensystems of Nonnormal MatricesSIAM Journal on Numerical Analysis, 1982
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblemLinear Algebra and its Applications, 1980