.png){kind=icon}
返回
Discrete dislocation dynamics by an O(N) algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/S0927-0256(02)00363-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An efficient numerical algorithm for discrete dislocation dynamics simulations in two-dimensional, finite polygonal domains is presented. The algorithm is based on a complex boundary integral equation method. By use of the fast multipole method, linear complexity and storage requirement are achieved. This method has not, to the present author's knowledge, previously been used in such simulations. Convergence studies show that the algorithm is accurate and numerically stable. Results from uniaxial load and bending moment load simulations at different loading rates are presented. The effect of finite size is studied. The results show that higher loading rate gives less yielding, and that a smaller specimen is harder than a larger one. This is in agreement with well-known results, and demonstrates that the dislocation dynamics model can describe important features of the physical problem. The cut-off velocity, that is the maximum velocity of the dislocations, is an important model parameter. In the present paper, it is shown that a four times higher cut-off velocity than was previously deemed sufficient is needed to obtain results independent of the cut-off velocity for the bending moment load simulations. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
dislocations
plasticity
size effect
fast multipole method
numerical simulations
efficient algorithm
期刊
IF:
3.3
论文数:
1.4W
被引数:
3.6W
机构
暂无机构信息
引用论文
The Connectedness of Packed Circles and Spheres with Application to Conductive Cellular Materials.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏A multi-variable grey model with a self-memory component and its application on engineering prediction具有自记忆成分的多变量灰色模型及其在工程预测中的应用
PREAI
分享收藏
查看更多内容