.png){kind=icon}
Return
FEAST eigensolver for nonlinear eigenvalue problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.jocs.2018.05.006.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors associated with eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and calculating the eigenpairs in each region independently of the eigenpairs in the other regions. In this paper we present a generalization of the linear FEAST algorithm that can be used to solve nonlinear eigenvalue problems. Like its linear progenitor, the nonlinear FEAST algorithm can be used to solve nonlinear eigenvalue problems for the eigenpairs corresponding to eigenvalues that lie in a user-defined region in the complex plane, thereby allowing for the calculation of large numbers of eigenpairs in parallel. We describe the nonlinear FEAST algorithm, and use several physically motivated examples to demonstrate its properties. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Nonlinear eigenvalue problem
Polynomial eigenvalue problem
Quadratic eigenvalue problem
FEAST
Contour integration
Residual inverse iteration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave View more