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

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 …

Anasazi is a package within the Trilinos software project that provides a framework for the
iterative, numerical solution of large-scale eigenvalue problems. Anasazi is written in ANSI …

The calculation of a segment of eigenvalues and their corresponding eigenvectors of a
Hermitian matrix or matrix pencil has many applications. A new density-matrix-based …

The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses
complex contour integration to calculate the eigenvectors associated with eigenvalues that …

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 …

The FEAST library package represents an unified framework for solving various family of
eigenvalue problems and achieving accuracy, robustness, high-performance and scalability …

A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue
problems is presented and thoroughly discussed. It aims at broadening the class of …

Two innovations are presented to improve the orthogonal subspace iteration. Firstly, a
refined strategy is proposed that replaces conventional Ritz vectors by refined Ritz vectors in …

This paper is concerned with solving large-scale eigenvalue problems by algebraic
substructuring. Algebraic substructuring refers to the process of applying matrix reordering …