A domain decomposition method for Isogeometric multi-patch problems with inexact local solvers

Abstract

In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit the tensor product structure at the patch level. To this purpose, we extend to the isogeometric framework the so-called All-Floating variant of FETI, that allows us to use the Fast Diagonalization method at the patch level. We construct then a preconditioner for the whole system and prove its robustness with respect to the local mesh-size $h$ and patch-size $H$ (i.e., we have scalability). Our numerical tests confirm the theory and also show a favourable dependence of the computational cost of the method from the spline degree $p$.

arXiv comment19 pages, 1 figure

References in corpus (8)

• Preconditioning immersed isogeometric finite element methods with application to flow problems
• Matrix-free weighted quadrature for a computationally efficient isogeometric $k$-method
• Dual-Primal Isogeometric Tearing and Interconnecting solvers for multipatch dG-IgA equations
• Approximation error estimates and inverse inequalities for B-splines of maximum smoothness
• Robust approximation error estimates and multigrid solvers for isogeometric multi-patch discretizations
• Overlapping non Matching Meshes Domain Decomposition Method in Isogeometric Analysis
• Robust isogeometric preconditioners for the Stokes system based on the Fast Diagonalization method
• Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods

Cited by in corpus (2)

• A fully non-invasive hybrid IGA/FEM scheme for the analysis of localized non-linear phenomena
• Tree-Cotree-Based Tearing and Interconnecting for 3D Magnetostatics: A Dual-Primal Approach