TY - JOUR

T1 - CPU-accelerated explicit discontinuous deformation analysis and its application to landslide analysis

AU - Peng, Xinyan

AU - Yu, Pengcheng

AU - Chen, Guangqi

AU - Xia, Mingyao

AU - Zhang, Yingbin

N1 - Publisher Copyright:
© 2019 Elsevier Inc.

PY - 2020/1

Y1 - 2020/1

N2 - An explicit discontinuous deformation analysis (DDA) that uses an explicit time integration procedure and an explicit calculation of interaction forces between blocks is proposed to overcome the limitations of conventional implicit DDA in simulating large-scale problems. The advantages of the explicit DDA are that (1) the global equilibrium equations are unnecessary to be assembled and the solving for unknowns of every block can be performed independently and conveniently, thereby reducing the computational effort and memory requirement; (2) the open-close iteration process is avoided because the interaction forces between blocks are calculated explicitly according to the initial information at the start of the current time step. The efficient parallel computing is very appropriate for the explicit DDA. To further improve its computational efficiency, the explicit DDA is paralleled based on OpenMP. The accuracy of the explicit DDA is verified through several numerical examples with analytical solutions, experimental data or field observation. Further, the computational efficiency is demonstrated by a series of models and the parallel speedup factor on 6 OpenMP threads is approximately 4.2. Conclusively, the explicit DDA is promising for analyzing blocky systems in large scale.

AB - An explicit discontinuous deformation analysis (DDA) that uses an explicit time integration procedure and an explicit calculation of interaction forces between blocks is proposed to overcome the limitations of conventional implicit DDA in simulating large-scale problems. The advantages of the explicit DDA are that (1) the global equilibrium equations are unnecessary to be assembled and the solving for unknowns of every block can be performed independently and conveniently, thereby reducing the computational effort and memory requirement; (2) the open-close iteration process is avoided because the interaction forces between blocks are calculated explicitly according to the initial information at the start of the current time step. The efficient parallel computing is very appropriate for the explicit DDA. To further improve its computational efficiency, the explicit DDA is paralleled based on OpenMP. The accuracy of the explicit DDA is verified through several numerical examples with analytical solutions, experimental data or field observation. Further, the computational efficiency is demonstrated by a series of models and the parallel speedup factor on 6 OpenMP threads is approximately 4.2. Conclusively, the explicit DDA is promising for analyzing blocky systems in large scale.

UR - http://www.scopus.com/inward/record.url?scp=85069918250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069918250&partnerID=8YFLogxK

U2 - 10.1016/j.apm.2019.07.028

DO - 10.1016/j.apm.2019.07.028

M3 - Article

AN - SCOPUS:85069918250

SN - 0307-904X

VL - 77

SP - 216

EP - 234

JO - Applied Mathematical Modelling

JF - Applied Mathematical Modelling

ER -