2016
DOI: 10.1088/0965-0393/24/2/025008
|View full text |Cite
|
Sign up to set email alerts
|

Complexity analysis of simulations with analytic bond-order potentials

Abstract: The modeling of materials at the atomistic level with interatomic potentials requires a reliable description of different bonding situations and relevant system properties. For this purpose, analytic bond-order potentials (BOPs) provide a systematic and robust approximation to density functional theory (DFT) and tight binding (TB) calculations at reasonable computational cost. This paper presents a formal analysis of the computational complexity of analytic BOP simulations, based on a detailed assessment of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(16 citation statements)
references
References 16 publications
(34 reference statements)
0
16
0
Order By: Relevance
“…For typical choices of the number of moments, the complexity of the calculations increases with the number of moments to the power of approximately 4.5. The implementation of analytic BOPs in BOPfox reaches this theoretical scaling limit 23 . The increase in the computational effort with the number of atoms is linear ( Fig.…”
Section: A Scalabilitymentioning
confidence: 92%
See 3 more Smart Citations
“…For typical choices of the number of moments, the complexity of the calculations increases with the number of moments to the power of approximately 4.5. The implementation of analytic BOPs in BOPfox reaches this theoretical scaling limit 23 . The increase in the computational effort with the number of atoms is linear ( Fig.…”
Section: A Scalabilitymentioning
confidence: 92%
“…The theoretical scalability of the computational effort with respect to the number of atoms and the number of moments is discussed in a detailed complexity analysis and systematic benchmarks in Ref. 23 . For typical choices of the number of moments, the complexity of the calculations increases with the number of moments to the power of approximately 4.5.…”
Section: A Scalabilitymentioning
confidence: 99%
See 2 more Smart Citations
“…. , j n , which is a task that is guided using a to-do list (Teijeiro et al, 2016b) and therefore can be safely executed independently of other iterations. Some partial force contributions associated with the half-length paths are already obtained at this point.…”
Section: Openmp Algorithmsmentioning
confidence: 99%