A sparse-sampling approach for the fast computation of matrices: application to molecular vibrations

Abstract

This article presents a new method to compute matrices from numerical simulations based on the ideas of sparse sampling and compressed sensing. The method is useful for problems where the determination of the entries of a matrix constitutes the computational bottleneck. We apply this new method to an important problem in computational chemistry: the determination of molecular vibrations from electronic structure calculations, where our results show that the overall scaling of the procedure can be improved in some cases. Moreover, our method provides a general framework for bootstrapping cheap low-accuracy calculations in order to reduce the required number of expensive high-accuracy calculations, resulting in a significant 3x speed-up in actual calculations.

9 pages, 7 figures

References in corpus (9)

• Phonons and related properties of extended systems from density-functional perturbation theory
• Quantum state tomography via compressed sensing
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Compressive sensing as a new paradigm for model building
• Measure What Should be Measured: Progress and Challenges in Compressive Sensing
• Quantum process tomography of unitary and near-unitary maps
• Application of compressed sensing to the simulation of atomic systems
• Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME)
• More accurate and efficient bath spectral densities from super-resolution