Next Article in Journal
Initial Coefficients Upper Bounds for Certain Subclasses of Bi-Prestarlike Functions
Previous Article in Journal
Fractional Dynamical Systems Solved by a Collocation Method Based on Refinable Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem †

Department of Mathematics, Dongguk University, Pil-dong 3-ga, Jung-gu, Seoul 04620, Republic of Korea
This work was supported by the Dongguk University Research Fund of 2021 and by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, South Korea (2018R1D1A1B07048773).
Axioms 2023, 12(5), 452; https://doi.org/10.3390/axioms12050452
Submission received: 8 March 2023 / Revised: 21 April 2023 / Accepted: 28 April 2023 / Published: 4 May 2023

Abstract

:
We construct an overlapping additive Schwarz preconditioner for the biharmonic Dirichlet problems discretized by isogeometric analysis based on generalized B-splines (GB-splines) and analyze its optimal convergence rate bound that is cubic in the ratio between subdomains and overlap sizes. Our analysis is validated through a set of numerical experiments that illustrate good behavior of the proposed preconditioner with respect to the model parameters.

1. Introduction

Isogeometric analysis (IGA) is a novel numerical approach for solving partial differential equations (PDEs), introduced by Hughes et al. in [1], which forms a link between Computer-Aided Design (CAD) and Finite Element Analysis (FEA) technologies (see also the book [2] and the references therein). CAD systems widely employ Non-Uniform Rational B-Splines (NURBS) to define complex geometries [3]. In the IGA approach which follows an isoparametric paradigm, the NURBS basis functions that represent the CAD geometry are directly utilized in solving PDEs.
While NURBS are capable of exactly representing a wider class of geometries such as conic sections, transcendental curves such as cycloid or helices are excluded. In addition, the rational NURBS model has limits in exact differentiation and integration. To avoid these disadvantages, GB-splines describing both conic sections and transcendental geometries were introduced as a tool in the IGA framework and have further investigated in diverse fields (see, e.g., [4,5,6,7,8,9,10]).
In the present paper, our model problem is the following biharmonic Dirichlet problem, e.g., arising in the context of thin plate theories of elasticity and the Stokes problem in stream function and vorticity formulation [11,12]:
Δ 2 u = f in Ω , u = u n = 0 on Ω ,
where Ω is a bounded and connected CAD domain in R d , n is the unit outward normal on the boundary Ω (see [13] (Ch. 5.9) for a detailed description). For fourth-order problems, the conforming finite element space necessitates a finite-dimensional subspace of the Sobolev space H 2 ( Ω ) , implying that its basis functions belong to C 1 ( Ω ¯ ) . Due to the complexity of C 1 -continuous piecewise polynomial elements, H 2 -conforming elements are less used in practice for solving biharmonic equations. The nonconforming method circumvents the complicated construction of C 1 elements but its convergence depends on the elaborate design of the finite element space (see, for example, [13,14]). In the IGA setting, spline basis functions of degree p with high smoothness up to C p 1 are useful when dealing with higher-order PDEs, e.g., the biharmonic equation that we consider. Additionally, thanks to [15], the biharmonic problem can be approximated using a mixed finite element method, which is beyond the scope of this paper. In this paper, particular attention is paid to the biharmonic primal formulation.
The linear systems arising from the biharmonic Dirichlet problem discretized with IGA GB-splines are highly ill-conditioned as the mesh size h decreases and polynomial degree p increases. Thus, the development of effective preconditioners for IGA GB-splines is a challenging issue (see [16], particularly for the scalar elliptic case). To our knowledge, overlapping additive Schwarz (OAS) preconditioners for IGA approximations of PDEs by GB-splines were first presented in [16]. The novelty of this paper is that in IGA methodology using GB-splines as the basis for analysis, overlapping Schwarz preconditioners can be extended to the discretization of the biharmonic equation. Theoretical analysis for our two-level overlapping preconditioner shows that the resulting preconditioned biharmonic operator satisfies a condition number bound that is scalable for an increasing number of subdomains N and is bounded by a 1 + H 3 γ 3 -term, where H and γ , both of which will be defined later, are the characteristic subdomain size and an overlap parameter related to the size of the overlapping region between adjacent subdomains, respectively.
Previous works on overlapping domain decomposition methods (DDM) for IGA have concentrated on NURBS-based IGA discretizations such as overlapping additive Schwarz preconditioners (see, for instance, [17] for Galerkin IGA approximation of scalar elliptic problems, [18] for Galerkin IGA discretizations of linear elasticity systems, [19] for collocation IGA approximation of scalar elliptic equations and [20] for collocation IGA discretization of linear elasticity). Further works on NURBS-based IGA preconditioners are extended to BDDC [21,22,23,24], FETI-DP [25,26], BPX [27,28], IGA multigrid [29,30,31]. Fast solvers for NURBS-based IGA have also been studied in [32,33,34]. For the biharmonic problems, several NURBS-based IGA techniques are presented in [35,36] and NURBS-based IGA overlapping Schwarz preconditioners are analyzed in [37] (see also the references therein for DDM for finite element discretizations of biharmonic problems).
The present paper is organized as follows. In Section 2, we give a brief review of GB-splines and their fundamental properties. Section 3 introduces the proposed overlapping domain decomposition preconditioners. Several numerical results in two- and three-spatial dimensions are reported in Section 5. Finally Section 6 contains some conclusions and future directions of research.
We will adopt the following concise notation throughout the paper. Given two numbers a , b , we write a b when a C b for a generic constant C, which is independent of the knot vector Σ and the mesh size h but depending on the spline degree p and the geometric map F (defined below), and we also write a b when a b and b a .

2. GB-Splines: Definition and Basic Properties

2.1. Generalized Polynomial Spaces

In this section, we outline the definition of GB-splines and their fundamental properties, following [38] (Section 4). Throughout the paper, GB-splines are basis functions in IGA discretizations (see [7] for a detailed description).
Definition 1. 
Let 2 p N and Δ be a partition over the interval [ 0 , 1 ] ,
Δ : = { 0 = η 0 < η 1 < < η + 1 = 1 } , N .
A generalized polynomial space of degree p is defined as a space of the form
GP p U , V ( Δ ) : = 1 , ζ , , ζ p 2 , U ( ζ ) , V ( ζ ) , ζ [ η 0 , η + 1 ]
where U , V C p [ η i , η i + 1 ] and D p 1 U , D p 1 V is an extended Tchebycheff space on [ η i , η i + 1 ] for all i = 0 , , .
In various kinds of spaces GP p U , V ( Δ ) (see [38] for more details and also [39,40,41] for a complete description of Tchebycheff space), the popular choices for the functions U , V on [ η i , η i + 1 ] are
P p ( [ η i , η i + 1 ] ) : = 1 , ζ , , ζ p 2 , ζ p 1 , ζ p ,
E p , α i ( [ η i , η i + 1 ] ) : = 1 , ζ , , ζ p 2 , exp ( α i ζ ) , exp ( α i ζ ) , α i R > 0 ,
and
T p , α i ( [ η i , η i + 1 ] ) : = 1 , ζ , , ζ p 2 , cos ( α i ζ ) , sin ( α i ζ ) , 0 < α i ( η i + 1 η i ) < π .

2.2. Univariate GB-Splines

In order to follow the IGA paradigm, we consider n , p I N with p 2 and Σ = { ξ 1 ξ 2 ξ n + p ξ n + p + 1 } be a knot vector in the one-dimensional closed interval [ 0 , 1 ] that is connected to the partition Δ defined in (2) as follows:
Σ = { ξ 1 , ξ 2 , , ξ n + p + 1 } = η 0 , , η 0 μ 0 , , η + 1 , , η + 1 μ + 1
for some positive integers μ 0 , , μ + 1 with i = 0 + 1 μ i = n + p + 1 . Moreover, in what follows, Σ is assumed to be a p-open knot vector that interpolates at the ends of the one-dimensional parametric space I ^ : = ( 0 , 1 ) , that is,
0 = ξ 1 = = ξ p + 1 < < ξ n + 1 = = ξ n + p + 1 = 1 .
Now, we are in a position to introduce GB-splines of degree p that are associated with a knot vector Σ and a generalized polynomial space GP p U , V ( Δ ) . Both of these components are connecting to a partition Δ given in (2) (see [6,7,38,42] and references therein).
Definition 2. 
Given a partition Δ, let GP p U , V ( Δ ) be a generalized polynomial space of degree p 2 , and let Σ be a knot vector that is connected to Δ as in (7). For any ξ j < ξ j + 1 , let u j , v j be the unique functions in D p 1 U , D p 1 V on [ ξ j , ξ j + 1 ] satisfying
u j ( ξ j ) = 1 , u j ( ξ j + 1 ) = 0 , v j ( ξ j ) = 0 , v j ( ξ j + 1 ) = 1 .
We set
N ^ i , 1 , Σ U , V ( ζ ) : = v i ( ζ ) , i f ξ i ζ < ξ i + 1 , u i + 1 ( ζ ) , i f ξ i + 1 ζ < ξ i + 2 , 0 , o t h e r w i s e , ,
and the j-th GB-spline N ^ j , p , Σ U , V ( ζ ) of degree p over Σ is defined recursively using the formula
N ^ j , p , Σ U , V ( ζ ) : = ξ j ζ δ j , p 1 , Σ U , V N ^ j , p 1 , Σ U , V ( r ) d r ξ j + 1 ζ δ j + 1 , p 1 , Σ U , V N ^ j + 1 , p 1 , Σ U , V ( r ) d r ,
where
δ i , q , Σ U , V : = ξ i ξ i + q + 1 N ^ i , q , Σ U , V ( r ) d r 1 ,
and if N ^ i , q , Σ U , V ( ζ ) = 0 , then we set the following convention ξ i ζ δ i , q , Σ U , V N ^ i , q , Σ U , V ( r ) d r : = 1 , ζ ξ i + q + 1 , 0 , o t h e r w i s e .
It is noteworthy that the recursive formula is referred to as the integral form of the Cox-de Boor algorithm, which is utilized for constructing polynomial B-splines of degree p (see [43] for a complete description). The GB-spline space is defined as the space spanned by GB-splines, namely,
S ^ h = span { N ^ j , p , Σ U , V ( ζ ) : 1 j n } .
According to the definitions of U and V in (3), GB-splines N ^ j , p , Σ U , V ( ζ ) with section spaces as given in (4)–(6) are commonly known as classical (polynomial) B-splines, exponential GB-splines and trigonometric GB-splines, respectively (see Figure 1 for some examples). The exponential GB-splines and trigonometric ones possess fundamental properties similar to those of the classical polynomial B-splines, see, e.g., [6,7,42] for their proofs.
Property 1. 
The GB-splines { N ^ j , p , Σ U , V ( ζ ) : j = 1 , , n } of degree p 2 over the knot vector Σ are characterized by the following properties:
1. 
Positivity:  N ^ j , p , Σ U , V ( ζ ) > 0 , ζ ( ξ j , ξ j + p + 1 ) .
2. 
Compact support:  if ζ [ ξ j , ξ j + p + 1 ] , N ^ j , p , Σ U , V ( ζ ) = 0 .
3. 
Local partition of unity:  j = m p m N ^ j , p , Σ U , V ( ζ ) = 1 , ζ [ ξ m , ξ m + 1 ) .
4. 
Local linear independence:  { N ^ j , p , Σ U , V ( ζ ) : j = m p , , m } are linearly independent on [ ξ m , ξ m + 1 ] .
5. 
Smoothness:  each N ^ j , p , Σ U , V has a continuous derivative of order p m i at the knot ξ i , where m i is the multiplicity of ξ i in the knot vector { ξ j , , ξ j + p + 1 } .
6. 
Differentiation: The derivative of GB-splines is represented in terms of two consecutive GB-splines of a lower degree as
d d ζ N ^ j , p , Σ U , V ( ζ ) = δ j , p 1 , Σ U , V N ^ j , p 1 , Σ U , V ( ζ ) δ j + 1 , p 1 , Σ U , V N ^ j + 1 , p 1 , Σ U , V ( ζ ) .
Remark 1. 
A knot insertion procedure is available for GB-splines (see, e.g., [42,44,45] for more details) and thus, in an analogous way, the h-refinement obtained by knot insertion in NURBS-based IGA can be extended to IGA GB-splines. In the present paper, our theoretical work is only an h-analysis and does not cover the dependence of convergence rate on p.
It was demonstrated in [38] that GB-splines are regarded as a special instance of normalized Tchebycheff B-splines, ensuring that GB-splines possess all the properties as detailed in [46], Section 9. Of these, the most significant property for our h-analysis can be stated as follows:
Theorem 1. 
GB-splines are normalized Tchebycheffian B-splines.
Proof. 
The proof can be obtained in a similar way to ([38], Theorem 11). □
For the sake of completeness, we state some important lemmas from [46], without providing their proofs, which will play a fundamental role in demonstrating the approximation and stability of our proposed preconditioners (see Lemmas 1 and 2 below). We will make use of the dual functionals λ i , p , Σ U , V (defined in ([46], Theorem 9.26)) that satisfy
λ i , p , Σ U , V ( N ^ j , p , Σ U , V ) = δ i j , 1 i , j n ,
where δ i j is the Kronecker delta. Furthermore, a projector on S ^ h is introduced in [46], Theorem 9.37, denoting with
Π ^ S ^ h v : = j = 1 n ( λ j , p , Σ U , V v ) N ^ j , p , Σ U , V , v L 2 ( 0 , 1 ) .
Now, we state a useful estimate of the functional λ i , p , Σ U , V ,along with the stability and approximation properties of the quasi-interpolant Π ^ S ^ h (see ([46], Theorems 9.26 and 9.37) for their complete proofs).
Lemma 1. 
If f L q ( ξ i , ξ i + p + 1 ) , with 1 q + , then
| λ i , p , Σ U , V ( f ) | | ξ i + p + 1 ξ i | 1 / q f L q ( ξ i , ξ i + p + 1 ) .
Lemma 2. 
If the mesh on the parametric space I ^ satisfies the quasi-uniformity condition (defined later), then we have
v ^ Π ^ S ^ h v ^ L 2 ( I ^ ) + h | v ^ Π ^ S ^ h v ^ | H 1 ( I ^ ) + h 2 | Π ^ S ^ h v ^ | H 2 ( I ^ ) h 2 | v ^ | H 2 ( I ^ ) , v ^ S ^ h ,
where h denotes the global mesh size of the mesh on the parametric space I ^ .

2.3. Multivariate GB-Splines

Multidimensional GB-splines can be easily constructed using tensor products. For the sake of simplicity, we restrict our discussion to the bivariate case, noting that the construction in higher dimensions follows similarly.
Let Ω ^ : = ( 0 , 1 ) × ( 0 , 1 ) be the two-dimensional parametric space. With d = 1 , 2 , assuming n d , d N and the degree p d 2 , we consider the partitions Δ d = { 0 = η d , 0 < < η d , d + 1 = 1 } and their corresponding p d -open knot vector Σ d = { 0 = ξ d , 1 , , ξ d , n d + p d + 1 = 1 } . Additionally, section spaces GP p d U d , V d can be appropriately selected according to PDEs problem of interest. We first introduce the set of multi-indices as follows:
  • p = ( p 1 , p 2 ) ;
  • ζ = ( ζ 1 , ζ 2 ) ;
  • Σ = { Σ 1 , Σ 2 } ;
  • U = { U 1 , U 2 } and V = { V 1 , V 2 } ;
  • J = { j = ( j 1 , j 2 ) : 1 j d n d , d = 1 , 2 } .
Then, we introduce the set of bivariate GB-splines
{ N ^ j , p , Σ U , V ( ζ ) : = N ^ j 1 , p 1 , Σ 1 U 1 , V 1 ( ζ 1 ) N ^ j 2 , p 2 , Σ 2 U 2 , V 2 ( ζ 2 ) , j J } .
The GB-spline space on Ω ^ is defined as the space spanned by bivariate GB-splines
S ^ h : = span { N ^ j , p , Σ U , V ( ζ ) , j J } .
In the context of IGA, the physical domain Ω can be described by means of a global geometric map F : Ω ^ Ω , which is given by
F ( x ^ ) = j J N ^ j , p , Σ U , V ( ζ ) C j , C j R d , x ^ Ω ^
where C j are the generalized control points. In accordance with the isoparametric concept, we define the space V ^ h in the parameter domain Ω ^ as follows:
V ^ h : = span { N ^ j , p , Σ U , V ( ζ ) , j = ( j 1 , j 2 ) J with 3 j d n d 2 , d = 1 , 2 } ,
and the space V h in the physical domain Ω
V h : = span { N j , p , Σ U , V ( ζ ) : = N ^ j , p , Σ U , V ( ζ ) F 1 , j = ( j 1 , j 2 ) J with 3 j d n d 2 , d = 1 , 2 } .
where the homogeneous Dirichlet boundary condition that we consider leads to the elimination of the first and last two functions in each coordinate. For simplicity in the presentation, we consider only the homogeneous Dirichlet boundary conditions throughout this paper. However, it is worth noting that a similar approach can be extended to accommodate different types of boundary conditions (see Section 6 for a explanation about handling various boundary conditions).
Observing that in multi-indices knot vector Σ defined above, two knot vectors Σ 1 = { 0 = ξ 1 , 1 , , ξ 1 , n 1 + p 1 + 1 = 1 } and Σ 2 = { 0 = ξ 2 , 1 , , ξ 2 , n 2 + p 2 + 1 = 1 } result in a mesh of rectangular elements in the parametric space, those mesh elements are mapped via the geometric map F to elements in the physical space. The physical mesh on Ω is therefore
T h = { F ( ( ξ 1 , i , ξ 1 , i + 1 ) × ( ξ 2 , j , ξ 2 , j + 1 ) , with i = 1 , , n 1 + p 1 , j = 1 , , n 2 + p 2 } ,
where the empty elements are excluded.
The discrete formulation of the model problem (1) becomes then:
  • Find u V h such that
    a ( u , v ) = Ω f v d x , v V h
    with bilinear form a ( u , v ) : = Ω Δ u Δ v d x .

3. The Overlapping Schwarz Preconditioners

We now present overlapping additive Schwarz (OAS) preconditioners for the IGA discrete problem (18) by using GB-splines, following [16,17] and the notation therein.

3.1. Subdomains and Subspace Decomposition

The subdomains and subspace decomposition are first built for the IGA GB-splines space in one-dimensional parameter space and then are extended to the physical domain of interest through a geometrical mapping F .
Given a partition Δ to which the knot vector Σ = { ξ 1 = 0 , , ξ n + p + 1 = 1 } is connected (as described in the previous section), we can choose a subset { 0 = ξ i 1 < ξ i 2 < < ξ i N < ξ i N + 1 = 1 } consisting of interface knots in the closure of the parametric space I ^ ¯ = [ 0 , 1 ] . We can obtain a decomposition of I ^ ¯ by selecting a suitable subset of interface knots, that is,
I ^ ¯ = [ 0 , 1 ] = k = 1 , . . , N I ^ k ¯ , where I ^ k = ( ξ i k , ξ i k + 1 ) ,
into N sub-intervals I ^ k whose diameter diam ( I ^ k ) , 1 k N , is assumed to have a similar characteristic diameter H. With each interface knot ξ i k , 2 k N , we are able to associate an index s k { 3 , 4 , , n 2 } , which is strictly increasing with respect to k and satisfies the inequality s k < i k < s k + p + 1 . From this choice of s k and Property 1, it follows that the GB-spline function N ^ s k , p , Σ U , V has support that intersects both I ^ k 1 and I ^ k . Moreover, the construction of the basis function N ^ s k , p , Σ U , V guarantees that there exists at least one such s k , even if it is not unique.
An overlapping decomposition of I ^ can then be formulated as follows. The overlap index, denoted by r N , represents the number of GB basis functions shared by adjacent subdomains that are defined as
V ^ k : = span { N ^ j , p , Σ U , V ( ζ ) , s k r j s k + 1 + r } k = 1 , 2 , . . , N ,
with the exception that 3 j s 2 + r for the space V ^ 1 and s N r j n 2 for the space V ^ N .
These subspaces constitute an overlapping decomposition of the GB-spline space V ^ h on one-dimensional parameter domain I ^ . For example, for the cubic degree case with maximum continuity C 2 , r = 0 represents the minimal overlap where only one common GB basis function is shared between adjacent subspaces, while more general 2 r + 1 indicates the number of GB basis functions in common among neighboring local subspaces. Moreover, it is necessary to introduce the overlap parameter (that will be used in the following analysis)
γ : = h ( 2 r + 2 ) ,
which is connected to the width δ of the overlapping region in OAS approach for classical FEM. Additionally, the definitions of the extended subdomains I ^ k and the further extended subdomains I ^ k are provided as follows:
I ^ k = N ^ j , p , Σ U , V V ^ k supp ( N ^ j , p , Σ U , V ) = ( ξ s k r , ξ s k + 1 + r + p + 1 ) ,
and
I ^ k = supp ( N ^ j , p , Σ U , V ) I ^ k supp ( N ^ j , p , Σ U , V ) ,
respectively, except for I ^ 1 , I ^ N , I ^ 1 and I ^ N .
To define a coarse space, we introduce a subpartition Δ 0 of the partition Δ from Section 2.1 and a p-open coarse knot vector Σ 0 related to the subpartition Δ 0 , both of which satisfy the following:
Δ 0 : = { 0 = η 0 0 < < η 0 + 1 0 = 1 } Δ , and GP p U , V ( Δ 0 ) GP p U , V ( Δ ) ,
and
Σ 0 : = { 0 = ξ 1 0 , , ξ N c + p + 1 0 = 1 } = { ξ 1 , ξ 2 , , ξ p , ξ i 1 , ξ i 2 , ξ i 3 , , ξ i N , ξ i N + 1 , ξ i N + 2 , ξ i N + p + 1 }
corresponds to a coarse mesh determined by the subdomains I ^ k = ( ξ i k , ξ i k + 1 ) .
Remark 2. 
For the following analysis, it is necessary for the coarse knot vector Σ 0 to satisfy Assumption 1, which is defined below. Therefore, we assume that the distance between neighboring distinct knots in Σ 0 is of characteristic order H, that is the characteristic diameter defined above.
We can now proceed to define the coarse spline space as
V ^ 0 : = S ^ H = span { N ^ j , p , Σ 0 U , V ( ζ ) , j = 3 , , N c 2 } ,
which has the same degree p of V ^ h so that it is a subspace of V ^ h . It is noted that the first and last two basis functions are excluded due to the boundary condition under consideration in this paper. Additionally, to obtain a smaller coarse space V ^ 0 , all the internal knots are repeated only once.
In the case of higher dimensions, we can extend the approach by using a tensor product. For instance, in the 2D case, we can define subdomains, overlapping subdomains, and extended supports as follows:
I ^ 1 , k : = ( ξ 1 , i k , ξ 1 , i k + 1 ) , I ^ 2 , l : = ( ξ 2 , j l , ξ 2 , j l + 1 ) , Ω ^ k l : = I ^ 1 , k × I ^ 2 , l Ω ^ k l : = I ^ 1 , k × I ^ 2 , l , Ω ^ k l : = I ^ 1 , k × I ^ 2 , l ,
for 1 k N and 1 l M . Next, we derive the indices { s k } k = 2 N associated to { ξ 1 , i k } k = 2 N and the indices { s ¯ l } l = 2 M associated to { ξ 2 , j l } l = 2 M in a similar manner to the univariate case. Then, to obtain the local and coarse subspaces, we follow the below procedure:
V ^ k l = span { N ^ j , p , Σ U , V ( ζ ) , s k r j 1 s k + 1 + r , s ¯ l r j 2 s ¯ l + 1 + r } , V ^ 0 = span { N ^ j 0 , p , Σ 0 U , V ( ζ ) : = N ^ j 0 , 1 , p 1 , Σ 0 , 1 U 1 , V 1 ( ζ 1 ) N ^ j 0 , 2 , p 2 , Σ 0 , 2 U 2 , V 2 ( ζ 2 ) , j 0 = ( j 0 , 1 , j 0 , 2 ) , 3 j 0 , 1 N c 2 , 3 j 0 , 2 M c 2 } ,
respectively except for boundary subdomains. Here, N ^ j 0 , p , Σ 0 U , V ( ζ ) denote the coarse GB-spline functions that correspond to GP p U , V ( Δ 0 ) and Σ 0 as previously defined. By the push-forward, these subspaces can be transformed to the GB-spline space V h in the physical domain Ω of interest. Therefore, except for the boundary subdomains, the local subspaces and the coarse space are expressed as follows:
V k l = span { N ^ j , p , Σ U , V ( ζ ) F 1 , s k r j 1 s k + 1 + r , s ¯ l r j 2 s ¯ l + 1 + r } , V 0 = span { N ^ j 0 , p , Σ 0 U , V ( ζ ) F 1 , j 0 , 1 = 3 , , N c 2 , j 0 , 2 = 3 , , M c 2 } .
The subdomains in physical space correspond to the images of the subdomains in parameter space:
Ω k l = F ( Ω ^ k l ) , Ω k l = F ( Ω ^ k l ) , Ω k l = F ( Ω ^ k l ) .
In order to estimate the condition number, we require the following two assumptions concerning the mesh and subdivision:
Assumption 1. 
The parametric mesh in each extended subdomain Ω ^ k l has the property of quasi-uniformity, which implies that there exists a positive real number h such that h d i a m Ω ^ k l for all subdomains Ω ^ k l .
Assumption 2. 
The overlap index r remains bounded, independently of both the mesh size and the polynomial degree.
It is worth noting that our analysis relies on the local quasi-uniformity assumption regarding the knot vector, which is a conventional assumption in both mathematical isogeometric literature (see, e.g., [17]) and finite element literature (see, e.g., [47]). Assumption 2 allows us to consider the case of practical significance, namely, when small overlap leads to optimal or close-to-optimal condition numbers, see, e.g., [48].
The discrete GB-spline space V h can be expressed as a sum of coarse and local spaces using the local and coarse embedding operators I k l : V k l V h , k = 1 , . . , N , l = 1 , . . , M and I 0 : V 0 V h . Specifically, the decomposition is given by:
V h = I 0 V 0 + k , l I k l V k l .
Additionally, we define the local projections T ˜ k l : V h V k l and the coarse projection T ˜ 0 : V h V 0 as follows:
a ( T ˜ k l u , v ) = a ( u , I k l v ) v V k l , a ( T ˜ 0 u , v ) = a ( u , I 0 v ) v V 0 ,
and T k l = I k l T ˜ k l and T 0 = I 0 T ˜ 0 . Then, our proposed OAS operator T O A S can be viewed as either the one-level version with only local problems or the two-level version with both coarse and local problems:
T O A S = T O A S ( 1 ) : = k = 1 N l = 1 M T k l , T O A S = T O A S ( 2 ) : = T 0 + k = 1 N l = 1 M T k l .
The matrix form of the OAS operator T O A S can be written as
T O A S = B O A S A
where A is the stiffness matrix associated with the discrete problem (18) and the respective OAS preconditioners B O A S are
B O A S = B O A S ( 1 ) : = k = 1 N l = 1 M R k l T A k l 1 R k l , B O A S = B O A S ( 2 ) : = R 0 T A 0 1 R 0 + k = 1 N l = 1 M R k l T A k l 1 R k l .
Here, local restriction matrices R k l : V h V k l are defined as the transpose of the natural embedding matrices R k l T : V k l V h , A k l are the local stiffness matrices restricted to the subspace V k l , the matrix R 0 T corresponds to the interpolation from the coarse space V 0 to the GB-spline space V h and A 0 is the coarse stiffness matrix associated with the coarse space V 0 .
In the iterative solution of the discrete system A u = f , the preconditioner B O A S can be interpreted as a technique for replacing the original system with a preconditioned system,
T O A S u = g ,
which a Krylov subspace method with g = B O A S f can expedite.

4. A Condition Number Estimate

In the present work, our main contribution is the proof of a condition number bound for the resulting preconditioned system T O A S .
Theorem 2. 
If Assumptions 1 and 2 hold, then the condition number bound of the two-level additive Schwarz preconditioned operator T O A S ( 2 ) , defined in (23) for the isogeometric biharmonic operator, is given by
κ 2 ( T O A S ( 2 ) ) C 1 + H 3 γ 3 ,
where γ = h ( 2 r + 2 ) denotes the overlap parameter in (20) and C is a constant independent of h , H , N , γ but dependent on p , k .
Proof. 
The proof is based on [37], following the identical approach as in ([37], Theorem 4.1) through the utilization of Lemmas 1 and 2 related to the dual functional (12) and the quasi-interpolant (13) on GB-splines. □
In the next section, numerical performance are investigated not only on the parametric space Ω ^ but also on the physical space Ω where the geometrical map F is well-behaved.

5. Numerical Results

In this section, we provide numerical results to validate the convergence analysis of our 2-level overlapping Schwarz preconditioners (24) for solving the biharmonic Equation (1) over two-dimensional and three-dimensional domains.
Example 1. 
The first example involves the biharmonic problem in the 2D unit square:
Δ 2 u = f i n Ω ^ = ( 0 , 1 ) 2 , u = 0 o n Ω ^ , u n = 0 o n Ω ^ ,
where f is obtained from the exact solution u ( x , y ) = 100 x 2 y 2 ( x 1 ) 2 ( y 1 ) 2 . This first problem will be solved by using the GB-splines space V ^ h = s p a n { N ^ j , p , Σ U , V ( ζ ) } where the bivariate GB-spline N ^ j , p , Σ U , V ( ζ ) is obtained from the exponential GB-splines N ^ j d , p d , Σ d U d , V d ( ζ d ) , d = 1 , 2 of degree p associated with a knot vector Σ d and a generalized polynomial space E p , α i ( [ η i , η i + 1 ] ) with α i = 10 .
Example 2. 
The second test problem in a quarter of an annulus is as follows:
Δ 2 u = f i n Ω : = { ( x , y ) | 1 < x 2 + y 2 < 4 , x > 0 , y > 0 } , u = 0 o n Ω , u n = 0 o n Ω ,
where f is determined by the exact solution u = x 2 y 2 ( x 2 + y 2 1 ) 2 ( x 2 + y 2 4 ) 2 . The second biharmonic problem on the deformed domain will be discretized by the GB-splines space V h = s p a n { N ^ j , p , Σ U , V ( ζ ) F 1 } where the bivariate GB-spline N ^ j , p , Σ U , V ( ζ ) is obtained from the trigonometric GB-splines N ^ j d , p d , Σ d U d , V d ( ζ d ) , d = 1 , 2 of degree p associated with a knot vector Σ d and a generalized polynomial space T p , α i ( [ η i , η i + 1 ] ) with α i = π 2 .
Example 3. 
The 3D biharmonic problem in 3D cube under consideration reads as follows:
Δ 2 u = f i n Ω ^ = ( 0 , 1 ) 3 , u = 0 o n Ω ^ , u n = 0 o n Ω ^ ,
where f is obtained from the exact solution u ( x , y , z ) = ( 1 cos ( 2 π x ) ) ( 1 cos ( 2 π y ) ) ( 1 cos ( 2 π z ) ) . This 3D biharmonic problem is based on the GB-splines space V ^ h = s p a n { N ^ j , p , Σ U , V ( ζ ) } where the bivariate GB-spline N ^ j , p , Σ U , V ( ζ ) is obtained from the exponential GB-splines N ^ j d , p d , Σ d U d , V d ( ζ d ) , d = 1 , 2 , 3 of degree p associated with a knot vector Σ d and a generalized polynomial space E p , α i ( [ η i , η i + 1 ] ) with α i = 10 .
Along with mesh size h, polynomial degree p, regularity k and the overlap index r, isogeometric GB-splines discretize these 2D and 3D biharmonic problems by using the MATLAB isogeometric library GeoPDEs [49,50] (see also [51] for a MATLAB library recently introduced for the construction of Tchebycheff B-splines). To run the tests, we used a Samsung Notebook 9 (900X3L) laptop with two Intel(R) Core(TM) i7-6500U @2.50GHz processors and 8.00GiB of RAM memory. As mentioned in Section 3.1, we recall that the geometrical domains Ω ^ and Ω are decomposed into N overlapping subdomains of characteristic order H and overlap index r.
The biharmonic problem resulting from the IGA Galerkin discretization using GB-splines is tackled using the preconditioned conjugate gradient (PCG) technique with one-level (OAS(1)) and two-level (OAS(2)) overlapping additive Schwarz preconditioners (24), starting from an initial guess of zero and employing as stopping criterion a 10 6 reduction of the relative residual.

5.1. Two-Dimensional Tests: OAS(2) Scalability in N and Optimality in H / γ

The condition numbers κ 2 ( T O A S ) and the iteration counts it. of the proposed OAS(1) and OAS(2) preconditioners are reported in Table 1 as a function of the number of subdomains N and the mesh size 1 / h . The numerical test is performed on the two-dimensional square domain with fixed spline parameters p = 3 and k = 2 and overlap index r = 0 . As indicated by the findings in the upper part of Table 1, the OAS(1) preconditioner, excluding the coarse problem, has condition numbers increasing with N along the diagonal. In other words, scalability can only be accomplished by including a coarse component.
Table 1, Table 2 and Table 3 present additional numerical findings for the physical (quarter ring) and reference (unit square) domains in two-dimensional space, featuring diverse polynomial degree p, maximal regularity k = p 1 , and overlap r = 0 (minimal) and r = 1 . They show that our proposed OAS(2) preconditioners are scalable, as it is indicated that the condition numbers remain bounded by a constant that is unaffected by N, as one moves along the diagonal of the tables. Furthermore, Figure 2 and Figure 3 provide stronger evidence for the scalability and quasi-optimality of our proposed OAS(2) preconditioners.

5.2. Two-Dimensional Tests: OAS Dependence on p and r

Although p dependency of OAS(2) preconditioners is not within the scope of our theory, it would be beneficial to assess the effectiveness of OAS biharmonic preconditioners as the polynomial degree p increases. The numerical tests are carried out on both the quarter ring and square domains, which are discretized with mesh size h = 1 / 64 and subdivided into N = 2 × 2 subdomains. The value of p in the experiments ranges from 2 to 4, and the overlap index r is symmetric and increases gradually from minimal r = 0 to generous r = p . The condition numbers presented in Table 4 demonstrate that OAS(2) biharmonic preconditioners exhibit favorable behavior, while the non-preconditioned systems display ill-conditioned behavior with increasing polynomial degree p. Moreover, the results indicate that OAS(2) preconditioners show good performance in case of generous overlap ( r = p ) .

5.3. Three-Dimensional Tests: OAS(2) Scalability in N

The condition numbers, extremal eigenvalues and iteration counts of our OAS(2) preconditioners are displayed in Table 5 for the reference cubic domain as a function of the number of subdomains N. The numerical tests are performed with fixed subdomain size H / h = 4 , overlap index r = 0 , 1 and p = 2 , k = 1 and p = 3 , k = 2 shown in upper part and bottom of the table, respectively. The three-dimensional test outcomes establish the scalability of OAS(2) preconditioners, since the condition numbers appear to be bounded above irrespective of N. In addition, the performance of OAS(2) preconditioners is enhanced as the overlap size is increased, in accordance with the bound of Theorem 2.

6. Conclusions

In this paper, we study overlapping additive Schwarz (OAS) preconditioners for the biharmonic problem, which fits very naturally in the context of IGA due to the C 1 continuity requirement associated to a conforming discrete space. More specifically, we consider the problem of solving the linear systems that arise from isogeometric discretization based on GB-splines of the biharmonic Dirichlet problem. We have developed a theoretical analysis on condition number bounds for the preconditioned system in terms of the involved mesh sizes and overlap parameter. A set of numerical tests have confirmed the theoretical predictions and investigated the performance of our preconditioners with respect to various discretization parameters.
In the current paper, we have focused only on the biharmonic problem with homogeneous Dirichlet boundary conditions on the reference patch. We believe that our preconditioning techniques can be applied to the biharmonic problems either with mixed Dirichlet and Neumann boundary conditions or with inhomogeneous Dirichlet boundary conditions, where the former would be resolved by determining the respective knot spans corresponding to Γ D and Γ N on Ω ^ and the latter would be resolved by interpolating for the approximation of the boundary data in terms of the basis functions.
A current research direction is the theoretical extension of our proposed OAS method to the biharmonic problem on multipatch domains, as well as to other higher-order differential equations. Another research direction is related to developing modified OAS preconditioners with various intergrid transfer operators from much coarser space to the entire GB-splines space, which would probably improve computational cost. Finally, we are devising alternative preconditioning techniques (e.g., multilevel Schwarz methods and two-level FETI methods) that may be more effective for solving the biharmonic problems discretized with IGA GB-splines.

Funding

National Research Foundation of Korea: 2018R1D1A1B07048773; the Dongguk University Research Fund of 2021.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hughes, T.J.R.; Cottrell, J.A.; Bazilevs, Y. Isogeometric analysis: CAD, finite elements, NURBS, exact geometry, and mesh refinement. Comput. Methods Appl. Mech. Eng. 2005, 194, 4135–4195. [Google Scholar] [CrossRef]
  2. Cottrell, J.A.; Hughes, T.J.R.; Bazilevs, Y. Isogeometric Analysis. Towards Integration of CAD and FEA; Wiley: Hoboken, NJ, USA, 2009. [Google Scholar]
  3. Piegl, L.; Tiller, W. The NURBS Book, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 1997. [Google Scholar]
  4. Bracco, C.; Berdinsky, D.; Cho, D.; Oh, M.-J.; Kim, T.-W. Trigonometric generalized T-splines. Comput. Methods Appl. Mech. Eng. 2014, 268, 540–556. [Google Scholar] [CrossRef]
  5. Costantini, P.; Manni, C.; Pelosi, F.; Sampoli, M.L. Quasi-interpolation in isogeometric analysis based on generalized B-splines. Comput. Aided Geom. Des. 2010, 27, 656–668. [Google Scholar] [CrossRef]
  6. Kvasov, B.I.; Sattayatham, P. GB-splines of arbitrary order. J. Comput. Appl. Math. 1999, 104, 63–88. [Google Scholar]
  7. Manni, C.; Pelosi, F.; Sampoli, M.L. Generalized B-splines as a tool in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 2011, 200, 867–881. [Google Scholar] [CrossRef]
  8. Manni, C.; Pelosi, F.; Sampoli, M.L. Isogeometric analysis in advection–diffusion problems: Tension splines approximation. J. Comput. Appl. Math. 2011, 236, 511–528. [Google Scholar] [CrossRef]
  9. Manni, C.; Pelosi, F.; Speleers, H. Local hierarchical h-refinements in IgA based on generalized B-splines. In Mathematical Methods for Curves and Surfaces; Floater, M., Lyche, T., Mazure, M.L., Mørken, K., Schumaker, L.L., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2012; Volume 8177, pp. 341–363. [Google Scholar]
  10. Manni, C.; Reali, A.; Speleers, H. Isogeometric collocation methods with generalized B-splines. Comput. Math. Appl. 2015, 70, 1659–1675. [Google Scholar] [CrossRef]
  11. Ciarlet, P.G. Volume II: Theory of Plates, Studies in Mathematics and its Applications vol 27. In Mathematical Elasticity; North-Holland Publishing Co.: Amsterdam, The Netherlands, 1997. [Google Scholar]
  12. Girault, V.; Raviart, P.-A. Finite Element Approximation of the Navier-Stokes Equations; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1979; Volume 749. [Google Scholar]
  13. Brenner, S.; Scott, R. The Mathematical Theory of Finite Element Methods; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  14. Shi, Z.-C. Nonconforming finite element methods. J. Comput. Appl. Math. 2002, 149, 221–225. [Google Scholar] [CrossRef]
  15. Ciarlet, P.G.; Raviart, P.-A. A mixed finite element method for the biharmonic equation. In Mathematical Aspects of Finite Elements in Partial Differential Equations, Proceedings of the Symposium Conducted by the Mathematics Research Center, the University of Wisconsin, Madison, WI, USA, 1–3 April 1974; Academic Press: Cambridge, MA, USA, 2014; pp. 125–145. [Google Scholar]
  16. Cho, D. Overlapping Schwarz methods for isogeometric analysis based on generalized B-splines. Comput. Methods Appl. Mech. Eng. 2020, 372, 113430. [Google Scholar] [CrossRef]
  17. Beirão da Veiga, L.; Cho, D.; Pavarino, L.F.; Scacchi, S. Overlapping Schwarz methods for Isogeometric Analysis. SIAM J. Numer. Anal. 2012, 50, 1394–1416. [Google Scholar] [CrossRef]
  18. Beirão da Veiga, L.; Cho, D.; Pavarino, L.F.; Scacchi, S. Isogeometric Schwarz preconditioners for linear elasticity systems. Comput. Methods Appl. Mech. Eng. 2013, 253, 439–454. [Google Scholar] [CrossRef]
  19. Beirão da Veiga, L.; Cho, D.; Pavarino, L.F.; Scacchi, S. Overlapping Schwarz preconditioners for isogeometric collocation methods. Comput. Methods Appl. Mech. Eng. 2014, 278, 239–253. [Google Scholar] [CrossRef]
  20. Cho, D.; Pavarino, L.F.; Scacchi, S. Overlapping additive Schwarz preconditioners for isogeometric collocation discretizations of linear elasticity. Comput. Math. Appl. 2021, 93, 66–77. [Google Scholar] [CrossRef]
  21. Beirão da Veiga, L.; Pavarino, L.F.; Scacchi, S.; Widlund, O.B.; Zampini, S. Isogeometric BDDC preconditioners with deluxe scaling. SIAM J. Sci. Comput. 2014, 36, A1118–A1139. [Google Scholar] [CrossRef]
  22. Beirão da Veiga, L.; Pavarino, L.F.; Scacchi, S.; Widlund, O.B.; Zampini, S. Adaptive selection of primal constraints for isogeometric BDDC deluxe preconditioners. SIAM J. Sci. Comput. 2017, 39, A281–A302. [Google Scholar] [CrossRef]
  23. Pavarino, L.F.; Scacchi, S.; Widlund, O.B.; Zampini, S. Isogeometric BDDC deluxe preconditioners for linear elasticity. Math. Models Methods Appl. Sci. 2018, 28, 1337–1370. [Google Scholar] [CrossRef]
  24. Widlund, O.B.; Scacchi, S.; Pavarino, L.F. BDDC deluxe algorithms for two-dimensional H(curl) isogeometric analysis. SIAM J. Sci. Comput. 2022, 44, A2349–A2369. [Google Scholar] [CrossRef]
  25. Kleiss, S.K.; Pechstein, C.; Jüttler, B.; Tomar, S. IETI-Isogeometric Tearing and Interconnecting. Comput. Methods Appl. Mech. Eng. 2012, 247–248, 201–215. [Google Scholar] [CrossRef]
  26. Pavarino, L.F.; Scacchi, S. Isogeometric block FETI-DP preconditioners for the Stokes and mixed linear elasticity systems. Comput. Methods Appl. Mech. Eng. 2016, 310, 694–710. [Google Scholar] [CrossRef]
  27. Bracco, C.; Cho, D.; Giannelli, C.; Vázquez, R. BPX preconditioners for isogeometric analysis using (truncated) hierarchical B-splines. Comput. Methods Appl. Mech. Eng. 2021, 379, 113742. [Google Scholar] [CrossRef]
  28. Buffa, A.; Harbrecht, H.; Kunoth, A.; Sangalli, G. BPX-preconditioning for isogeometric analysis. Comput. Methods Appl. Mech. Eng. 2013, 265, 63–70. [Google Scholar] [CrossRef]
  29. Donatelli, M.; Garoni, C.; Manni, C.; Serra-Capizzano, S.; Speleers, H. Robust and optimal multi-iterative techniques for IgA Galerkin linear systems. Comput. Methods Appl. Mech. Eng. 2015, 284, 230–264. [Google Scholar] [CrossRef]
  30. Gahalaut, K.; Kraus, J.; Tomar, S. Multigrid Methods for Isogeometric Discretization. Comput. Methods Appl. Mech. Eng. 2013, 253, 413–425. [Google Scholar] [CrossRef] [PubMed]
  31. Hofreither, C.; Takacs, S. Robust multigrid for isogeometric analysis based on stable splittings of spline spaces. SIAM J. Numer. Anal. 2017, 55, 2004–2024. [Google Scholar] [CrossRef]
  32. Montardini, M.; Sangalli, G.; Tani, M. Robust isogeometric preconditioners for the Stokes system based on the Fast Diagonalization method. Comput. Methods Appl. Mech. Eng. 2018, 338, 162–185. [Google Scholar] [CrossRef]
  33. Sangalli, G.; Tani, M. Isogeometric preconditioners based on fast solvers for the Sylvester equation. SIAM J. Sci. Comput. 2016, 38, A3644–A3671. [Google Scholar] [CrossRef]
  34. Tani, M. A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis. Comput. Math. Appl. 2017, 74, 1690–1702. [Google Scholar] [CrossRef]
  35. Kapl, M.; Buchegger, F.; Bercovier, M.; Jüttler, B. Isogeometric analysis with geometrically continuous functions on planar multi-patch geometries. Comput. Methods Appl. Mech. Eng. 2017, 316, 209–234. [Google Scholar] [CrossRef]
  36. Moore, S.E. Discontinuous Galerkin isogeometric analysis for the biharmonic equation. Comput. Math. Appl. 2018, 76, 673–685. [Google Scholar] [CrossRef]
  37. Cho, D.; Pavarino, L.F.; Scacchi, S. Isogeometric Schwarz preconditioners for the biharmonic problem. Electron. Trans. Numer. Anal. 2018, 49, 81–102. [Google Scholar] [CrossRef]
  38. Lyche, T.; Manni, C.; Speleers, H. Tchebycheffian B-splines revisited: An introductory exposition. In Advanced Methods for Geometric Modeling and Numerical Simulation; Springer INdAM Series; Springer: Cham, Switzerland, 2019; Volume 35, pp. 179–216. [Google Scholar]
  39. Costantini, P.; Lyche, T.; Manni, C. On a class of weak Tchebycheff systems. Numer. Math. 2005, 101, 333–354. [Google Scholar] [CrossRef]
  40. Mazure, M.-L. On a general new class of quasi-Chebyshevian splines. Numer. Algorithm 2011, 58, 399–438. [Google Scholar] [CrossRef]
  41. Mazure, M.-L. How to build all Chebyshevian spline spaces good for Geometric Design. Numer. Math. 2011, 119, 517–556. [Google Scholar] [CrossRef]
  42. Manni, C.; Roman, F.; Speleers, H. Generalized B-splines in isogeometric analysis, Approximation theory XV: San Antonio 2016. Springer Proc. Math. Stat. 2017, 201, 239–267. [Google Scholar]
  43. de Boor, C. A Practical Guide to Splines; Springer: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
  44. Lyche, L. A recurrence relation for Chebyshevian B-splines. Constr. Approx. 1985, 1, 155–173. [Google Scholar] [CrossRef]
  45. Wang, G.; Fang, M. Unified and extended form of three types of splines. J. Comput. Appl. Math. 2008, 216, 498–508. [Google Scholar] [CrossRef]
  46. Schumaker, L.L. Spline Functions: Basic Theory, 3rd ed.; Cambridge Mathematical Library, Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
  47. Toselli, A.; Widlund, O.B. Domain Decomposition Methods: Algorithms and Theory. In Computational Mathematics; Springer: Berlin/Heidelberg, Germany, 2004; Volume 34. [Google Scholar]
  48. Dryja, M.; Widlund, O.B. Domain Decomposition Algorithms with Small Overlap. SIAM J. Sci. Comput. 1994, 15, 604–620. [Google Scholar] [CrossRef]
  49. Falco, C.D.; Reali, A.; Vazquez, R. GeoPDEs: A research tool for Isogeometric Analysis of PDEs. Adv. Eng. Softw. 2011, 42, 1020–1034. [Google Scholar] [CrossRef]
  50. Vázquez, R. A new design for the implementation of isogeometric analysis in Octave and Matlab: GeoPDEs 3.0. Comput. Math. Appl. 2016, 72, 523–554. [Google Scholar] [CrossRef]
  51. Speleers, H. Algorithm 1020, Computation of multi-degree Tchebycheffian B-splines. ACM Trans. Math. Softw. 2022, 48, 1–31. [Google Scholar] [CrossRef]
Figure 1. On the knot vector Σ = { 0 , 0 , 0 , 1 / 5 , 2 / 5 , 3 / 5 , 4 / 5 , 1 , 1 , 1 } , a comparison between (a) quadratic polynomial B-splines and (b) exponential GB-splines of degree 2, locally spanned by the functions { 1 , U ( ζ ) , V ( ζ ) } where U ( ζ ) = exp ( α i ζ ) and V ( ζ ) = exp ( α i ζ ) with α i = 10 .
Figure 1. On the knot vector Σ = { 0 , 0 , 0 , 1 / 5 , 2 / 5 , 3 / 5 , 4 / 5 , 1 , 1 , 1 } , a comparison between (a) quadratic polynomial B-splines and (b) exponential GB-splines of degree 2, locally spanned by the functions { 1 , U ( ζ ) , V ( ζ ) } where U ( ζ ) = exp ( α i ζ ) and V ( ζ ) = exp ( α i ζ ) with α i = 10 .
Axioms 12 00452 g001
Figure 2. Plot of κ 2 ( T O A S ) as a function of N (left) and H / h (right) for the reference 2D domain.
Figure 2. Plot of κ 2 ( T O A S ) as a function of N (left) and H / h (right) for the reference 2D domain.
Axioms 12 00452 g002
Figure 3. Plot of κ 2 ( T O A S ) as a function of N (left) and H / h (right) for 2D reference and deformed domains.
Figure 3. Plot of κ 2 ( T O A S ) as a function of N (left) and H / h (right) for 2D reference and deformed domains.
Axioms 12 00452 g003
Table 1. OAS preconditioners for biharmonic problems using IGA based on GB-splines: condition number κ 2 of the preconditioned operator and PCG iteration counts (it.) in brackets as a function of the number of subdomains N and mesh size 1 / h for one-level (upper table) and two-level (lower table) OAS preconditioners.
Table 1. OAS preconditioners for biharmonic problems using IGA based on GB-splines: condition number κ 2 of the preconditioned operator and PCG iteration counts (it.) in brackets as a function of the number of subdomains N and mesh size 1 / h for one-level (upper table) and two-level (lower table) OAS preconditioners.
OAS(1) Preconditioners with r = 0 , p = 3 , k = 2 GB-Splines, 2D Reference Square Domain
1 / h = 8 1 / h = 16 1 / h = 32 1 / h = 64 1 / h = 128 1 / h = 256
N κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.)
2 × 2 1.21 × 10 1 (9)5.86 × 10 1 (12)3.80 × 10 2 (17)2.84 × 10 3 (27)2.23 × 10 4 (51)1.78 × 10 5 (99)
4 × 4 8.50 × 10 1 (17)5.88 × 10 2 (28)4.46 × 10 3 (50)3.51 × 10 4 (96)2.79 × 10 5 (195)
8 × 8 1.16 × 10 3 (36)8.86 × 10 3 (72)6.97 × 10 4 (155)5.55 × 10 5 (341)
16 × 16 1.78 × 10 4 (96)1.40 × 10 5 (225)1.11 × 10 6 (534)
32 × 32 2.82 × 10 5 (305)2.23 × 10 6 (764)
64 × 64 4.51 × 10 6 (1077)
OAS(2) preconditioners with r = 0 , p = 3 , k = 2 GB-splines, 2D reference square domain
1 / h = 8 1 / h = 16 1 / h = 32 1 / h = 64 1 / h = 128 1 / h = 256
N κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.) κ 2 (it.)
2 × 2 4.87 (8)8.15 (12)3.08 × 10 1 (16)1.81 × 10 2 (25)1.31 × 10 3 (47)1.02 × 10 4 (93)
4 × 4 5.32 (14)1.36 × 10 1 (20)6.25 × 10 1 (36)4.06 × 10 2 (75)3.06 × 10 3 (163)
8 × 8 5.86 (16)1.96 × 10 1 (26)1.01 × 10 2 (53)6.86 × 10 2 (138)
16 × 16 6.26 (17)2.39 × 10 1 (29)1.29 × 10 2 (66)
32 × 32 6.20 (16)2.48 × 10 1 (30)
64 × 64 5.92 (15)
Table 2. OAS preconditioner in 2D deformed and reference domains: condition number κ 2 ( T O A S ) and iteration counts it. as a function of the number of subdomains N and mesh size 1 / h , r = 0 for non-preconditioned system and 2-level OAS preconditioner.
Table 2. OAS preconditioner in 2D deformed and reference domains: condition number κ 2 ( T O A S ) and iteration counts it. as a function of the number of subdomains N and mesh size 1 / h , r = 0 for non-preconditioned system and 2-level OAS preconditioner.
OAS prec. with p = 2 , k = 1 , r = 0 , 2D deformed domain
1 / h = 8 1 / h = 16 1 / h = 32 1 / h = 64 1 / h = 128 1 / h = 256
N κ 2 it. κ 2 it. κ 2 it. κ 2 it. κ 2 it. κ 2 it.
non-prec.1.09 × 10 2 192.02 × 10 3 1053.53 × 10 4 4605.96 × 10 5 19509.86 × 10 6 81751.61 × 10 8 33,502
2-level OAS 2 × 2 8.21113.85 × 10 1 182.56 × 10 2 331.97 × 10 3 621.57 × 10 4 1251.26 × 10 5 257
4 × 4 2.28 × 10 1 241.56 × 10 2 501.22 × 10 3 1239.84 × 10 3 3157.96 × 10 4 723
8 × 8 4.05 × 10 1 332.97 × 10 2 792.41 × 10 3 2281.97 × 10 4 645
16 × 16 5.49 × 10 1 414.07 × 10 2 1183.34 × 10 3 330
32 × 32 6.75 × 10 1 485.02 × 10 2 133
64 × 64 7.67 × 10 1 53
OAS prec. with p = 3 , k = 2 , r = 0 , 2D deformed domain
non-prec.5.17 × 10 1 228.20 × 10 2 781.33 × 10 4 2862.16 × 10 5 11593.49 × 10 6 48545.61 × 10 7 19,713
2-level OAS 2 × 2 7.59133.06 × 10 1 181.85 × 10 2 331.36 × 10 3 651.07 × 10 4 1388.54 × 10 4 313
4 × 4 1.83 × 10 1 239.86 × 10 1 426.97 × 10 2 955.41 × 10 3 2554.30 × 10 4 707
8 × 8 4.11 × 10 1 322.49 × 10 2 691.95 × 10 3 1771.54 × 10 4 509
16 × 16 7.91 × 10 1 413.66 × 10 2 804.08 × 10 3 258
32 × 32 7.73 × 10 1 425.15 × 10 2 91
64 × 64 8.50 × 10 1 43
OAS prec. with p = 4 , k = 3 , r = 0 , 2D reference domain (unit square)
non-prec.2.77 × 10 1 103.81 × 10 2 275.88 × 10 3 669.32 × 10 4 2111.49 × 10 6 7722.38 × 10 7 6202
2-level OAS 2 × 2 4.1386.76111.70 × 10 1 148.19 × 10 1 215.52 × 10 2 364.21 × 10 3 116
4 × 4 5.30161.05 × 10 1 183.62 × 10 1 282.02 × 10 2 491.45 × 10 3 123
8 × 8 6.25161.73 × 10 1 247.60 × 10 1 444.71 × 10 2 97
16 × 16 6.56162.27 × 10 1 261.18 × 10 2 55
32 × 32 6.38162.40 × 10 1 27
64 × 64 6.2618
Table 3. OAS preconditioner in 2D deformed domain: condition number κ 2 ( T O A S ) and iteration counts it. as a function of the number of subdomains N and mesh size 1 / h , r = 1 for non-preconditioned system and 2-level OAS preconditioner.
Table 3. OAS preconditioner in 2D deformed domain: condition number κ 2 ( T O A S ) and iteration counts it. as a function of the number of subdomains N and mesh size 1 / h , r = 1 for non-preconditioned system and 2-level OAS preconditioner.
OAS prec. with p = 2 , k = 1 , r = 1 , 2D deformed domain
1 / h = 8 1 / h = 16 1 / h = 32 1 / h = 64 1 / h = 128 1 / h = 256
N κ 2 it. κ 2 it. κ 2 it. κ 2 it. κ 2 it. κ 2 it.
non-prec.1.09 × 10 2 192.02 × 10 3 1053.53 × 10 4 4605.96 × 10 5 19509.86 × 10 6 81751.61 × 10 8 33,502
2-level OAS 2 × 2 4.3691.42 × 10 1 157.90 × 10 1 245.69 × 10 2 434.48 × 10 3 843.59 × 10 4 172
4 × 4 1.15 × 10 1 204.78 × 10 1 323.48 × 10 2 732.78 × 10 3 1882.25 × 10 4 448
8 × 8 2.03 × 10 1 278.79 × 10 1 516.76 × 10 2 1325.53 × 10 3 357
16 × 16 2.74 × 10 1 311.20 × 10 2 669.33 × 10 2 180
32 × 32 3.35 × 10 1 331.48 × 10 2 75
64 × 64 3.81 × 10 1 38
OAS prec. with p = 3 , k = 2 , r = 1 , 2D deformed domain
non-prec.5.17 × 10 1 228.20 × 10 2 781.33 × 10 4 2862.16 × 10 5 11593.49 × 10 6 48545.61 × 10 7 19,713
2-level OAS 2 × 2 5.04111.08 × 10 1 154.98 × 10 1 233.30 × 10 2 432.52 × 10 3 842.00 × 10 4 180
4 × 4 7.85172.81 × 10 1 281.73 × 10 2 551.28 × 10 3 1371.01 × 10 4 361
8 × 8 1.58 × 10 1 236.76 × 10 1 424.61 × 10 2 943.63 × 10 3 263
16 × 16 3.01 × 10 1 301.34 × 10 2 549.65 × 10 2 133
32 × 32 3.51 × 10 1 321.32 × 10 2 56
64 × 64 3.44 × 10 1 32
Table 4. Two-level OAS preconditioner on both the quarter ring domain and the reference unit square: condition number κ 2 ( T O A S ) as a function of the spline polynomial degree p for maximal regularity k = p 1 with different levels of overlap from symmetric minimal ( r = 0 ) to symmetric generous ( r = p ). Fixed 1 / h = 64 , N = 2 × 2 , H / h = 32 .
Table 4. Two-level OAS preconditioner on both the quarter ring domain and the reference unit square: condition number κ 2 ( T O A S ) as a function of the spline polynomial degree p for maximal regularity k = p 1 with different levels of overlap from symmetric minimal ( r = 0 ) to symmetric generous ( r = p ). Fixed 1 / h = 64 , N = 2 × 2 , H / h = 32 .
p k = p 1 , 2D Deformed Domain k = p 1 , Unit Square
Non-Prec.2-Level OASNon-Prec.2-Level OAS
r = 0 r = 2 r = 4 r = p r = 0 r = 2 r = 4 r = p
25.96 × 10 5 1.97 × 10 3 2.43 × 10 2 7.70 × 10 1 2.43 × 10 2 2.07 × 10 5 1.70 × 10 3 2.18 × 10 2 7.14 × 10 1 2.18 × 10 2
32.16 × 10 5 1.36 × 10 3 1.34 × 10 2 4.22 × 10 1 6.95 × 10 1 7.08 × 10 4 1.81 × 10 2 2.34 × 10 1 9.831.41 × 10 1
42.88 × 10 5 5.03 × 10 2 8.58 × 10 1 3.22 × 10 1 3.22 × 10 1 9.32 × 10 4 8.19 × 10 1 1.91 × 10 1 1.00 × 10 1 1.00 × 10 1
Table 5. Two-level OAS preconditioners in the 3D cubic domain: condition number κ 2 ( T O A S ) , extreme eigenvalues λ max , λ min and iteration counts it. as a function of the number of subdomains N. Fixed H / h = 4 , p = 2 , k = 1 (top table), p = 3 , k = 2 (bottom table).
Table 5. Two-level OAS preconditioners in the 3D cubic domain: condition number κ 2 ( T O A S ) , extreme eigenvalues λ max , λ min and iteration counts it. as a function of the number of subdomains N. Fixed H / h = 4 , p = 2 , k = 1 (top table), p = 3 , k = 2 (bottom table).
Two-Level OAS, 3D Cubic Domain
r = 0 r = 1
N κ 2 = λ max / λ min it. κ 2 = λ max / λ min it.
2 × 2 × 2 11.06 = 8.00/0.7297.66 = 8.00/1.047
3 × 3 × 3 22.30 = 8.10/0.36189.43 = 9.43/1.0018
p = 2 4 × 4 × 4 25.86 = 8.09/0.312214.28 = 11.52/0.8122
k = 1 5 × 5 × 5 24.54 = 8.08/0.332617.08 = 11.25/0.6623
6 × 6 × 6 23.24 = 8.07/0.352817.95 = 11.45/0.6425
7 × 7 × 7 22.52 = 8.07/0.362917.28 = 11.38/0.6626
2 × 2 × 2 13.20 = 8.05/0.61148.86 = 8.30/0.9413
p = 3 3 × 3 × 3 14.09 = 8.01/0.57189.37 = 8.32/0.8920
k = 2 4 × 4 × 4 14.91 = 8.09/0.542210.00 = 8.76/0.8822
5 × 5 × 5 15.85 = 8.03/0.512310.08 = 8.77/0.8723
6 × 6 × 6 16.84 = 8.09/0.482410.06 = 8.79/0.8723
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cho, D. Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem. Axioms 2023, 12, 452. https://doi.org/10.3390/axioms12050452

AMA Style

Cho D. Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem. Axioms. 2023; 12(5):452. https://doi.org/10.3390/axioms12050452

Chicago/Turabian Style

Cho, Durkbin. 2023. "Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem" Axioms 12, no. 5: 452. https://doi.org/10.3390/axioms12050452

APA Style

Cho, D. (2023). Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem. Axioms, 12(5), 452. https://doi.org/10.3390/axioms12050452

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop