Fast computation of spectral densities for generalized eigenvalue problems
From MaRDI portal
Abstract: The distribution of the eigenvalues of a Hermitian matrix (or of a Hermitian matrix pencil) reveals important features of the underlying problem, whether a Hamiltonian system in physics, or a social network in behavioral sciences. However, computing all the eigenvalues explicitly is prohibitively expensive for real-world applications. This paper presents two types of methods to efficiently estimate the spectral density of a matrix pencil when both and are Hermitian and, in addition, is positive definite. The first one is based on the Kernel Polynomial Method (KPM) and the second on Gaussian quadrature by the Lanczos procedure. By employing Chebyshev polynomial approximation techniques, we can avoid direct factorizations in both methods, making the resulting algorithms suitable for large matrices. Under some assumptions, we prove bounds that suggest that the Lanczos method converges twice as fast as the KPM method. Numerical examples further indicate that the Lanczos method can provide more accurate spectral densities when the eigenvalue distribution is highly non-uniform. As an application, we show how to use the computed spectral density to partition the spectrum into intervals that contain roughly the same number of eigenvalues. This procedure, which makes it possible to compute the spectrum by parts, is a key ingredient in the new breed of eigensolvers that exploit "spectrum slicing".
Recommendations
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
- Randomized estimation of spectral densities of large matrices made accurate
- Efficient estimation of eigenvalue counts in an interval.
- Spectral Schur complement techniques for symmetric eigenvalue problems
Cites work
- A fast algorithm for particle simulations
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- A probing method for computing the diagonal of a matrix inverse.
- A QUANTITATIVE FORMULATION OF SYLVESTER'S LAW OF INERTIA
- A spectrum slicing method for the Kohn-Sham problem
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Algorithm 837
- An empirical comparison of graph Laplacian solvers
- Approximating spectral densities of large matrices
- Approximation theory and approximation practice
- Bounding the spectrum of large Hermitian matrices
- Calculation of Gauss Quadrature Rules
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- Computing f(A)b via least squares polynomial approximations
- Computing partial spectra with least-squares rational filters
- Conditioning of finite element equations with arbitrary anisotropic meshes
- Functions of Matrices
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- Improving the incoherence of a learned dictionary via rank shrinkage
- Kernel polynomial approximations for densities of states and spectral functions
- Matrix Analysis
- Matrix pseudo-spectroscopy: Iterative calculation of matrix eigenvalues and eigenvectors of large matrices using a polynomial expansion of the Dirac delta function
- Numerical methods for large eigenvalue problems
- Randomized estimation of spectral densities of large matrices made accurate
- Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- SMASH: structured matrix approximation by separation and hierarchy.
- Spectral Schur complement techniques for symmetric eigenvalue problems
- The kernel polynomial method
Cited in
(13)- Fast spectral projection algorithms for density-matrix computations
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- Fast and stable schemes for phase fields models
- scientific article; zbMATH DE number 1714603 (Why is no real title available?)
- Approximating spectral densities of large matrices
- Localized spectrum slicing
- Generalized spectrum approximation and numerical computation of eigenvalues for Schrödinger's operators
- Eigenvalue computations in the context of data-sparse approximations of integral operators
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- Stochastic algorithms for self-consistent calculations of electronic structures
- Computational procedure for a fast calculation of eigenvectors and eigenvalues of structures with random properties
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- On a shrink-and-expand technique for symmetric block eigensolvers
This page was built for publication: Fast computation of spectral densities for generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584929)
