A FEAST variant incorporated with a power iteration

TL;DR

This paper introduces a novel FEAST-based eigensolver variant that combines contour integrals with power iteration, improving stability and effectiveness for narrow search intervals in symmetric eigenvalue problems.

Contribution

A new FEAST variant integrating power iteration is proposed, removing the need for large subspace dimensions and enhancing performance on narrow intervals.

Findings

The method is more stable and robust than the original FEAST.

It effectively handles narrow search intervals.

Empirical results demonstrate improved convergence.

Abstract

We present a variant of the FEAST matrix eigensolver for solving restricted real and symmetric eigenvalue problems. The method is derived from a combination of a variant of the FEAST method, which employs two contour integrals per iteration, and a power subspace iteration process. Compared with the original FEAST method, our new method does not require that the search subspace dimension must be greater than or equal to the number of eigenvalues inside a search interval, and can deal with narrow search intervals more effectively. Empirically, the FEAST iteration and the power subspace iteration are in a mutually beneficial collaboration to make the new method stable and robust.