Nested Lanczos: Implicitly restarting an unsymmetric Lanczos algorithm

DOI10.1023/A:1019105012193MaRDI QIDQ1272642zbMATH OpenOpenAlexFDO

Authors Gorik De Samblanx, Adhemar Bultheel

Publication date 3 January 1999

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019105012193

zbMATH Keywords

iterative algorithmeigenvalueLanczos methodGram-Schmidt algorithmimplicitly restartingbiorthogonal factorization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• Lanczos maximal algorithm for unsymmetric eigenvalue problems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices

Cited in

(3)

• A modified second-order Arnoldi method for solving the quadratic eigenvalue problems
• Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
• Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems

Describes a project that uses

Uses Software

• ARPACK
• eigs

This page was built for publication: Nested Lanczos: Implicitly restarting an unsymmetric Lanczos algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272642)