Linear-scaling Algorithms
Linear-Scaling Algorithms is a computational method in quantum chemistry whose time and memory requirements scale asymptotically linear with the system size, enabling efficient electronic structure calculations for large molecules by exploiting spatial locality of electronic interactions.
467
Publications
72.9K
Citations
977
Authors
412
Institutions
Publications per year
2017–2026
78
Variants
Linear Scaling MethodsO(n) Algorithms
467
Improved grid‐based algorithm for Bader charge allocation
Edward Sanville, S.D. Kenny, Roger Smith et al. · Journal of Computational Chemistry · 2007 · 4.2K citations · Full text
Thomas D. Kühne, Marcella Iannuzzi, Mauro Del Ben et al. · The Journal of Chemical Physics · 2020 · 4.1K citations · Full text
Pablo Ordejón, Emilio Artacho, José M. Soler · Physical review. B, Condensed matter · 1996 · 2.6K citations · Full text
Natural Sciences, Chemistry, Physics +17
1–5 of 467
977
20
h-index
13
h-index
13
h-index
13
h-index
10
h-index
1–5 of 977
412

Lawrence Berkeley National Laboratory
Berkeley, United States
17 h-index
47 publications
12.2K citations
University of California, Berkeley
Berkeley, United States
15 h-index
41 publications
9.7K citations
University of Cambridge
Cambridge, United Kingdom
14 h-index
29 publications
1.8K citations
University College London
London, United Kingdom
14 h-index
35 publications
3.3K citations

Rice University
Houston, United States
13 h-index
27 publications
4.5K citations
Ludwig-Maximilians-Universität München
Munich, Germany
13 h-index
37 publications
2.3K citations
Los Alamos National Laboratory
Los Alamos, United States
12 h-index
36 publications
1.5K citations
Japan Science and Technology Agency
Tokyo, Japan
12 h-index
25 publications
787 citations
1–8 of 412
125 publications · 19.2K citations
64
h-index
JCTC · 41 publications · 3.3K citations
27
h-index
29 publications · 15.1K citations
21
h-index
PRB · 17 publications · 5.3K citations
15
h-index
17 publications · 8.3K citations
15
h-index
1–5