Approximating Spectral Densities of Large Matrices

DOI10.1137/130934283zbMath1338.15026arXiv1308.5467OpenAlexW1491884104MaRDI QIDQ2808266

Lin Lin, Chao Yang, Yousef Saad

Publication date: 20 May 2016

Published in: SIAM Review (Search for Journal in Brave)

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

zbMATH Keywords

quantum mechanicsspectral densitydensity of statesapproximation of distributionlarge scale sparse matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Stochastic algorithms for self-consistent calculations of electronic structures, Some error analysis for the quantum phase estimation algorithms, Numerical approximation of the spectrum of self-adjoint operators in operator preconditioning, Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness, Spectrally optimized pointset configurations, On randomized trace estimates for indefinite matrices with an application to determinants, Fast Computation of Spectral Densities for Generalized Eigenvalue Problems, A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport, A Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a Matrix, Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation, Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature, ELSI -- an open infrastructure for electronic structure solvers, Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC, Epistemic uncertainty quantification in deep learning classification by the delta method, A literature survey of matrix methods for data science, Limited‐memory polynomial methods for large‐scale matrix functions, Efficient estimation of eigenvalue counts in an interval, Fast randomized numerical rank estimation for numerically low-rank matrices, Weighted Trace-Penalty Minimization for Full Configuration Interaction, Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, Mathematical methods in quantum chemistry. Abstracts from the workshop held March 18--24, 2018, Computational Materials Science and Engineering, The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output, Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials, Randomized estimation of spectral densities of large matrices made accurate, A contour-integral based method for counting the eigenvalues inside a region, Adaptively Compressed Polarizability Operator for Accelerating Large Scale Ab Initio Phonon Calculations, Computing spectral measures and spectral types, Split representation of adaptively compressed polarizability operator, A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, How Accurately Should I Compute Implicit Matrix-Vector Products When Applying the Hutchinson Trace Estimator?, Bulk spectrum and K-theory for infinite-area topological quasicrystals, Inertia laws and localization of real eigenvalues for generalized indefinite eigenvalue problems, Localized Fourier analysis for graph signal processing, Rational Spectral Filters with Optimal Convergence Rate, Computing Spectral Measures of Self-Adjoint Operators, Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure

Uses Software

• SparseMatrix

Cites Work

• Bounding the spectrum of large Hermitian matrices
• Self-consistent-field calculations using Chebyshev-filtered subspace iteration
• Matrix pseudo-spectroscopy: Iterative calculation of matrix eigenvalues and eigenvectors of large matrices using a polynomial expansion of the Dirac delta function
• Electronic structure calculations for plane-wave codes without diagonalization
• Kernel polynomial approximations for densities of states and spectral functions
• Computing Probabilistic Bounds for Extreme Eigenvalues of Symmetric Matrices with the Lanczos Method
• Large-Scale Normal Coordinate Analysis for Molecular Structures
• The university of Florida sparse matrix collection
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• The kernel polynomial method
• A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
• HANS BETHE'S CONTRIBUTIONS TO SOLID-STATE PHYSICS
• Computational Aspects of Three-Term Recurrence Relations
• Calculation of Gauss Quadrature Rules
• Construction of Gauss-Christoffel Quadrature Formulas
• Geometry of moment spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item