Efficient estimation of eigenvalue counts in an interval
Preprint
Abstract
Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an exact count is not necessary and methods based on stochastic estimates can be utilized to yield rough approximations. This paper examines a number of techniques tailored to this specific task. It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with a stochastic procedure.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- A survey of direct methods for sparse linear systemsActa Numerica, 2016
- Dissecting the FEAST algorithm for generalized eigenproblemsJournal of Computational and Applied Mathematics, 2013
- A spectrum slicing method for the Kohn–Sham problemComputer Physics Communications, 2012
- A probing method for computing the diagonal of a matrix inverseNumerical Linear Algebra with Applications, 2011
- Density-matrix-based algorithm for solving eigenvalue problemsPhysical Review B, 2009
- A projection method for generalized eigenvalue problems using numerical integrationJournal of Computational and Applied Mathematics, 2003
- Kernel polynomial method for a nonorthogonal electronic-structure calculation of amorphous diamondPhysical Review B, 1997
- Kernel Polynomial Approximations for Densities of States and Spectral FunctionsJournal of Computational Physics, 1996
- Calculating the density of states and optical-absorption spectra of large quantum systems by the plane-wave moments methodPhysical Review B, 1994
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splinesCommunications in Statistics - Simulation and Computation, 1990