Parallelization of continuous and discontinuous Galerkin dual-primal Isogeometric tearing and interconnecting methods

TL;DR

This paper explores the parallelization of IETI-DP methods for large-scale isogeometric analysis, demonstrating efficient distributed computing performance for solving elliptic boundary value problems.

Contribution

It extends finite element tearing and interconnecting methods to isogeometric analysis and discusses their efficient parallel implementation in distributed memory systems.

Findings

Excellent parallel efficiency in weak and strong scaling studies

Effective parallelization of IETI-DP methods for large-scale problems

Applicability to 2D and 3D elliptic boundary value problems

Abstract

In this paper we investigate the parallelization of dual-primal isogeometric tearing and interconnecting (IETI-DP) type methods for solving large-scale continuous and discontinuous Galerkin systems of equations arising from Isogeometric analysis of elliptic boundary value problems. These methods are extensions of the finite element tearing and interconnecting methods to isogeometric analysis. The algorithms are implemented by means of energy minimizing primal subspaces. We discuss how these methods can efficiently be parallelized in a distributed memory setting. Weak and strong scaling studies presented for two and three dimensional problems show an excellent parallel efficiency.