The Jacobi-Davidson (JD) method has been recently proposed for the evaluation of the partial eigenspectrum of large sparse matrices. In this work we report a set of numerical experiments that compare this method with other previously proposed techniques; deflation accelerated conjugate gradient (DAC
β¦ LIBER β¦
Fast iterative interior eigensolver for millions of atoms
β Scribed by Gerald Jordan; Martijn Marsman; Yoon-Suk Kim; Georg Kresse
- Book ID
- 113695270
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 813 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Numerical comparison of iterative eigens
Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
β
Luca Bergamaschi; Mario Putti
π
Article
π
2002
π
Elsevier Science
π
English
β 201 KB
A fast audio similarity retrieval method
β
Dominik Schnitzer; Arthur Flexer; Gerhard Widmer
π
Article
π
2010
π
Springer US
π
English
β 496 KB
A comparison of eigensolvers for large-s
β
Peter Arbenz; Ulrich L. Hetmaniuk; Richard B. Lehoucq; Raymond S. Tuminaro
π
Article
π
2005
π
John Wiley and Sons
π
English
β 505 KB
Iterative Solution of Augmented Systems
β
Forsgren, Anders; Gill, Philip E.; Griffin, Joshua D.
π
Article
π
2007
π
Society for Industrial and Applied Mathematics
π
English
β 284 KB
Fast Cholesky factorization for interior
β
C. MΓ©szΓ‘ros
π
Article
π
1996
π
Elsevier Science
π
English
β 366 KB
Every iteration of an interior point method of large scale linear programming requires computing at least one orthogonal projection. In practice, Cholesky decomposition seems to be the most efficient and sufficiently stable method. We studied the 'column oriented' or 'left looking' sparse variant of
Parallel processing for fast iterative d
β
Yu-Cheng He; Haccoun, D.; Cardinal, C.
π
Article
π
2006
π
IEEE
π
English
β 236 KB