论文标题
用于生成不可约的站点占用配置的算法
Algorithm for generating irreducible site-occupancy configurations
论文作者
论文摘要
通过利用晶体对称性来生成不可约束的位点占用构型,是加速无序结构预测的无处不在的方法,在凝结物理学和材料科学中起着重要作用。在这里,我们提出了一种用于生成不可减至的位点占用配置的新算法,该算法可用于具有任何超级细胞膨胀矩阵的任意父单元,以及任何数量的具有任意化学计量的原子类型。新算法通过搜索基础晶格的空间组操作并基于它构建等效的原子矩阵来标识对称等效的配置。重要的是,配置的整数表示可以极大地加速消除重复配置的速度,从而导致运行时间的线性尺度,并具有最终发现的不可约合配置的数量。此外,根据我们的新算法,我们编写了相应的代码,称为Fortran编程语言中的疾病,并且性能测试结果表明,我们的疾病代码的时间效率优于其他相关代码(SuperCell,Enumlib和Sod)。
Generating irreducible site-occupancy configurations by taking advantage of crystal symmetry is a ubiquitous method for accelerating of disordered structure prediction, which plays an important role in condensed matter physics and material science. Here, we present a new algorithm for generating irreducible site-occupancy configurations, that works for arbitrary parent cell with any supercell expansion matrix, and for any number of atom types with arbitrary stoichiometry. The new algorithm identifies the symmetrically equivalent configurations by searching the space group operations of underlying lattice and building the equivalent atomic matrix based on it. Importantly, an integer representation of configurations can greatly accelerate the speed of elimination of duplicate configurations, resulting into a linear scale of run time with the number of irreducible configurations that finally found. Moreover, based on our new algorithm, we write the corresponding code named as disorder in FORTRAN programming language, and the performance test results show that the time efficiency of our disorder code is superior to that of other related codes (supercell, enumlib and SOD).