An Efficient Implementation of the Nonsymmetric Lanczos Algorithm

DOI10.1137/S0895479895292503MaRDI QIDQ4339154zbMATH OpenFDO

Authors

Publication date 5 June 1997

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

breakdownArnoldi's methodreorthogonalizationsemidualitysparse eigenvalue problemstwo-sided Lanczos algorithmbiorthogonalization methodstwo-sided Gram-Schmidt procedure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• An efficient nonsymmetric Lanczos method on parallel vector computers
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• A Convergence Analysis for Nonsymmetric Lanczos Algorithms
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
• Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalue problems
• Computational enhancement of an unsymmetric block Lanczos algorithm
• Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
• scientific article; zbMATH DE number 437442
• Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations

Cited in

(21)

• An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
• The Lanczos Algorithm With Partial Reorthogonalization
• Abstract perturbed Krylov methods
• Multiple bifurcations generated by mode interactions in a reaction-diffusion problem
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• scientific article; zbMATH DE number 7280152 (Why is no real title available?)
• An Augmented Lanczos Algorithm for the Efficient Computation of a Dot-Product of a Function of a Large Sparse Symmetric Matrix
• A Convergence Analysis for Nonsymmetric Lanczos Algorithms
• scientific article; zbMATH DE number 1183044 (Why is no real title available?)
• Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
• For tridiagonals \(T\) replace \(T\) with \(LDL\)
• A comparative study of iterative solutions to linear systems arising in quantum mechanics
• Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
• Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms
• The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic
• On the squared unsymmetric Lanczos method
• The infinite bi-Lanczos method for nonlinear eigenvalue problems
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
• Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods

This page was built for publication: An Efficient Implementation of the Nonsymmetric Lanczos Algorithm

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