Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
From MaRDI portal
Publication:1923866
DOI10.1007/BF01731924zbMath0856.65030MaRDI QIDQ1923866
Daniela Calvetti, Lothar Reichel, James Baglama
Publication date: 24 February 1997
Published in: BIT (Search for Journal in Brave)
eigenvalues; eigenvectors; iteration methods; Krylov subspaces; restarted Lanczos method; large sparse symmetric matrix
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Approximation on disjoint intervals and its applicability to matrix preconditioning, Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method, Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, Iterative methods for large continuation problems, A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators, A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational Krylov sequence methods for eigenvalue computation
- The application of Leja points to Richardson iteration and polynomial preconditioning
- Computing interior eigenvalues of large matrices
- Iterative algorithms for Gram-Schmidt orthogonalization
- A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices
- Numerics of Gram-Schmidt orthogonalization
- Towards a black box Lanczos program
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
- An adaptive Richardson iteration method for indefinite linear systems
- Optimale Eigenwerteinschließungen
- An iterative method for finding characteristic vectors of a symmetric matrix
- A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Criteria for Combining Inverse and Rayleigh Quotient Iteration
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- The Lanczos Algorithm with Selective Orthogonalization
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Computational Variants of the Lanczos Method for the Eigenproblem
- Some Modified Matrix Eigenvalue Problems
- Numerical Determination of Fundamental Modes
