Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- 1 October 2002
- journal article
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 191 (45) , 5233-5247
- https://doi.org/10.1016/s0045-7825(02)00457-7
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblemsNumerical Linear Algebra with Applications, 2000
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric EigenproblemNumerical Linear Algebra with Applications, 1997
- Deflation Techniques for an Implicitly Restarted Arnoldi IterationSIAM Journal on Matrix Analysis and Applications, 1996
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient MethodSIAM Journal on Scientific Computing, 1996
- Nested Iterations for Symmetric EigenproblemsSIAM Journal on Scientific Computing, 1995
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1994
- Spectral Analysis of Large Finite Element Problems by Optimization MethodsShock and Vibration, 1994
- An orthogonal accelerated deflation technique for large symmetric eigenproblemsComputer Methods in Applied Mechanics and Engineering, 1992
- Lanczos versus subspace iteration for solution of eigenvalue problemsInternational Journal for Numerical Methods in Engineering, 1983
- Computational Variants of the Lanczos Method for the EigenproblemIMA Journal of Applied Mathematics, 1972