.png){kind=icon}
Return
FEAST EIGENSOLVER FOR NON-HERMITIAN PROBLEMS
.png){kind=icon}
OA
AI
DOI：10.1137/15M1026572.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed. It aims at broadening the class of eigenproblems that can be addressed within the framework of the FEAST algorithm. The algorithm is ideally suited for computing selected interior eigenvalues and their associated right/left biorthogonal eigenvectors located within a subset of the complex plane. It combines subspace iteration with efficient contour integration techniques that approximate the left and right spectral projectors. We discuss the various algorithmic choices that have been made to improve the stability and usability of the new non-Hermitian eigensolver. The latter retains the convergence property and multilevel parallelism of Hermitian FEAST, making it a valuable new software tool for the scientific community.
Keywords:
non-Hermitian eigenproblem
FEAST
spectral projectors
contour integration
right/left eigenvectors
biorthogonal vectors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more