An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
From MaRDI portal
Publication:4339154
DOI10.1137/S0895479895292503zbMath0873.65037MaRDI QIDQ4339154
No author found.
Publication date: 5 June 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
breakdownArnoldi's methodreorthogonalizationsemidualitysparse eigenvalue problemstwo-sided Lanczos algorithmbiorthogonalization methodstwo-sided Gram-Schmidt procedure
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (10)
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ A comparative study of iterative solutions to linear systems arising in quantum mechanics ⋮ Abstract perturbed Krylov methods ⋮ The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ Multiple bifurcations generated by mode interactions in a reaction-diffusion problem ⋮ Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems ⋮ For tridiagonals \(T\) replace \(T\) with \(LDL\)
This page was built for publication: An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
