An Isogeometric Tearing and Interconnecting method for conforming discretizations of the biharmonic problem
By: Stefan Takacs
Potential Business Impact:
Solves hard math problems for better computer designs.
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.
Similar Papers
Dual-primal Isogeometric Tearing and Interconnecting Solvers for adaptively refined multi-patch configurations
Numerical Analysis
Makes computer simulations more accurate and faster.
An Isogeometric Tearing and Interconnecting (IETI) method for solving high order partial differential equations over planar multi-patch geometries
Numerical Analysis
Solves hard math problems on complex shapes.
An Immersed $C^0$ Interior Penalty Method for Biharmonic Interface Problems
Numerical Analysis
Solves tricky math problems with curved shapes.