Abstract
SUMMARY: We investigate two algorithms for solving large‐scale granular problems using DD methods. These numerical schemes can be connected to classical DDs, with and without overlapping, developed in continuum mechanics. The two algorithms are compared in terms of implementation and parallel performance. We focus the numerical study on communication procedures between processors, load balancing, and scalability, topics particularly crucial in nonlinear evolutive problems. Copyright © 2013 John Wiley & Sons, Ltd.

This publication has 26 references indexed in Scilit: