Home > Publications database > Dissecting the FEAST algorithm for generalized eigenproblems > print

001     127962
005     20221109161707.0
024 7 _ |2 doi
|a 10.1016/j.cam.2012.11.014
024 7 _ |2 ISSN
|a 0377-0427
024 7 _ |2 ISSN
|a 1879-1778
024 7 _ |2 ISSN
|a 0377-0427
024 7 _ |2 WOS
|a WOS:000315066000001
037 _ _ |a FZJ-2012-00908
082 _ _ |a 510
082 _ _ |a 510
100 1 _ |0 P:(DE-HGF)0
|a Krämer, Lukas
|b 0
245 _ _ |a Dissecting the FEAST algorithm for generalized eigenproblems
260 _ _ |a Amsterdam [u.a.]
|b North-Holland
|c 2013
336 7 _ |a Journal Article
|b journal
|m journal
|0 PUB:(DE-HGF)16
|s 1357217088_19205
|2 PUB:(DE-HGF)
336 7 _ |a Output Types/Journal article
|2 DataCite
336 7 _ |a Journal Article
|0 0
|2 EndNote
336 7 _ |a ARTICLE
|2 BibTeX
336 7 _ |a JOURNAL_ARTICLE
|2 ORCID
336 7 _ |a article
|2 DRIVER
520 _ _ |a 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.
536 _ _ |0 G:(DE-HGF)POF2-411
|a 411 - Computational Science and Mathematical Methods (POF2-411)
|c POF2-411
|f POF II
|x 0
536 _ _ |a Simulation and Data Laboratory Quantum Materials (SDLQM) (SDLQM)
|0 G:(DE-Juel1)SDLQM
|c SDLQM
|f Simulation and Data Laboratory Quantum Materials (SDLQM)
|x 2
588 _ _ |a Dataset connected to CrossRef, juser.fz-juelich.de
700 1 _ |0 P:(DE-Juel1)144723
|a Di Napoli, Edoardo
|b 1
700 1 _ |0 P:(DE-HGF)0
|a Galgon, Martin
|b 2
700 1 _ |0 P:(DE-HGF)0
|a Lang, Bruno
|b 3
700 1 _ |0 P:(DE-HGF)0
|a Bientinesi, Paolo
|b 4
773 _ _ |0 PERI:(DE-600)1468806-2
|a 10.1016/j.cam.2012.11.014
|p 1 - 9
|t Journal of computational and applied mathematics
|v 244
|y 2013
856 4 _ |u https://juser.fz-juelich.de/record/127962/files/FZJ-2012-00908.pdf
|z Published final document.
|y Restricted
909 C O |o oai:juser.fz-juelich.de:127962
|p VDB
910 1 _ |0 I:(DE-588b)5008462-8
|6 P:(DE-Juel1)144723
|a Forschungszentrum Jülich GmbH
|b 1
|k FZJ
913 2 _ |0 G:(DE-HGF)POF3-511
|1 G:(DE-HGF)POF3-510
|2 G:(DE-HGF)POF3-500
|a DE-HGF
|b Key Technologies
|l Supercomputing & Big Data
|v Computational Science and Mathematical Methods
|x 0
913 1 _ |0 G:(DE-HGF)POF2-411
|1 G:(DE-HGF)POF2-410
|2 G:(DE-HGF)POF2-400
|a DE-HGF
|b Schlüsseltechnologien
|l Supercomputing
|v Computational Science and Mathematical Methods
|x 0
|4 G:(DE-HGF)POF
|3 G:(DE-HGF)POF2
914 1 _ |y 2013
915 _ _ |a JCR/ISI refereed
|0 StatID:(DE-HGF)0010
|2 StatID
915 _ _ |a JCR
|0 StatID:(DE-HGF)0100
|2 StatID
915 _ _ |a WoS
|0 StatID:(DE-HGF)0110
|2 StatID
|b Science Citation Index
915 _ _ |a WoS
|0 StatID:(DE-HGF)0111
|2 StatID
|b Science Citation Index Expanded
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0150
|2 StatID
|b Web of Science Core Collection
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0199
|2 StatID
|b Thomson Reuters Master Journal List
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0200
|2 StatID
|b SCOPUS
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0300
|2 StatID
|b Medline
915 _ _ |a Nationallizenz
|0 StatID:(DE-HGF)0420
|2 StatID
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)1020
|2 StatID
|b Current Contents - Social and Behavioral Sciences
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a VDB
980 _ _ |a journal
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)JSC-20090406

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21