Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices

Computer Methods in Applied Mechanics and Engineering

Volumn 191, Issue 45, 2002, Pages 5233-5247

  Bergamaschi, Luca ^a   Putti, Mario ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Diffusion equation; Eigenvalues; Iterative methods; Sparse symmetric matrices

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FINITE DIFFERENCE METHOD; FINITE ELEMENT METHOD; ITERATIVE METHODS;

SPARSE MATRICES;

COMPUTATIONAL METHODS;

ITERATIVE TECHNIQUE;

EID: 0037175265     PISSN: 00457825     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7825(02)00457-7     Document Type: Article

References (22)

1. A sparse approximate inverse preconditioner for the conjugate gradient method
2. Spectral analysis of large finite element problems by optimization methods
3. Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem
4. Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
5. Factorized approximate inverse preconditioning of a sparse eigensolver
6. Solution of large eigenvalue problems
7. Nested iterations for symmetric eigenproblems
8. An orthogonal accelerated deflation technique for large symmetric eigenproblems
9. The preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problem
10. Deflation techniques for an implicit restarted Arnoldi iteration
11. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix
12. Lanczos versus subspace iteration for solution of eigenvalue problems
13. Computational variants of the Lanczos method for the eigenproblem
14. The software scene in the extraction of eigenvalues from sparse matrices
15. Variations of Arnoldi's method for computing eigenelements of large unsymmetric matrices
16. ILUT: A dual threshold incomplete lu factorization
17. GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems
18. A Jacobi-Davidson method for linear eigenvalue problems
19. Bi-CGSTAB: A fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems