Lanczos versus subspace iteration for solution of eigenvalue problems

DOI10.1002/NME.1620190608MaRDI QIDQ3670439zbMATH OpenOpenAlexFDO

Authors Bahram Nour-Omid, Beresford N. Parlett, R. L. Taylor

Publication date 1983

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620190608

zbMATH Keywords

comparison of methodsLanczos algorithmlarge eigen problemssubspace iteration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element methods applied to problems in solid mechanics (74S05)

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems

Cited in

(22)

• The use of a refined error bound when updating eigenvalues of tridiagonals
• Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\)
• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
• Applications of the Lanczos method
• Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method
• A new splitting to solve a large Hermitian eigenproblem
• Tchebychev acceleration technique for large scale nonsymmetric matrices
• Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
• Characterization of electromagnetic devices via reduced-order models
• A modified second-order Arnoldi method for solving the quadratic eigenvalue problems
• A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA
• Free vibration analysis of multilayered composite plates and shells with the natural approach
• An FFT-based approach for Bloch wave analysis: application to polycrystals
• Dispersion relations of a periodic array of fluid-filled holes embedded in an elastic solid
• Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• On the solution of second‐order post‐buckling fields
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• An explicit formula for Lanczos polynomials
• The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures
• Rational Krylov sequence methods for eigenvalue computation
• An improved Lanczos algorithm for solving ill-conditioned linear equations

This page was built for publication: Lanczos versus subspace iteration for solution of eigenvalue problems

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