A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
From MaRDI portal
Publication:4286594
DOI10.2307/2153403zbMath0796.65046OpenAlexW1977732568MaRDI QIDQ4286594
Publication date: 10 October 1994
Full work available at URL: https://doi.org/10.2307/2153403
stabilityconvergenceerror estimatesnumerical examplesArnoldi algorithmbreakdownKrylov subspaceHessenberg matrixnonsymmetric Lanczos algorithmnonsymmetric eigenvalue problemsnew-start procedure
Related Items (12)
Krylov type subspace methods for matrix polynomials ⋮ Multiple orthogonal polynomials applied to matrix function evaluation ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ A theoretical overview of Krylov subspace methods ⋮ An adaptive block Lanczos algorithm ⋮ A linear system solver based on a modified Krylov subspace method for breakdown recovery ⋮ vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations ⋮ Simultaneous similarity reductions for a pair of matrices to condensed forms ⋮ Low-Rank Modification of the Unsymmetric Lanczos Algorithm ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The nonsymmetric Lanczos algorithm and controllability
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Large-scale complex eigenvalue problems
- A generalized nonsymmetric Lanczos procedure
- Use of indefinite pencils for computing damped natural modes
- Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- The ELR Method for Computing the Eigenvalues of a General Matrix
- A Convergence Analysis for Nonsymmetric Lanczos Algorithms
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- Reduction of a General Matrix to Tridiagonal Form
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms