Premium
The FEAST algorithm for large eigenvalue problems
Author(s) -
Galgon Martin,
Krämer Lukas,
Lang Bruno
Publication year - 2011
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.201110363
Subject(s) - solver , robustness (evolution) , eigenvalues and eigenvectors , problem solver , parallelism (grammar) , computer science , algorithm , parallel computing , computational science , chemistry , physics , programming language , biochemistry , quantum mechanics , gene
We consider the eigensolver named FEAST that was introduced by Polizzi in 2009 [1]. This solver, tailored to the (partial) solution of large sparse (generalized) eigenproblems offers good potential for parallelism and showed good robustness in our experiments. We briefly introduce the algorithm, point out some problems and give two examples. (© 2011 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)