A subspace iteration algorithm for Fredholm valued functions (Q1665726)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6926398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subspace iteration algorithm for Fredholm valued functions |
scientific article; zbMATH DE number 6926398 |
Statements
A subspace iteration algorithm for Fredholm valued functions (English)
0 references
27 August 2018
0 references
Summary: We present an algorithm for approximating an eigensubspace of a spectral component of an analytic Fredholm valued function. Our approach is based on numerical contour integration and the analytic Fredholm theorem. The presented method can be seen as a variant of the FEAST algorithm for infinite dimensional nonlinear eigenvalue problems. Numerical experiments illustrate the performance of the algorithm for polynomial and rational eigenvalue problems.
0 references
0 references
0 references
0 references
0 references
0.7670615911483765
0 references
0.737053632736206
0 references
0.735926628112793
0 references
0.7352575063705444
0 references
0.7241365909576416
0 references
