% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@ARTICLE{Krmer:127962,
author = {Krämer, Lukas and Di Napoli, Edoardo and Galgon, Martin
and Lang, Bruno and Bientinesi, Paolo},
title = {{D}issecting the {FEAST} algorithm for generalized
eigenproblems},
journal = {Journal of computational and applied mathematics},
volume = {244},
address = {Amsterdam [u.a.]},
publisher = {North-Holland},
reportid = {FZJ-2012-00908},
pages = {1 - 9},
year = {2013},
abstract = {We analyze the FEAST method for computing selected
eigenvalues and eigenvectors of large sparse matrix pencils.
After establishing the close connection between FEAST and
the well-known Rayleigh–Ritz method, we identify several
critical issues that influence convergence and accuracy of
the solver: the choice of the starting vector space, the
stopping criterion, how the inner linear systems impact the
quality of the solution, and the use of FEAST for computing
eigenpairs from multiple intervals. We complement the study
with numerical examples, and hint at possible improvements
to overcome the existing problems.},
cin = {JSC},
ddc = {510},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {411 - Computational Science and Mathematical Methods
(POF2-411) / Simulation and Data Laboratory Quantum
Materials (SDLQM) (SDLQM)},
pid = {G:(DE-HGF)POF2-411 / G:(DE-Juel1)SDLQM},
typ = {PUB:(DE-HGF)16},
UT = {WOS:000315066000001},
doi = {10.1016/j.cam.2012.11.014},
url = {https://juser.fz-juelich.de/record/127962},
}