Lanczos maximal algorithm for unsymmetric eigenvalue problems

DOI10.1016/0168-9274(91)90061-4zbMath0716.65030OpenAlexW2035200196WikidataQ126401684 ScholiaQ126401684MaRDI QIDQ753415

Mohamed Khelifi

Publication date: 1991

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(91)90061-4

zbMATH Keywords

numerical experimentserror estimateArnoldi's methodlook-ahead Lanczos algorithmmaximal algorithmunsymmetric eigenvalue problems

Mathematics Subject Classification ID

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

Related Items (5)

A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ The methods of Vorobyev and Lanczos ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ Lanczos-type algorithms for solving systems of linear equations

Cites Work

• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• The QR algorithm for real Hessenberg matrices
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Residual Bounds on Approximate Eigensystems of Nonnormal Matrices

This page was built for publication: Lanczos maximal algorithm for unsymmetric eigenvalue problems