TTDFT: a GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

DOI10.1016/J.CPC.2022.108516arXiv2110.15853OpenAlexW3211276677WikidataQ114192599 ScholiaQ114192599MaRDI QIDQ6097322FDOQ6097322

Authors: Chih-Chuen Lin, V. Gavini 

Publication date: 5 June 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtering subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. The computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

Full work available at URL: https://arxiv.org/abs/2110.15853

zbMATH Keywords

real-spaceTucker tensorKohn-Sham density functional theorytensor-structured methodsL-1 localization

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX) Computer science (68-XX)

Cites Work

• TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
• Tensor Decompositions and Applications
• Communication-optimal parallel and sequential QR and LU factorizations
• Compressed modes for variational problems in mathematics and physics
• Tensor spaces and numerical tensor calculus
• A literature survey of low-rank tensor approximation techniques
• 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
• Higher-order adaptive finite-element methods for Kohn-Sham density functional theory
• Adaptive local basis set for Kohn-Sham density functional theory in a discontinuous Galerkin framework. I: Total energy calculation
• Tensor-product approximation to operators and functions in high dimensions
• Approximation of the electron density of aluminium clusters in tensor-product format
• A Block Orthogonalization Procedure with Constant Synchronization Requirements
• DFT-FE - a massively parallel adaptive finite-element code for large-scale density functional theory calculations
• Towards reduced basis approaches in ab initio electronic structure computations
• DFT-FE 1.0: a massively parallel hybrid CPU-GPU density functional theory code using finite-element discretization

Cited In (1)

• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097322)