Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMagGene: A genetic evolution program for magnetic structure prediction
128
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We have developed a software MagGene to predict magnetic structures by using genetic algorithm. Starting from an atom structure, MagGene repeatedly generates new magnetic structures and calls first-principles calculation engine to get the most stable structure. This software is applicable to both collinear and noncollinear systems. It is particularly convenient for predicting the magnetic structures of atomic systems with strong spin-orbit couplings and/or strong spin frustrations.
rate research
Read More
We present the implementation of GAtor, a massively parallel, first principles genetic algorithm (GA) for molecular crystal structure prediction. GAtor is written in Python and currently interfaces with the FHI-aims code to perform local optimizations and energy evaluations using dispersion-inclusive density functional theory (DFT). GAtor offers a variety of fitness evaluation, selection, crossover, and mutation schemes. Breeding operators designed specifically for molecular crystals provide a balance between exploration and exploitation. Evolutionary niching is implemented in GAtor by using machine learning to cluster the dynamically updated population by structural similarity and then employing a cluster-based fitness function. Evolutionary niching promotes uniform sampling of the potential energy surface by evolving several sub-populations, which helps overcome initial pool biases and selection biases (genetic drift). The various settings offered by GAtor increase the likelihood of locating numerous low-energy minima, including those located in disconnected, hard to reach regions of the potential energy landscape. The best structures generated are re-relaxed and re-ranked using a hierarchy of increasingly accurate DFT functionals and dispersion methods. GAtor is applied to a chemically diverse set of four past blind test targets, characterized by different types of intermolecular interactions. The experimentally observed structures and other low-energy structures are found for all four targets. In particular, for Target II, 5-cyano-3-hydroxythiophene, the top ranked putative crystal structure is a $Z^prime$=2 structure with P$bar{1}$ symmetry and a scaffold packing motif, which has not been reported previously.
Crystal structure prediction (CSP) has emerged as one of the most important approaches for discovering new materials. CSP algorithms based on evolutionary algorithms and particle swarm optimization have discovered a great number of new materials. However, these algorithms based on ab initio calculation of free energy are inefficient. Moreover, they have severe limitations in terms of scalability. We recently proposed a promising crystal structure prediction method based on atomic contact maps, using global optimization algorithms to search for the Wyckoff positions by maximizing the match between the contact map of the predicted structure and the contact map of the true crystal structure. However, our previous contact map based CSP algorithms have two major limitations: (1) the loss of search capability due to getting trapped in local optima; (2) it only uses the connection of atoms in the unit cell to predict the crystal structure, ignoring the chemical environment outside the unit cell, which may lead to unreasonable coordination environments. Herein we propose a novel multi-objective genetic algorithms for contact map-based crystal structure prediction by optimizing three objectives, including contact map match accuracy, the individual age, and the coordination number match. Furthermore, we assign the age values to all the individuals of the GA and try to minimize the age aiming to avoid the premature convergence problem. Our experimental results show that compared to our previous CMCrystal algorithm, our multi-objective crystal structure prediction algorithm (CMCrystalMOO) can reconstruct the crystal structure with higher quality and alleviate the problem of premature convergence.
Reliable and robust methods of predicting the crystal structure of a compound, based only on its chemical composition, is crucial to the study of materials and their applications. Despite considerable ongoing research efforts, crystal structure prediction remains a challenging problem that demands large computational resources. Here we propose an efficient approach for first-principles crystal structure prediction. The new method explores and finds crystal structures by tiling together elementary tetrahedra that are energetically favorable and geometrically matching each other. This approach has three distinguishing features: a favorable building unit, an efficient calculation of local energy, and a stochastic Monte Carlo simulation of crystal growth. By applying the method to the crystal structure prediction of various materials, we demonstrate its validity and potential as a promising alternative to current methods.
Crystal structure determines properties of materials. With the crystal structure of a chemical substance, many physical and chemical properties can be predicted by first-principles calculations or machine learning models. Since it is relatively easy to generate a hypothetical chemically valid formula, crystal structure prediction becomes an important method for discovering new materials. In our previous work, we proposed a contact map-based crystal structure prediction method, which uses global optimization algorithms such as genetic algorithms to maximize the match between the contact map of the predicted structure and the contact map of the real crystal structure to search for the coordinates at the Wyckoff Positions(WP). However, when predicting the crystal structure with high symmetry, we found that the global optimization algorithm has difficulty to find an effective combination of WPs that satisfies the chemical formula, which is mainly caused by the inconsistency between the dimensionality of the contact map of the predicted crystal structure and the dimensionality of the contact map of the target crystal structure. This makes it challenging to predict the crystal structures of high-symmetry crystals. In order to solve this problem, here we propose to use PyXtal to generate and filter random crystal structures with given symmetry constraints based on the information such as chemical formulas and space groups. With contact map as the optimization goal, we use differential evolution algorithms to search for non-special coordinates at the Wyckoff positions to realize the structure prediction of high-symmetry crystal materials. Our experimental results show that our proposed algorithm CMCrystalHS can effectively solve the problem of inconsistent contact map dimensions and predict the crystal structures with high symmetry.
This paper discusses scalability of standard genetic programming (GP) and the probabilistic incremental program evolution (PIPE). To investigate the need for both effective mixing and linkage learning, two test problems are considered: ORDER problem, which is rather easy for any recombination-based GP, and TRAP or the deceptive trap problem, which requires the algorithm to learn interactions among subsets of terminals. The scalability results show that both GP and PIPE scale up polynomially with problem size on the simple ORDER problem, but they both scale up exponentially on the deceptive problem. This indicates that while standard recombination is sufficient when no interactions need to be considered, for some problems linkage learning is necessary. These results are in agreement with the lessons learned in the domain of binary-string genetic algorithms (GAs). Furthermore, the paper investigates the effects of introducing utnnecessary and irrelevant primitives on the performance of GP and PIPE.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
