TY - JOUR
T1 - Acceleration of the Particle Swarm Optimization for Peierls–Nabarro modeling of dislocations in conventional and high-entropy alloys
AU - Pei, Zongrui
AU - Eisenbach, Markus
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - Dislocations are among the most important defects in determining the mechanical properties of both conventional alloys and high-entropy alloys. The Peierls–Nabarro model supplies an efficient pathway to their geometries and mobility. The difficulty in solving the integro-differential Peierls–Nabarro equation is how to effectively avoid the local minima in the energy landscape of a dislocation core. Among the other methods to optimize the dislocation core structures, we choose the algorithm of Particle Swarm Optimization, an algorithm that simulates the social behaviors of organisms. By employing more particles (bigger swarm) and more iterative steps (allowing them to explore for longer time), the local minima can be effectively avoided. But this would require more computational cost. The advantage of this algorithm is that it is readily parallelized in modern high computing architecture. We demonstrate the performance of our parallelized algorithm scales linearly with the number of employed cores.
AB - Dislocations are among the most important defects in determining the mechanical properties of both conventional alloys and high-entropy alloys. The Peierls–Nabarro model supplies an efficient pathway to their geometries and mobility. The difficulty in solving the integro-differential Peierls–Nabarro equation is how to effectively avoid the local minima in the energy landscape of a dislocation core. Among the other methods to optimize the dislocation core structures, we choose the algorithm of Particle Swarm Optimization, an algorithm that simulates the social behaviors of organisms. By employing more particles (bigger swarm) and more iterative steps (allowing them to explore for longer time), the local minima can be effectively avoided. But this would require more computational cost. The advantage of this algorithm is that it is readily parallelized in modern high computing architecture. We demonstrate the performance of our parallelized algorithm scales linearly with the number of employed cores.
KW - Acceleration
KW - Dislocations
KW - Particle Swarm Optimization
KW - Peierls–Nabarro model
UR - http://www.scopus.com/inward/record.url?scp=85013078155&partnerID=8YFLogxK
U2 - 10.1016/j.cpc.2017.01.022
DO - 10.1016/j.cpc.2017.01.022
M3 - Article
AN - SCOPUS:85013078155
SN - 0010-4655
VL - 215
SP - 7
EP - 12
JO - Computer Physics Communications
JF - Computer Physics Communications
ER -