A Note on Massively Parallel Implementation of FETI for the Solution of Contact Problems

Abstract

The paper deals with the solution of large multibody contact problems using massively parallel computers and domain decomposition methods. These methods can solve the problems discretized by billions of nodal variables at the cost nearly proportional to the number of variables using up to thousands cores before the communication costs start to dominate the computational costs. The paper describes the ingredients essential for efficient massively parallel implementation that increases the parallel scalability beyond the limit mentioned above. The improvements were enhanced into a new software package PERMON which is based on PETSc. The performance of the algorithm is demonstrated on the solution of an academic benchmark discretized by nearlybillion of nodal variables.

Keywords

• coarse problem
• contact problems
• mprgp
• permon
• quadratic programming
• smalbe
• tfeti.