The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix

DOI10.1007/BF01930896zbMath0391.65013MaRDI QIDQ4172855

Jane K. Cullum

Publication date: 1978

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Lanczos AlgorithmLargest EigenvalueSimultaneous ComputationSmallest Eigenvectors

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices, Global infimum of strictly convex quadratic functions with bounded perturbations, On conjugate gradient-like methods for eigen-like problems, Lanczos method of tridiagonalization, Jacobi matrices and physics, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, Evaluation of matrix functions with the block Lanczos algorithm, On convergence of iterative projection methods for symmetric eigenvalue problems, A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems, RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES

Cites Work

• An iterative method for finding characteristic vectors of a symmetric matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item