guest ::
| Home > Publications database > Dissecting the FEAST algorithm for generalized eigenproblems |
| Home > Publications database > Dissecting the FEAST algorithm for generalized eigenproblems |
| Journal Article | FZJ-2012-00908 |
; ; ; ;
2013
North-Holland
Amsterdam [u.a.]
This record in other databases: 
Please use a persistent id in citations: doi:10.1016/j.cam.2012.11.014
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.
; Current Contents - Social and Behavioral Sciences ; JCR ; Nationallizenz
; SCOPUS ; Science Citation Index ; Science Citation Index Expanded ; Thomson Reuters Master Journal List ; Web of Science Core Collection
|
The record appears in these collections: |
PDF