Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
DOI10.1137/19M1252855zbMATH Open1433.65369WikidataQ126389252 ScholiaQ126389252MaRDI QIDQ5208739FDOQ5208739
Authors: Xin Xing, Edmond Chow 
Publication date: 10 January 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Recommendations
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
- Fast updating multipole coulombic potential calculation
- Compression of the electron repulsion integral tensor in tensor hypercontraction format with cubic scaling cost
- Efficient evaluation of the matrix elements of the Coulomb potential between plane waves and Gaussians
hierarchical matrix representationproxy point methodblock low-rankcontinuous fast multipole methodelectron repulsion integral tensor
Computational methods for sparse matrices (65F50) Applications to the sciences (65Z05) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A fast algorithm for particle simulations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- A theory of pseudoskeleton approximations
- Approximation of boundary element matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Tensor-structured factorized calculation of two-electron integrals in a general basis
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A fast direct solver for boundary integral equations in two dimensions
- A kernel independent fast multipole algorithm for radial basis functions
- A fast direct solver for structured linear systems by recursive skeletonization
- On the Compression of Low Rank Matrices
- A matrix version of the fast multipole method
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Compression of the electron repulsion integral tensor in tensor hypercontraction format with cubic scaling cost
- Fast spatial Gaussian process maximum likelihood estimation via skeletonization factorizations
- Error analysis of an accelerated interpolative decomposition for 3D Laplace problems
- Interpolative decomposition via proxy points for kernel matrices
Cited In (4)
- Factorized structure of the long-range two-electron integrals tensor and its application in quantum chemistry
- Efficient calculation of the Coulomb matrix and its expansion around k=0 within the FLAPW method
- Efficient evaluation of the matrix elements of the Coulomb potential between plane waves and Gaussians
- Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
This page was built for publication: Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208739)
