DFT-FE – A massively parallel adaptive finite-element code for large-scale density functional theory calculations

Main Author: Ballantyne, John
Other Authors: Motamarri, Phani, Das, Sambit, Rudraraju, Shiva, Ghosh, Krishnendu, Davydov, Denis, Gavini, Vikram
Format: Dataset
Terbitan: Mendeley , 2019
Subjects:
Online Access: https:/data.mendeley.com/datasets/tgdmgvmfft
ctrlnum 0.17632-tgdmgvmfft.1
fullrecord <?xml version="1.0"?> <dc><creator>Ballantyne, John</creator><title>DFT-FE &#x2013; A massively parallel adaptive finite-element code for large-scale density functional theory calculations</title><publisher>Mendeley</publisher><description>We present an accurate, efficient and massively parallel finite-element code, DFT-FE, for large-scale ab-initio calculations (reaching ~100,000 electrons) using Kohn&#x2013;Sham density functional theory (DFT). DFT-FE is based on a local real-space variational formulation of the Kohn&#x2013;Sham DFT energy functional that is discretized using a higher-order adaptive spectral finite-element (FE) basis, and treats pseudopotential and all-electron calculations in the same framework, while accommodating non-periodic, semi-periodic and periodic boundary conditions. We discuss the main aspects of the code, which include, the various strategies of adaptive FE basis generation, and the different approaches employed in the numerical implementation of the solution of the discrete Kohn&#x2013;Sham problem that are focused on significantly reducing the floating point operations, communication costs and latency. We demonstrate the accuracy of DFT-FE by comparing the energies, ionic forces and periodic cell stresses on a wide range of problems with popularly used DFT codes. Further, we demonstrate that DFT-FE significantly outperforms widely used plane-wave codes&#x2014;both in CPU-times and wall-times, and on both non-periodic and periodic systems&#x2014;at systems sizes beyond a few thousand electrons, with over 5-10 fold speedups in systems with more than 10,000 electrons. The benchmark studies also highlight the excellent parallel scalability of DFT-FE, with strong scaling demonstrated on up to 192,000 MPI tasks.</description><subject>Computational Physics</subject><subject>Molecular Dynamics</subject><subject>Electronic Structure</subject><subject>Electronic Band Structure</subject><contributor>Motamarri, Phani</contributor><contributor>Das, Sambit</contributor><contributor>Rudraraju, Shiva</contributor><contributor>Ghosh, Krishnendu</contributor><contributor>Davydov, Denis</contributor><contributor>Gavini, Vikram</contributor><type>Other:Dataset</type><identifier>10.17632/tgdmgvmfft.1</identifier><rights>GNU Lesser General Public License</rights><rights>https://www.gnu.org/licenses/lgpl-3.0.txt</rights><relation>https:/data.mendeley.com/datasets/tgdmgvmfft</relation><date>2019-10-30T12:12:04Z</date><recordID>0.17632-tgdmgvmfft.1</recordID></dc>
format Other:Dataset
Other
author Ballantyne, John
author2 Motamarri, Phani
Das, Sambit
Rudraraju, Shiva
Ghosh, Krishnendu
Davydov, Denis
Gavini, Vikram
title DFT-FE – A massively parallel adaptive finite-element code for large-scale density functional theory calculations
publisher Mendeley
publishDate 2019
topic Computational Physics
Molecular Dynamics
Electronic Structure
Electronic Band Structure
url https:/data.mendeley.com/datasets/tgdmgvmfft
contents We present an accurate, efficient and massively parallel finite-element code, DFT-FE, for large-scale ab-initio calculations (reaching ~100,000 electrons) using Kohn–Sham density functional theory (DFT). DFT-FE is based on a local real-space variational formulation of the Kohn–Sham DFT energy functional that is discretized using a higher-order adaptive spectral finite-element (FE) basis, and treats pseudopotential and all-electron calculations in the same framework, while accommodating non-periodic, semi-periodic and periodic boundary conditions. We discuss the main aspects of the code, which include, the various strategies of adaptive FE basis generation, and the different approaches employed in the numerical implementation of the solution of the discrete Kohn–Sham problem that are focused on significantly reducing the floating point operations, communication costs and latency. We demonstrate the accuracy of DFT-FE by comparing the energies, ionic forces and periodic cell stresses on a wide range of problems with popularly used DFT codes. Further, we demonstrate that DFT-FE significantly outperforms widely used plane-wave codes—both in CPU-times and wall-times, and on both non-periodic and periodic systems—at systems sizes beyond a few thousand electrons, with over 5-10 fold speedups in systems with more than 10,000 electrons. The benchmark studies also highlight the excellent parallel scalability of DFT-FE, with strong scaling demonstrated on up to 192,000 MPI tasks.
id IOS7969.0.17632-tgdmgvmfft.1
institution Universitas Islam Indragiri
affiliation onesearch.perpusnas.go.id
institution_id 804
institution_type library:university
library
library Teknologi Pangan UNISI
library_id 2816
collection Artikel mulono
repository_id 7969
city INDRAGIRI HILIR
province RIAU
shared_to_ipusnas_str 1
repoId IOS7969
first_indexed 2020-04-08T08:14:06Z
last_indexed 2020-04-08T08:14:06Z
recordtype dc
_version_ 1686587404180258816
score 17.538404