High performance computing of discrete nonsmooth contact dynamics with domain decomposition

10Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2013 John Wiley & Sons, Ltd.

Cite

CITATION STYLE

APA

Visseq, V., Alart, P., & Dureisseix, D. (2013). High performance computing of discrete nonsmooth contact dynamics with domain decomposition. International Journal for Numerical Methods in Engineering, 96(9), 584–598. https://doi.org/10.1002/nme.4578

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free