An efficient numerical algorithm for discrete dislocation dynamics simulations in two-dimensional, finite polygonal domains was presented. The algorithm was based upon a complex boundary integral equation method. By use of the fast multi-pole method, linear complexity and storage requirement were achieved. This method did not seem to have been previously used in such simulations. Convergence studies showed that the algorithm was accurate and numerically stable. Results from uniaxial load and bending moment load simulations at different loading rates were presented. The effect of finite size was

studied. The results showed that higher loading rate gave less yielding, and that a smaller specimen was harder than a larger one. This was in agreement with well-known results, and demonstrates that the dislocation dynamics model could describe important features of the physical problem. The cut-off velocity, that was the maximum velocity of the dislocations, was an important model parameter. It was shown here that a four times higher cut-off velocity than was previously deemed sufficient was needed to obtain results independent of the cut-off velocity for the bending moment load simulations.

Discrete Dislocation Dynamics by an O(N) Algorithm. A.Jonsson: Computational Materials Science, 2003, 27[3], 271-88