An Isogeometric Tearing and Interconnecting method for conforming discretizations of the biharmonic problem
Stefan Takacs
TL;DR
This paper addresses efficient solvers for the biharmonic problem $\Delta^2 u=f$ on a domain $\Omega$ decomposed into multiple IgA patches, enforcing $C^1$ continuity to achieve $H^2$-conformity. It develops a Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) domain decomposition method with a patch-wise scaled Dirichlet preconditioner, integrated with an explicit construction of discrete biharmonic extensions to enable stable cross-patch communication. A rigorous condition-number estimate is established: $\kappa(MF) \le C p^3 \big(1+\log p + \max_k \log\tfrac{H_k}{h_k}\big)^2$, and this polylogarithmic behavior is corroborated by numerical tests on complex multi-patch geometries, including a quarter annulus and a D-shaped lamella with a hole. The results demonstrate that the proposed method is robust with respect to mesh refinement and spline degree, highlighting its practical viability for high-order IgA discretizations of fourth-order problems. Future work includes extending the analysis to analysis-suitable $G^1$ discretizations and more general geometries.
Abstract
We propose and analyze a domain decomposition solver for the biharmonic problem. The problem is discretized in a conforming way using multi-patch Isogeometric Analysis. As first step, we discuss the setup of a sufficiently smooth discretization space. We focus on two dimensional computational domains that are parameterized with sufficiently smooth geometry functions. As solution technique, we use a variant of the Dual-Primal Finite Element Tearing and Interconnecting method that is also known as Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) method in the context of Isogeometric Analysis. We present a condition number estimate and illustrate the behavior of the proposed method with numerical results.
