Sparse approximate matrix-matrix multiplication for density matrix purification with error control
DOI10.1016/J.JCP.2021.110354OpenAlexW3081915641WikidataQ114163460 ScholiaQ114163460MaRDI QIDQ2124393FDOQ2124393
Authors: Anton G. Artemov, Emanuel H. Rubensson 
Publication date: 11 April 2022
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.10680
Recommendations
- Optimal sparse eigenspace and low-rank density matrix estimation for quantum systems
- Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Minimal Split Checkerboard Method for Exponentiating Sparse Matrices and Its Applications in Quantum Statistical Mechanics
- Optimal estimation of low rank density matrices
- Density matrix minimization with \({\ell}_1\) regularization
- Accelerated method for optimization over density matrices in quantum state estimation
Numerical linear algebra (65Fxx) Computer aspects of numerical algorithms (65Yxx) Applications of quantum theory to specific physical systems (81Vxx)
Cites Work
- Parallel sparse matrix multiplication for linear scaling electronic structure calculations
- A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
- Linear-scaling density-functional theory with tens of thousands of atoms: expanding the scope and scale of calculations with ONETEP
- Interior eigenvalues from density matrix expansions in quantum mechanical molecular dynamics
- An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay
- Massively parallel sparse matrix function calculations with NTPoly
Cited In (2)
Uses Software
This page was built for publication: Sparse approximate matrix-matrix multiplication for density matrix purification with error control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124393)
