A Subspace Iteration Algorithm for Fredholm Valued Functions

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 dime...

Full description

Bibliographic Details
Main Authors: Christian Engström, Luka Grubišić
Format: Article
Language:English
Published: Hindawi Limited 2015-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2015/459895
id doaj-7737e790471945aebb0d50389c685913
record_format Article
spelling doaj-7737e790471945aebb0d50389c6859132020-11-24T20:49:17ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/459895459895A Subspace Iteration Algorithm for Fredholm Valued FunctionsChristian Engström0Luka Grubišić1Department of Mathematics and Mathematical Statistics, Umeå University, MIT-Huset, 90187 Umeå, SwedenDepartment of Mathematics, University of Zagreb, Bijenička 30, 10000 Zagreb, CroatiaWe 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.http://dx.doi.org/10.1155/2015/459895
collection DOAJ
language English
format Article
sources DOAJ
author Christian Engström
Luka Grubišić
spellingShingle Christian Engström
Luka Grubišić
A Subspace Iteration Algorithm for Fredholm Valued Functions
Mathematical Problems in Engineering
author_facet Christian Engström
Luka Grubišić
author_sort Christian Engström
title A Subspace Iteration Algorithm for Fredholm Valued Functions
title_short A Subspace Iteration Algorithm for Fredholm Valued Functions
title_full A Subspace Iteration Algorithm for Fredholm Valued Functions
title_fullStr A Subspace Iteration Algorithm for Fredholm Valued Functions
title_full_unstemmed A Subspace Iteration Algorithm for Fredholm Valued Functions
title_sort subspace iteration algorithm for fredholm valued functions
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2015-01-01
description 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.
url http://dx.doi.org/10.1155/2015/459895
work_keys_str_mv AT christianengstrom asubspaceiterationalgorithmforfredholmvaluedfunctions
AT lukagrubisic asubspaceiterationalgorithmforfredholmvaluedfunctions
AT christianengstrom subspaceiterationalgorithmforfredholmvaluedfunctions
AT lukagrubisic subspaceiterationalgorithmforfredholmvaluedfunctions
_version_ 1716806138259832832