Discontinuous Galerkin Isogeometric Analysis for segmentations generating overlapping regions
Christoph Hofer, Ioannis Toulopoulos

TL;DR
This paper introduces a Discontinuous Galerkin Isogeometric Analysis method tailored for multipatch domains with small overlaps, providing theoretical error bounds and numerical validation for improved computational domain handling.
Contribution
The work develops a novel DG-IGA approach that effectively manages overlapping regions in multipatch geometries, with rigorous error analysis and practical verification.
Findings
The method accurately handles small overlaps in multipatch domains.
Theoretical error bounds are established and confirmed numerically.
Numerical examples demonstrate the method's effectiveness.
Abstract
In the Isogeometric Analysis (IGA) framework, the computational domain has very often a multipatch representation. The multipatch domain can be obtained by a volume segmentation of a boundary represented domain, e.g., provided by a Computer Aided Design (CAD) model. Typically, small gap and overlapping regions can appear at the patch interfaces of such multipatch representations. In the current work we consider multipatch representations having only small overlapping regions between the patches. We develop a Discontinuous Galerkin (DG)- IGA method which can be immediately applied to these representations. Our method appropriately connects the fluxes of the one face of the overlapping region with the flux of the opposite face. We provide a theoretical justification of our approach by splitting the whole error into two components: the first is related to the incorrect representation of…
| B-spline degree | ||||
| Smooth solutions, | ||||
| 0.5 | 1.5 | 2 | 2.5 | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
11institutetext: Johannes Kepler University (JKU),
Altenbergerstr. 69, A-4040 Linz, Austria,
Johann Radon Institute for Computational and Applied Mathematics (RICAM),
Austrian Academy of Sciences
Altenbergerstr. 69, A-4040 Linz, Austria,
Discontinuous Galerkin Isogeometric Analysis for
segmentations generating overlapping regions.
Christoph Hofer1
Ioannis Toulopoulos2
Abstract
In the Isogeometric Analysis (IGA) framework, the computational domain has very often a multipatch representation. The multipatch domain can be obtained by a volume segmentation of a boundary represented domain, e.g., provided by a Computer Aided Design (CAD) model. Typically, small gap and overlapping regions can appear at the patch interfaces of such multipatch representations. In the current work we consider multipatch representations having only small overlapping regions between the patches. We develop a Discontinuous Galerkin (DG)- IGA method which can be immediately applied to these representations. Our method appropriately connects the fluxes of the one face of the overlapping region with the flux of the opposite face. We provide a theoretical justification of our approach by splitting the whole error into two components: the first is related to the incorrect representation of the patches (consistency error) and the second to the approximation properties of the IGA space. We show bounds for both components of the error. We verify the theoretical error estimates in a series of numerical examples.
Keywords:
Elliptic diffusion problems, Heterogeneous diffusion coefficients, Isogeometric Analysis, Non-matching parametrized interfaces, Overlapping patches, Discontinuous Galerkin methods, Consistency error.
1 Introduction
Isogeometric Analysis (IGA) has been introduced in [18] as a new methodology for solving numerically Partial Differential Equations (PDE). The key idea of the IGA concept is to use the superior finite dimensional spaces, which are used in Computer Aided Design (CAD), e.g., B-splines, NURBS, for both the exact representation of the computational domain and discretizing the PDE problem. Since this work, many applications of the IGA methodology to several fields have been discussed in several papers, see, e.g., the monograph [6] and the references within, as well as the survey paper [7]. From a computational point of view, we can say that the numerical algorithm for constructing the B-spline (or NURBS) basis functions is quite simple. This helps to produce high order approximate solutions. From the theoretical point of view, the fundamental approximation properties of the B- spline spaces on a reference domain are discussed in [30]. The approximation properties of the mapped B-spline (or NURBS) spaces are discussed in several papers, see e.g., [2], [32], [7], [22].
Let us consider a complex domain where its boundary is prescribed by CAD models. The CAD models can not be directly used in IGA in order to discretise the PDE problems. We need to create volumetric patch parametrizations from the CAD models. The boundary represented domain is first segmented into a collection of suitable blocks and consequently a parametrization procedure is applied to each block. This produces the volumetric multipatch representation of suitable for IGA. Several segmentation algorithms and associated parametrization procedures have been discussed in the literature, see, e.g., [17], [27],[19], [34, 35]. Furthermore, we refer to [33], [10] and [5] for different approaches for constructing IGA planar parametrizations without utilizing segmentation algorithms. We mention the segmentation approach presented in [24], and [25], from which, we have been motivated to present the current work. The main idea is to split the given boundary represented domain, using a spline curve (or face in 3d case) with the following properties: (i) must have the end points on the boundary and the tangents to be specified, (ii) the curve is reasonably regular and does not intersect the boundary of the domain, (iii) the curve cuts the domain into new subdomains with good shapes. Consequently, tensor-product B-spline spaces are fitted in the collection of the subdomains for defining the tensor product B-spline surfaces or volumes [10]. Note that the previous consideration is also concerns CAD models that are connected along a non-matching interface. It is important to obtain a curve that splits into new simple domains with good shapes being suitable for IGA. During the computation of the multipatch representation, errors can occur when defining the corresponding control points, see [27], [24] and [10]. A consequence of this is a non-conforming parametrizations of the patches in the sense that the images of the patch interfaces under the parametrizations are not identical. This in turn leads to the existence of gap and/or overlapping regions between the adjoining patches, see a schematic illustration in Fig. 1(b).
This paper considers the case where there are only overlapping regions between the patches. If we apply an IGA methodology to this multipatch representation, a direct consequence is that the whole discretization error will include two (main) parts: the first naturally comes from the approximation properties of the B-spline spaces (for the purposes of this work we use B-spline spaces) and, the second comes from the geometric error. The later is due to the incorrect parametrization of the patch interfaces. Furthermore, the geometric error can be characterized as a consistency error, which consists of two error components. The first error component is related to the approximation of the jumps of the flux of the solution on the non-matching interfaces. The second component is related to the existence of more than one numerical solution in the overlapping regions.
The contribution of this paper is to develop a DG-IGA method which can be applied on volumetric patch representations with non-matching interface parametrizations. We present our methodology for discretizing the following elliptic Dirichlet boundary value problem
[TABLE]
where the diffusion coefficient can be discontinuous across a smooth internal interface. We derive bounds for the two main parts of the whole error. In our analysis, we derive separate bounds for the two components of the geometric error. To the best of our knowledge, we believe this is an new area of analysis to be investigated. Our current work is the first step in the analysis, where we are developing our methodology for the numerical solution of the simple stationary diffusion problem (1.1). Our intention for future works is to extend the current methodology to more complicated time dependent problems, where the interface can move with time, cf. [4].
Due to the non-matching interior patch interfaces, a direct application of the classical DG numerical fluxes proposed in literature, see e.g. [22], [26], is not possible, as these fluxes are only applicable for matching interface parametrizations. In our recent papers, [14] and [16], we developed DG-IGA schemes for multipatch unions that include only gap regions. In particular, we considered the PDE model given in (1.1) and we denoted by the maximum distance between the diametrically opposite points located on the gap boundary. We applied Taylor expansions using the diametrically opposite points of the gap, in order to give estimates for the jumps of the normal fluxes with respect to . Finally, we used the same Taylor expansions in the DG-IGA scheme for constructing suitable DG numerical fluxes across the gap boundary that help on the weakly coupling of the local patch-wise discrete problems. We developed a discretization error analysis and showed a priori estimates in the DG-norm, expressed in terms of the mesh size and the gap width, i.e., , where depends on the B-spline degree and the regularity of the solution. In [14] and [16], we have shown that, if , the proposed DG-IGA scheme has optimal approximation properties.
In this paper, we extend the previous work to multipatch unions with overlapping regions. In the analysis presented in [14] and [16], the whole geometric error does not include the component coming from the co-existence of different IGA solutions in the overlapping regions. Here, the new approach is to introduce local (patch-wise) auxiliary variational problems, which are compatible with the overlapping nature of the multipatch representation of . We denote the solutions of the new variational problems by . These problems are not consistent, in the sense that the original solution of (1.1) does not satisfy them. Following the IGA concept, the B-spline spaces used for the parametrization of the patches are also used for discretizing the local auxiliary problems. We denote by the produced IGA solutions. Under some regularity assumptions on , we can expect (see Section 3) that the IGA solution has optimal approximation properties associated with . However, we can not directly infer that can approximate in an optimal way the solution of the original problem. In our analysis, we provide an estimate for the consistency error and consequently using the triangle inequality , we can derive an estimate for the error between the exact solution and the IGA solution . The mesh-dependent norm is defined in Section 2. We give error estimates for both terms and expressed in terms of the mesh size and the quantity , which is introduced in our analysis in order to quantify the width of the overlapping regions. In particular, we show that under appropriate assumptions on the data and for the case where is of order , the proposed DG-IGA scheme has optimal convergence properties. This convergence result is similar to the result in [14] and [16].
In a future work, we apply the same approach to solve problems on multipatch partitions, which can include gap and overlapping regions. We present numerical solutions in multipatch unions with more complicated gaps and overlapping regions. We also provide details related to the implementation of the proposed DG-IGA scheme. In the same work, we also discuss issues related to the construction of domain decomposition methods on these multipatch representations and provide several numerical tests for evaluating their performance. The first results in this direction can be found in [15].
We note that IGA multipatch representations with non-matching interfaces meshes, overlapping regions and trimmed patches have been considered in many publications. For the communication of the discrete patch-wise problems, several Nitsche’s type coupling methods involving normal flux terms have been applied across the interfaces, see e.g., [29],[26],[1],[3] and references therein. We mention also that in [36], DG-IGA methods have been presented to discretize Laplace problems on multipatch unions with large overlapping regions. The proposed strategy follows the additive Schwartz methodology. To the knowledge of the authors, there are no works that analytically discuss estimates for the error, which is caused by the incorrect representation of the shape of the patches. The purpose of this work is to present such an error analysis.
The structure of the paper is as follows: Section 2 presents the PDE model, briefly reviews the B-spline spaces and describes the case of having non-matching parametrized interfaces with overlapping regions. Section 3, presents in detail the perturbation problems, the bounds for the consistency error, the proposed DG-IGA scheme and the error analysis. Section 4, includes several numerical examples that confirm the theoretical estimates. The paper closes with the Conclusions.
2 The model problem
2.1 Preliminaries
Let be a bounded Lipschitz domain in , and let be a multi-index of non-negative integers with degree . For any , we define the differential operator , with , , and . For a non-negative integer , let denote the space of all functions , whose partial derivatives of all orders are continuous in . Let be a non-negative integer. As usual, denotes the Sobolev space for which , endowed with the norm \displaystyle\textstyle{\|\phi\|_{L^{2}(\Omega)}=\big{(}\int_{\Omega}|\phi(x)|^{2}\,dx\big{)}^{\frac{1}{2}}}, and denotes the functions that are essentially bounded. Also
[TABLE]
denote the standard Sobolev spaces endowed with the following norms
[TABLE]
We identify and and also define the subspace and of
[TABLE]
We recall Hölder’s and Young’s inequalities
[TABLE]
that hold for all and and for any fixed . In addition, we recall trace and Poincare’s inequalities, [9],
[TABLE]
2.2 The elliptic diffusion problem
The weak formulation of the boundary value problem (1.1) reads as follows: for given source function find a function such that the variational identity
[TABLE]
is satisfied, where the bilinear form and the linear form are defined by
[TABLE]
respectively.
The given diffusion coefficient is assumed to be uniformly positive and piece-wise (patch-wise, see below) constant. These assumptions ensure existence and uniqueness of the solution due to Lax-Milgram’s lemma.
For simplicity, we only consider pure Dirichlet boundary conditions on . However, the analysis presented in our paper can easily be generalized to other constellations of boundary conditions which ensure existence and uniqueness such as Robin or mixed boundary conditions.
In what follows, positive constants and appearing in inequalities are generic constants which do not depend on the mesh-size . In many cases, we will indicate on what may the constants depend on. Frequently, we will write meaning that .
2.3 B-spline spaces
In this section, we briefly present the B-spline spaces and the form of the B-spline parametrizations for the physical subdomains. For a better presentation of the B-spline spaces, we start our discussion for the one-dimensional case. Then we proceed to higher dimensions. We refer to [6], [8] and [30] for a more detailed presentation.
Consider, to be a partition of with to be the intervals of the partition. Let the integers and denote the spline degree and the number of the B-spline basis functions.
Based on , we introduce the open knot vector , and the associated vector of knot multiplicities with , i.e.,
[TABLE]
The B-spline basis functions are defined by the Cox-de Boor formula, see, e.g., [6] and [8],
[TABLE]
We assume that for all internal knots, which in turn gives that, at the B-spline basis functions have continuous derivatives.
Let us now consider the unit cube , which we will refer to as the parametric domain. Let the integers and denote the given B-spline degree and the number of basis functions of the B-spline space that will be constructed in -direction with . We introduce the dimensional vector of knots with the particular components given by , , .
Given the knot vector in every direction , we construct the associated univariate B-spline basis functions, , see, e.g., [8] for more details. Accordingly, the B-spline basis functions of are defined by the tensor-product of the univariate B-spline basis functions, that is
[TABLE]
where each has the form
[TABLE]
In the IGA framework, the computational domain is described as the image of under a B-spline, NURBS, etc., parametrization mapping of the form
[TABLE]
where are the control points and , see Fig. 1(a). Following the IGA methodology, [18], [6], the B-spline spaces for discretizing the PDE problem are defined by using the mapping given in (2.9), i. e., we define the B-spline space in by
[TABLE]
2.3.1 Multipatch representations and B-spline spaces
Our contribution here aims at developing a DG-IGA method appropriate for discretizing PDE models on non-conforming multipatch partitions of the domain . Let us suppose that the domain is described as a union of N-subdomains
[TABLE]
with interior interfaces , for . We further suppose that every subdomain has its own parametrization , which is defined by the corresponding B-spline space and the corresponding control points , see (2.9). Here denotes the knot-vector related to . An illustration for is given in Fig. 1(a). The subdomains are referred to as patches. In an analogous way as in (2.10), we define the physical patch-wise B-spline spaces for . We define the global discontinuous B-spline space with components on every
[TABLE]
Assumption 1
Assume that every is sufficiently smooth and there exist constants such that , where is the Jacobian matrix of .
The components of form a mesh in , where are the micro-elements and is the mesh size, which is defined as follows. Given an element , we set and the mesh size is defined to be . We set . For every , we construct a mesh , whose vertices are the images of the vertices of the corresponding parametric mesh under .
Assumption 2
The meshes are quasi-uniform, i.e., there exist a constant such that . Also, we assume that for .
2.4 Multipatch description of the computational domain
In many practical applications, the parametrization of a boundary represented domain by a single B-spline (NURBS) patch may not be posible. In order to discretize a PDE problem following the IGA framework in this situation, we represent the domain as a multipatch. Following the methodology presented in [24, 19], the initial domain is firstly segmented into a collection of simple subdomains, e.g., topological hexahedra. Consequently, a suitable parametrization mapping is constructed for each subdomain for obtaining the multipatch representation of . The final parametrization mappings of the adjoining patches must provide identical images for the common interfaces. In particular, for a DG-IGA discretization of the model (1.1), it would be preferable to produce a multipatch partition of compatible with the variations of the coefficient , i.e., the patches to be coincided with the parts of where the coefficient is constant.
For example, let us consider Fig. 1(a). In this case the domain is described as a union of two non overlapping patches, see (2.11), i.e.,
[TABLE]
where the interface coincides with the physical interface. We use the notation for the union (2.13). For each , there exists a matching parametrization mapping such that with . The control points, which are related to the patch interface , are appropriately matched in order for the parametrizations and of the neighboring patches to give the same image for the parametrized interface . Based on , we can independently discretize the problem on the different patches , using interface conditions across for coupling the local problems. Typically, the interface conditions across concern continuity requirements of the solution of (1.1), i.e.,
[TABLE]
where is the unit normal vector on with direction towards , and