Inverse subspace bi-iteration and bi-Newton methods for computing spectral projectors

Efficient inverse subspace bi-iteration and bi-Newton methods for computing the spectral projector associated with a group of eigenvalues near a specified shift of a large sparse matrix is proposed and justified. Numerical experiments with a discrete analogue of a non-Hermitian elliptic operator are discussed to illustrate the theory.