MUSE
MUSE: Multi-algorithm collaborative crystal structure prediction, Comput. Phys. Commun. 185 (2014) 1893
Introduction:
MUSE is short for Multi-algorithm-collaborative Universal Structure-prediction Environment, which was developed for easy use in structure prediction of materials under ambient or extreme conditions, such as high pressure. It is written in Python and organically combines the multi algorithms including the evolutionary algorithm, the simulated annealing algorithm and the basin hopping algorithm to collaboratively search the global energy minimum of materials with the fixed stoichiometry. After introduced the competition in all the evolutionary and variation operators, the evolution of the crystal population and the choice of the operators are self-adaptive automatically, i.e. the crystal population undergoes the self-adaptive evolution process. So, it can very effectively predict materials’ stable and metastable structures under certain conditions only provided the chemical information of the material. Its success rate is almost 100%.
Features:
- Very easy to use
- Multi-algorithm collaboration
- Self-adaptive evolution
- Ten evolutionary and variation operators competition
- The symmetry constraints on the first generation
- The elimination of duplicate structures by congruent-triangle fingerprint
- Interfaced with VASP, SIESTA, CASTEP, Quantum Espresso, and LAMMPS
- Almost 100% success rate
Capabilities
From version 4.3, MUSE is coded with Python 3 and has the ability to predict 2D, 1D, and 0D systems. It can do the following predictions:
- 3D bulk crystal structure prediction;
- 2D layered crystal structure prediction;
- 1D linear crystal structure prediction;
- 0D cluster or molecule structure prediction.
Publications: