1. Overlapping Multi-Patch Structures in Isogeometric Analysis
- Author
-
Bert Jüttler, Stefan K. Kleiss, Somayeh Kargaran, Angelos Mantzaflaris, Thomas Takacs, Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences (OeAW), Institute of Applied Geometry [Linz], Johannes Kepler Universität Linz (JKU), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), AlgebRe, geOmetrie, Modelisation et AlgoriTHmes (AROMATH), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-National and Kapodistrian University of Athens (NKUA)
- Subjects
Computer science ,Computational Mechanics ,General Physics and Astronomy ,Parameterized complexity ,CAD ,010103 numerical & computational mathematics ,Isogeometric analysis ,Schwarz method ,01 natural sciences ,overlaps ,multi-patch ,0101 mathematics ,coupling ,[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC] ,Computer simulation ,Mechanical Engineering ,Linear elasticity ,Domain decomposition methods ,Computer Science::Numerical Analysis ,[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation ,Computer Science Applications ,010101 applied mathematics ,Spline (mathematics) ,isogeometric analysis ,Mechanics of Materials ,Trimming ,Algorithm ,[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA] - Abstract
International audience; In isogeometric analysis (IGA) the domain of interest is usually represented by B-spline or NURBS patches, as they are present in standard CAD models. Complex domains can often be represented as a union of simple overlapping subdomains, parameterized by (tensor-product) spline patches. Numerical simulation on such overlapping multi-patch domains is a serious challenge in IGA. To obtain non-overlapping subdomains one would usually reparameterize the domain or trim some of the patches. Alternatively, one may use methods that can handle overlapping subdomains. In this paper, we propose a non-iterative, robust and efficient method defined directly on overlapping multi-patch domains. Consequently, the problem is divided into several sub-problems, which are coupled in an appropriate way. The resulting system can be solved directly in a single step. We compare the proposed method with iterative Schwarz domain decomposition approaches and observe that our method reduces the computational cost significantly, especially when handling subdomains with small overlaps. Summing up, our method significantly simplifies the domain parameterization problem, since we can represent any domain of interest as a union of overlapping patches without the need to introduce trimming curves/surfaces. The performance of the proposed method is demonstrated by several numerical experiments for the Poisson problem and linear elasticity in two and three dimensions.
- Published
- 2019
- Full Text
- View/download PDF