Fast Computation of Spectral Densities for Generalized Eigenvalue Problems

DOI10.1137/17M1135542zbMath1416.65097arXiv1706.06610OpenAlexW2962939379WikidataQ129270940 ScholiaQ129270940MaRDI QIDQ4584929

Yuanzhe Xi, Yousef Saad, Ruipeng Li

Publication date: 5 September 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06610

zbMATH Keywords

perturbation theoryspectral densitydensity of statesspectrum slicingChebyshev approximationgeneralized eigenvalue problems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10)

Related Items

Stochastic algorithms for self-consistent calculations of electronic structures, Fast and stable schemes for phase fields models, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software

Uses Software

• AMD

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral Schur complement techniques for symmetric eigenvalue problems
• Randomized estimation of spectral densities of large matrices made accurate
• Bounding the spectrum of large Hermitian matrices
• Self-consistent-field calculations using Chebyshev-filtered subspace iteration
• Chebyshev semi-iteration in preconditioning for problems including the mass matrix
• Matrix pseudo-spectroscopy: Iterative calculation of matrix eigenvalues and eigenvectors of large matrices using a polynomial expansion of the Dirac delta function
• Kernel polynomial approximations for densities of states and spectral functions
• A spectrum slicing method for the Kohn-Sham problem
• Approximating Spectral Densities of Large Matrices
• A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
• Computing Partial Spectra with Least-Squares Rational Filters
• Numerical Methods for Large Eigenvalue Problems
• The kernel polynomial method
• Computing $f(A)b$ via Least Squares Polynomial Approximations
• SMASH: Structured matrix approximation by separation and hierarchy
• A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
• Conditioning of finite element equations with arbitrary anisotropic meshes
• A QUANTITATIVE FORMULATION OF SYLVESTER'S LAW OF INERTIA
• A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
• Matrix Analysis
• Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
• A probing method for computing the diagonal of a matrix inverse
• An Empirical Comparison of Graph Laplacian Solvers
• Improving the Incoherence of a Learned Dictionary via Rank Shrinkage
• Functions of Matrices
• Algorithm 837
• Calculation of Gauss Quadrature Rules
• A fast algorithm for particle simulations