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 dimensional nonlinear eigenvalue problems. Numerical experiments illustrate the performance of the algorithm for polynomial and rational eigenvalue problems.

Elements of Spectral Theory for Generalized Derivations II : The Semifredholm Domain

Let and denote infinite dimensional Hilbert spaces and let denote the space of all bounded linear operators from to . For A in and B in , let τAB denote the operator on defined by τAB(X) = AX – XB. The purpose of this note is to characterize the semi-Fredholm domain of τAB (Corollary 3.16). Section 3 also contains formulas for ind(τAB – λ). These results depend in part on a decomposition theorem for Hilbert space operators corresponding to certain “singular points” of the semi-Fredholm domain (Theorem 2.2). Section 4 contains a particularly simple formula for ind(τAB – λ) (in terms of spectral and algebraic invariants of A and B) for the case when τAB – λ is Fredholm (Theorem 4.2). This result is used to prove that (τBA) = –ind(τAB) (Corollary 4.3). We also prove that when A and B are bi-quasi-triangular, then the semi-Fredholm domain of τAB contains no points corresponding to nonzero indices.