Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
From MaRDI portal
Publication:4693193
DOI10.1137/0914037zbMath0791.65022OpenAlexW2019715448MaRDI QIDQ4693193
Ronald B. Morgan, David S. Scott
Publication date: 7 July 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1bd2b3d65bccdc11e70339e70cde2c140891752c
convergencenumerical examplescomparisonseigenpairssparse symmetric matricesdouble iteration schemepreconditioned Lanczos algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
On global convergence of subspace projection methods for Hermitian eigenvalue problems, Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation, Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem, A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems, Harmonic projection methods for large non-symmetric eigenvalue problems, Robust preconditioning of large, sparse, symmetric eigenvalue problems, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems, Preconditioners for Krylov subspace methods: An overview, Inexact inverse subspace iteration for generalized eigenvalue problems, On Chebyshev-Davidson method for symmetric generalized eigenvalue problems, Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel, Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, Deflation by restriction for the inverse-free preconditioned Krylov subspace method, Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems, Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations, Unnamed Item, Rayleigh quotient minimization method for symmetric eigenvalue problems, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, Filtered Krylov-like sequence method for symmetric eigenvalue problems, Preconditioning eigenvalues and some comparison of solvers, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
Uses Software
