Approximating matrix eigenvalues by subspace iteration with repeated random sparsification

Abstract

Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by leveraging repeated random sampling and averaging. We present a general approach to extending such methods for the estimation of multiple eigenvalues and demonstrate its performance for several benchmark problems in quantum chemistry.

arXiv comment31 pages, 8 figures

References in corpus (20)

• emcee: The MCMC Hammer
• A Data-Driven Approximation of the Koopman Operator: Extending Dynamic Mode Decomposition
• Semistochastic Projector Monte Carlo Method
• Ab initio computations of molecular systems by the auxiliary-field quantum Monte Carlo method
• Unbiased Reduced Density Matrices and Electronic Properties from Full Configuration Interaction Quantum Monte Carlo
• Linear-scaling and parallelizable algorithms for stochastic quantum chemistry
• An excited-state approach within full configuration interaction quantum Monte Carlo
• The sign problem and population dynamics in the full configuration interaction quantum Monte Carlo method
• Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
• Krylov-projected quantum Monte Carlo
• Integrated VAC: A robust strategy for identifying eigenfunctions of dynamical operators
• The effect of quantization on the FCIQMC sign problem
• Preconditioning and perturbative estimators in full configuration interaction quantum Monte Carlo
• Fast randomized iteration: diffusion Monte Carlo through the lens of numerical linear algebra
• Transfer-Matrix Monte Carlo Estimates of Critical Points in the Simple Cubic Ising, Planar and Heisenberg Models
• Non-linear biases, stochastically-sampled effective Hamiltonians and spectral functions in quantum Monte Carlo methods
• Understanding and Improving the Efficiency of Full Configuration Interaction Quantum Monte Carlo
• The full configuration interaction quantum Monte Carlo method in the lens of inexact power iteration
• Error bounds for dynamical spectral estimation
• On a characterization of ordered pivotal sampling

Cited by in corpus (2)

• Full Configuration Interaction Excited-State Energies in Large Active Spaces from Subspace Iteration with Repeated Random Sparsification
• Bound excited states of Fröhlich polarons in one dimension