Efficient estimation of eigenvalue counts in an interval
From MaRDI portal
Publication:2955976
DOI10.1002/nla.2048zbMath1413.65092arXiv1308.4275OpenAlexW1485063553MaRDI QIDQ2955976
No author found.
Publication date: 13 January 2017
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4275
Chebyshev polynomialsFEASTeigenproblem resolventeigenvalue countstochastic trace estimatesubspace projector
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items (38)
Is the Burton-Miller formulation really free of fictitious eigenfrequencies? ⋮ Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver ⋮ A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport ⋮ High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations ⋮ Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature ⋮ A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices ⋮ Multiscale modal analysis of fully-loaded spent nuclear fuel canisters ⋮ ELSI -- an open infrastructure for electronic structure solvers ⋮ Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations ⋮ A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices ⋮ Hierarchical subspace evolution method for super large parallel computing: A linear solver and an eigensolver as examples ⋮ Random sampling of bandlimited signals on graphs ⋮ On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems ⋮ Fast randomized numerical rank estimation for numerically low-rank matrices ⋮ A Parameter Study of the Burton–Miller Formulation in the BEM Analysis of Acoustic Resonances in Exterior Configurations ⋮ 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 ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Computational Materials Science and Engineering ⋮ Faster stochastic trace estimation with a Chebyshev product identity ⋮ Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials ⋮ Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning ⋮ Evaluating non-analytic functions of matrices ⋮ A contour-integral based method for counting the eigenvalues inside a region ⋮ Multiscale S-Fraction Reduced-Order Models for Massive Wavefield Simulations ⋮ FEAST for Differential Eigenvalue Problems ⋮ Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils ⋮ Feast Eigensolver for Non-Hermitian Problems ⋮ A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems ⋮ Inertia laws and localization of real eigenvalues for generalized indefinite eigenvalue problems ⋮ Localized Fourier analysis for graph signal processing ⋮ Filter analysis for the stochastic estimation of eigenvalue counts ⋮ Rational Spectral Filters with Optimal Convergence Rate ⋮ Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic ⋮ Unnamed Item ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation ⋮ An algorithm for identifying eigenvectors exhibiting strong spatial localization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Improved bounds on sample size for implicit matrix trace estimators
- A method for profiling the distribution of eigenvalues using the AS method
- A projection method for generalized eigenvalue problems using numerical integration.
- Electronic structure calculations for plane-wave codes without diagonalization
- Kernel polynomial approximations for densities of states and spectral functions
- Dissecting the FEAST algorithm for generalized eigenproblems
- A spectrum slicing method for the Kohn-Sham problem
- An estimator for the diagonal of a matrix
- Approximating Spectral Densities of Large Matrices
- Parallel stochastic estimation method of eigenvalue distribution
- Stochastic estimation method of eigenvalue density for nonlinear eigenvalue problem on the complex plane
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
- Numerical Methods for Large Eigenvalue Problems
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Direct Methods for Sparse Linear Systems
- A probing method for computing the diagonal of a matrix inverse
- Filtered Conjugate Residual‐type Algorithms with Applications
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
This page was built for publication: Efficient estimation of eigenvalue counts in an interval
