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

DOI10.1007/BF01930896zbMATH Open0391.65013MaRDI QIDQ4172855FDOQ4172855

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An iterative method for finding characteristic vectors of a symmetric matrix

Cited In (9)

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

This page was built for publication: The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix

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