Complex moment-based methods for differential eigenvalue problems

  title={Complex moment-based methods for differential eigenvalue problems},
  author={Akira Imakura and Keiichi Morikuni and Akitoshi Takayasu},
  journal={Numerical Algorithms},
  pages={693 - 721}
This paper considers computing partial eigenpairs of differential eigenvalue problems (DEPs) such that eigenvalues are in a certain region on the complex plane. Recently, based on a “solve-then-discretize” paradigm, an operator analogue of the FEAST method has been proposed for DEPs without discretization of the coefficient operators. Compared to conventional “discretize-then-solve” approaches that discretize the operators and solve the resulting matrix problem, the operator analogue of FEAST… 



Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems

Numerical experiments indicate that the proposed methods have higher performance than the block SS–RR method, which is one of the most typical complex moment-based eigensolvers.

Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems

FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection

It is shown that FEAST is resilient against rounding errors and establishes properties that can be leveraged to enhance the algorithm's robustness and an extension of FEAST to handle non-Hermitian problems is proposed.

FEAST for Differential Eigenvalue Problems

An operator analogue of the FEAST matrix eigensolver is developed to compute the discrete part of the spectrum of a differential operator in a region of interest in the complex plane. Unbounded

Comparison of Numerical Methods and Open-Source Libraries for Eigenvalue Analysis of Large-Scale Power Systems

A review and fair comparison of existing algorithms and software tools that are able to handle the large-scale, non-symmetric matrices that arise in power system eigenvalue problems is provided.

A Density Matrix-based Algorithm for Solving Eigenvalue Problems

A new numerical algorithm for solving the symmetric eigenvalue problem is presented, which takes its inspiration from the contour integration and density matrix representation in quantum mechanics.

Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic

This article presents a technique of this kind that is related to previous work published in Japanese by Murakami, and shows that using rational interpolation per se suffers from instability; however, related techniques involving real rational filters can be very effective.