Efficient estimation of eigenvalue counts in an interval
arXiv:1308.4275
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.
24 pages and 8 figures. Submitted to Numerical Linear Algebra with Applications
References in corpus (2)
Cited by in corpus (12)
- High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
- A reduced basis approach for calculation of the Bethe-Salpeter excitation energies using low-rank tensor factorizations
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- Fast estimation of approximate matrix ranks using spectral densities
- Performance Engineering of the Kernel Polynomial Method on Large-Scale CPU-GPU Systems
- Approximating the Spectral Sums of Large-scale Matrices using Chebyshev Approximations
- A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport
- Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
- Random sampling of bandlimited signals on graphs
- Stochastic calculation of the Dirac spectrum on the lattice and a determination of chiral condensate in 2+1-flavor QCD
- A Contour-integral Based Method for Counting the Eigenvalues Inside a Region in the Complex Plane
- A Spectral Projection Preconditioner for Solving Ill Conditioned Linear Systems