Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
From MaRDI portal
Publication:3928917
DOI10.1093/imanum/1.2.135zbMath0474.65022OpenAlexW2121937519MaRDI QIDQ3928917
John K. Reid, Beresford N. Parlett
Publication date: 1981
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/1.2.135
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computer aspects of numerical algorithms (65Y99)
Related Items
Transient solutions for multi-server queues with finite buffers, A finite difference scheme for computing inertial manifolds, Representations and bounds for zeros of orthogonal polynomials and eigenvalues of sign-symmetric tri-diagonal matrices, MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS, Inversion of the fermion matrix and the equivalence of the conjugate gradient and Lanczos algorithms, On Estimating the Largest Eigenvalue with the Lanczos Algorithm, trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem, An efficient matrix tridiagonalization method for 3D finite element analysis of free vibration, Sparse matrices, Rational Krylov sequence methods for eigenvalue computation, Eigenvalue computation in the 20th century, A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems
Uses Software
