Papers › Large scale and linear scaling DFT with the CONQUEST code
Large scale and linear scaling DFT with the CONQUEST code
Ayako Nakata, Jack Baker, Shereif Mujahed, Jack T. L. Poulton, Sergiu Arapan, Jianbo Lin, Zamaan Raza, Sushma Yadav, Lionel Truflandier, Tsuyoshi Miyazaki, David R. Bowler
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We survey the underlying theory behind the large-scale and linear scaling DFT code, Conquest, which shows excellent parallel scaling and can be applied to thousands of atoms with exact solutions, and millions of atoms with linear scaling. We give details of the representation of the density matrix and the approach to finding the electronic ground state, and discuss the implementation of molecular dynamics with linear scaling. We give an overview of the performance of the code, focussing in particular on the parallel scaling, and provide examples of recent developments and applications.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections