Dissecting the FEAST algorithm for generalized eigenproblems
Authors:
- Lukas KrämerLKLukas Krämer
- Edoardo Di NapoliENEdoardo Di Napoli
- Martin GalgonMGMartin Galgon
- Bruno LangBLBruno Lang
- Paolo BientinesiPBPaolo Bientinesi
- 1 May 2013
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 244, 1-9
Abstract
No abstract availableAll Related Versions
Funding Information
- Bundesministerium für Forschung, Technologie und Raumfahrt
- Volkswagen Foundation
- Deutsche Forschungsgemeinschaft (German Research Association) (GSC 111)
This publication has 8 references indexed in Scilit:
- A block Chebyshev–Davidson method with inner–outer restart for large eigenvalue problemsJournal of Computational Physics, 2010
- A filter diagonalization for generalized eigenvalue problems based on the Sakurai–Sugiura projection methodJournal of Computational and Applied Mathematics, 2010
- Density-matrix-based algorithm for solving eigenvalue problemsPhysical Review B, 2009
- A parallel method for large sparse generalized eigenvalue problems using a GridRPC systemFuture Generation Computer Systems, 2008
- Self-consistent-field calculations using Chebyshev-filtered subspace iterationJournal of Computational Physics, 2006
- A projection method for generalized eigenvalue problems using numerical integrationJournal of Computational and Applied Mathematics, 2003
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue ProblemsSIAM Journal on Matrix Analysis and Applications, 2000
- Restarted GMRES for Shifted Linear SystemsSIAM Journal on Scientific Computing, 1998