Author:
Mamee T,Anukool W,Thaicharoen N,Chattrapiban N,Sompet P
Abstract
Abstract
We establish an algorithm and computational results based on heuristic rearrangement of randomly filled array toward a defect-free and compact array. In this approach, the vacancies are filled from the inner layer that is related to the distance from the center of each loading site. By rearranging the position of atoms that maximize the compactness of the system layer by layer, the algorithm is set to iterate until the compactness reaches its local maximum. The results show that by applying the algorithm, the compactness of the system converges up to ∼97% of the theoretical maximum.
Subject
General Physics and Astronomy
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献