Scalable computational kernels for mortar finite element methods
Matthias Mayr, Alexander Popp

TL;DR
This paper develops scalable computational kernels for mortar finite element methods, improving parallel efficiency and load balancing in large-scale contact mechanics simulations on high-performance computing architectures.
Contribution
It introduces novel strategies to enhance parallel scalability and dynamic load balancing for mortar FEM, addressing bottlenecks in data layout and communication.
Findings
Achieves strong and weak scalability up to 480 processes
Demonstrates improved parallel communication efficiency
Introduces dynamic load balancing for evolving contact zones
Abstract
Targeting simulations on parallel hardware architectures, this paper presents computational kernels for efficient computations in mortar finite element methods. Mortar methods enable a variationally consistent imposition of coupling conditions at high accuracy, but come with considerable numerical effort and cost for the evaluation of the mortar integrals to compute the coupling operators. In this paper, we identify bottlenecks in parallel data layout and domain decomposition that hinder an efficient evaluation of the mortar integrals. We then propose a set of computational strategies to restore optimal parallel communication and scalability for the core kernels devoted to the evaluation of mortar terms. We exemplarily study the proposed algorithmic components in the context of three-dimensional large-deformation contact mechanics, both for cases with fixed and dynamically varying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdhesion, Friction, and Surface Interactions · Contact Mechanics and Variational Inequalities · Mechanical stress and fatigue analysis
