The DOI matches its Crossref record.
A periodic genetic algorithm with real-space representation for crystal structure and polymorph prediction
Open accessAbstract
A genetic algorithm is described that is suitable for determining the global minimum energy configurations of crystal structures and which can also be used as a polymorph search technique. This algorithm requires no prior assumptions about unit cell size, shape, or symmetry, nor about the ionic configuration within the unit cell. This therefore enables true ab initio crystal structure and polymorph prediction. Our algorithm uses a real-space representation of the population members, and makes use of a periodic cut for the crossover operation. Results on large Lennard-Jones systems with fcc- and hcp-commensurate cells show robust convergence to the bulk structure from a random initial assignment and an ability to successfully discriminate between competing low enthalpy configurations. Results from an ab initio carbon polymorph search show the spontaneous emergence of both Lonsdaleite and graphite-like structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
CALYPSO: A method for crystal structure prediction
Wang, Y., Lv, J., Zhu, L., & Ma, Y. (2012) · Computer Physics Communications · doi:10.1016/j.cpc.2012.05.008 · Cited by 2,897
Crystal structure prediction via particle-swarm optimization
Wang, Y., Lv, J., Zhu, L., & Ma, Y. (2010) · Physical Review B · doi:10.1103/physrevb.82.094116 · Cited by 2,747
The high-throughput highway to computational materials design
Curtarolo, S., Hart, G. L. W., Nardelli, M. B., Mingo, N., Sanvito, S., & Levy, O. (2013) · Nature Materials · doi:10.1038/nmat3568 · Cited by 2,053
“…criteria for stability and for the size and position of the bandgap, example, cluster expansion 2,45 with exhaustive evaluation or genetic search algorithms on fixed-lattice systems 46–48 , and evolutionary algorithms for off-lattice structures in mixtures with fixed stoichio-metries 30,43,49–52 .”
BackgroundCrystal structure prediction from first principles
Woodley, S. M., & Catlow, R. (2008) · Nature Materials · doi:10.1038/nmat2321 · Cited by 733
Hautier, G., Fischer, C. C., Jain, A., Mueller, T., & Ceder, G. (2010) · Chemistry of Materials · doi:10.1021/cm100795d · Cited by 580
Lejaeghere, K., Van Speybroeck, V., Van Oost, G., & Cottenier, S. (2014) · Critical Reviews in Solid State and Materials Sciences · doi:10.1080/10408436.2013.772503 · Cited by 560
Density functional theory in the solid state
Hasnip, P. J., Refson, K., Probert, M. I. J., Yates, J. R., Clark, S. J., & Pickard, C. J. (2014) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2013.0270 · Cited by 400
Self-citationXtalOpt: An open-source evolutionary algorithm for crystal structure prediction
Lonie, D. C., & Zurek, E. (2011) · Computer Physics Communications · doi:10.1016/j.cpc.2010.07.048 · Cited by 355
Wang, Y., Miao, M., Lv, J., Zhu, L., Yin, K., Liu, H., & Ma, Y. (2012) · The Journal of Chemical Physics · doi:10.1063/1.4769731 · Cited by 332
Crystal structure prediction using the minima hopping method
Amsler, M., & Goedecker, S. (2010) · The Journal of Chemical Physics · doi:10.1063/1.3512900 · Cited by 306
Metadata
- Authors
- Abraham, N. L., & Probert, M. I. J.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2006-06-07
- Volume
- 73
- Issue
- 22
- ISSN
- 1098-0121 (ISSN-L)
- 1550-235X
- OpenAlex
- W2073820346
- Cited by
- 168
- References
- 0
- FWCI
- 5.86
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.