Approximating matrix eigenvalues by subspace iteration with repeated random sparsification

Samuel M. Greene, Robert J. Webber, Timothy C. Berkelbach +1

Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the es…