We analyze the FEAST method for computing selected eigenvalues and eigenvectors of
large sparse matrix pencils. After establishing the close connection between FEAST and the …

We consider the eigensolver named FEAST that was introduced by Polizzi in 2009 [1]. This
solver, tailored to the (partial) solution of large sparse (generalized) eigenproblems offers …

Generalized eigenvalue problems involving a singular pencil may be very challenging to
solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing …

Generalized eigenvalue problems involving a singular pencil are very challenging to solve,
with respect to both accuracy and efficiency. The existing package Guptri is very elegant but …

The FEAST method for solving large sparse eigenproblems is equivalent to subspace
iteration with an approximate spectral projector and implicit orthogonalization. This relation …

A BIBLIOGRAPHICAL TOUR OF THE LARGE, SPARSE GENERALIZED EIGENVALUE
PROBLEM - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …

The contour integral‐based eigensolvers are the recent efforts for computing the
eigenvalues inside a given region in the complex plane. The best‐known members are the …

Many methods for the computation of selected eigenpairs of generalized eigenproblems for
matrix pairs use a shift-and-invert technique. When applied to large-scale problems, this …

This document is a survey of freely available software tools for the numerical solution of
large sparse eigenvalue problems. It includes a list of libraries, programs or subroutines …

In many large scale scientific or engineering computations, ranging from computing the
frequency response of a circuit to the earthquake response of a buildingto the energy levels …