TTDFT: a GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations
From MaRDI portal
Publication:6097322
DOI10.1016/J.CPC.2022.108516arXiv2110.15853OpenAlexW3211276677WikidataQ114192599 ScholiaQ114192599MaRDI QIDQ6097322
Publication date: 5 June 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.15853
Cites Work
- Tensor Decompositions and Applications
- Higher-order adaptive finite-element methods for Kohn-Sham density functional theory
- Approximation of the electron density of aluminium clusters in tensor-product format
- Adaptive local basis set for Kohn-Sham density functional theory in a discontinuous Galerkin framework. I: Total energy calculation
- A splitting method for orthogonality constrained problems
- Ab initio molecular simulations with numeric atom-centered orbitals
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- Towards reduced basis approaches in ab initio electronic structure computations
- Tensor-product approximation to operators and functions in high dimensions
- DFT-FE - a massively parallel adaptive finite-element code for large-scale density functional theory calculations
- A literature survey of low-rank tensor approximation techniques
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Tensor Spaces and Numerical Tensor Calculus
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- TuckerMPI
- Compressed modes for variational problems in mathematics and physics
- DFT-FE 1.0: a massively parallel hybrid CPU-GPU density functional theory code using finite-element discretization
This page was built for publication: TTDFT: a GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations
