Robust preconditioning of large, sparse, symmetric eigenvalue problems

DOI10.1016/0377-0427(95)00141-7zbMath0857.65040OpenAlexW2070675934MaRDI QIDQ1917916

Yousef Saad, Andreas Stathopoulos, Charlotte Froese Fischer

Publication date: 20 February 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00141-7

zbMATH Keywords

numerical examplesDavidson methodlarge, sparse, symmetric matriceseigenvalue preconditioning

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem, Harmonic projection methods for large non-symmetric eigenvalue problems, Inexact inverse subspace iteration for generalized eigenvalue problems, Alternative correction equations in the Jacobi-Davidson method, On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model, State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems, A refined Jacobi-Davidson method and its correction equation, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, Deflation by restriction for the inverse-free preconditioned Krylov subspace method, Unnamed Item, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc, Preconditioning eigenvalues and some comparison of solvers, The trace minimization method for the symmetric generalized eigenvalue problem

Uses Software

• NSPCG
• EISPACK
• Harwell-Boeing sparse matrix collection
• ILUT
• DVDSON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Matrix eigensystem routines. EISPACK guide extension
• Super-matrix methods
• A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
• Improving the Accuracy of Computed Eigenvalues and Eigenvectors
• The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Criteria for Combining Inverse and Rayleigh Quotient Iteration
• Sparse matrix test problems
• Davidson's algorithm with and without perturbation corrections
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• The Davidson Method
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• ILUT: A dual threshold incomplete LU factorization
• A Flexible Inner-Outer Preconditioned GMRES Algorithm