Skip to main content
Springer logoLink to Springer
. 2016 Aug 11;136(1):147–182. doi: 10.1007/s00211-016-0836-8

Optimal convergence for adaptive IGA boundary element methods for weakly-singular integral equations

Michael Feischl 1, Gregor Gantner 2,, Alexander Haberl 2, Dirk Praetorius 2
PMCID: PMC5445587  PMID: 28615749

Abstract

In a recent work (Feischl et al. in Eng Anal Bound Elem 62:141–153, 2016), we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the multiplicity of the knots. In the present work, we give a mathematical proof that this algorithm leads to convergence even with optimal algebraic rates. Technical contributions include a novel mesh-size function which also monitors the knot multiplicity as well as inverse estimates for NURBS in fractional-order Sobolev norms.

Mathematics Subject Classification: 65D07, 65N38, 65N50, 65Y20

Introduction

Isogeometric analysis

The central idea of isogeometric analysis (IGA) is to use the same ansatz functions for the discretization of the partial differential equation at hand, as are used for the representation of the problem geometry. Usually, the problem geometry Ω is represented in CAD by means of non-uniform rational B-splines (NURBS), T-splines, or hierarchical splines. This concept, originally invented in [32] for finite element methods (IGAFEM) has proved very fruitful in applications; see also the monograph [9].

Since CAD directly provides a parametrization of the boundary Ω, this makes the boundary element method (BEM) the most attractive numerical scheme, if applicable (i.e., provided that the fundamental solution of the differential operator is explicitly known). However, compared to the IGAFEM literature, only little is found for isogeometric BEM (IGABEM). The latter has first been considered for 2D BEM in [36] and for 3D BEM in [40]. Unlike standard BEM with piecewise polynomials which is well-studied in the literature, cf. the monographs [39, 41] and the references therein, the numerical analysis of IGABEM is widely open. We refer to [35, 37, 38, 42] for numerical experiments, to [44] for fast IGABEM with H-matrices, and to [31] for some quadrature analysis. To the best of our knowledge, a posteriori error estimation for IGABEM, however, has only been considered for simple 2D model problems in the recent own works [24, 25]. The present work extends the techniques from standard BEM to non-polynomial ansatz functions. The remarkable flexibility of the IGA ansatz functions to manipulate their smoothness properties motivates the development of a new adaptive algorithm which does not only automatically adapt the mesh-width, but also the continuity of the IGA ansatz function to exploit the additional freedoms and the full potential of IGA. This is the first algorithm which simultaneously steers the resolution and the smoothness of the ansatz functions, and, it may thus be a first step to a full hpk-adaptive algorithm.

For standard BEM with discontinuous piecewise polynomials, a posteriori error estimation and adaptive mesh-refinement are well understood. We refer to [1, 11, 12] for weighted-residual error estimators and to [19, 22] for recent overviews on available a posteriori error estimation strategies. Moreover, optimal convergence of mesh-refining adaptive algorithms has recently been proved for polyhedral boundaries [20, 21, 26] as well as smooth boundaries [27]. The work [2] allows to transfer these results to piecewise smooth boundaries; see also the discussion in the review article [8].

While this work focusses on adaptive IGABEM, adaptive IGAFEM is considered, e.g., in [16, 43]. A rigorous error and convergence analysis in the frame of adaptive IGAFEM is first found in [5] which proves linear convergence for some adaptive IGAFEM with hierarchical splines for the Poisson equation, and optimal rates are announced for some future work.

Model problem

We develop and analyze an adaptive algorithm for the following model problem: Let ΩR2 be a Lipschitz domain with diam(Ω)<1 and ΓΩ be a compact, piecewise smooth part of its boundary with finitely many connected components. We consider the weakly-singular boundary integral equation

Vϕ(x):=-12πΓlog|x-y|ϕ(y)dy=f(x)for allxΓ, 1.1

where the right-hand side f is given and the density ϕ is sought. We note that (1.1) for Γ=Ω is equivalent to the Laplace–Dirichlet problem

-Δu=0inΩwithu=fonΓ,whereu:=Vϕ. 1.2

To approximate ϕ, we employ a Galerkin boundary element method (BEM) with ansatz spaces consisting of p-th order NURBS. The convergence order for uniform partitions of Γ is usually suboptimal, since the unknown density ϕ may exhibit singularities, which are stronger than the singularities in the geometry. In [24], we analyzed a weighted-residual error estimator and proposed an adaptive algorithm which uses this a posteriori error information to steer the h-refinement of the underlying partition as well as the local smoothness of the NURBS across the nodes of the adaptively refined partitions. It reflects the fact that it is a priori unknown, where the singular and smooth parts of the density ϕ are located and where approximation by nonsmooth resp. smooth functions is required. In [24], we observed experimentally that the proposed algorithm detects singularities and possible jumps of ϕ and leads to optimal convergence behavior. In particular, we observed that the proposed adaptive strategy is also superior to adaptive BEM with discontinuous piecewise polynomials in the sense that our adaptive NURBS discretization requires less degrees of freedom to reach a prescribed accuracy.

Contributions

We prove that the adaptive algorithm from [24] is rate optimal in the sense of [8]: Let μ be the weighted-residual error estimator in the -th step of the adaptive algorithm. First, the adaptive algorithm leads to linear convergence of the error estimator, i.e., μ+nCqnμ for all ,nN0 and some independent constants C>0 and 0<q<1. Moreover, for sufficiently small marking parameters, i.e. aggressive adaptive refinement, the estimator decays even with the optimal algebraic convergence rate. Here, the important innovation is that the adaptive algorithm does not only steer the local refinement of the underlying partition (as is the case in the available literature, e.g., [8, 20, 21, 26, 27]), but also the multiplicity of the knots. In particular, the present work is the first available optimality result for adaptive algorithms in the frame of isogeometric analysis. Additionally, we can prove at least plain convergence if the adaptive algorithm is driven by the Faermann estimator η analyzed in [25] instead of the weighted-residual estimator μ, which generalizes a corresponding result for standard adaptive BEM [23].

Technical contributions of general interest include a novel mesh-size function hL(Γ) which is locally equivalent to the element length (i.e., h|Tlength(T) for all elements T), but also accounts for the knot multiplicity. Moreover, for 0<σ<1, we prove a local inverse estimate hσΨL2(Γ)CΨH~-σ(Γ) for NURBS on locally refined meshes. Similar estimates for piecewise polynomials are shown in [15, 29, 30], while [3] considers NURBS but integer-order Sobolev norms only.

Throughout, all results apply for piecewise smooth parametrizations γ of Γ and discrete NURBS spaces. In particular, the analysis thus covers the NURBS ansatz used for IGABEM, where the same ansatz functions are used for the discretization of the integral equation and for the resolution of the problem geometry, as well as spline spaces and even piecewise polynomials on the piecewise smooth boundary Γ which can be understood as special NURBS.

Outline

The remainder of this work is organized as follows: Sect. 2 fixes the notation and provides the necessary preliminaries. This includes, e.g., the involved Sobolev spaces (Sect. 2.2), the functional analytic setting of the weakly-singular integral equation (Sect. 2.3), the assumptions on the parametrization of the boundary Γ (Sect. 2.4), the discretization of the boundary (Sect. 2.5), the mesh-refinement strategy (Sect. 2.6), B-splines and NURBS (Sect. 2.7), and the IGABEM ansatz spaces (Sect. 2.8). Section 3 states our adaptive algorithm (Algorithm 3.1) from [24] and formulates the main theorems on linear convergence with optimal rates for the weighted-residual estimator μ (Theorem 3.2) and on plain convergence for the Faermann estimator η (Theorem 3.4). The linear convergence for the μ-driven algorithm is proved in Sect. 4. The proof requires an inverse estimate for NURBS in a fractional-order Sobolev norm (Proposition 4.1) as well as a novel mesh-size function for B-spline and NURBS discretizations (Proposition 4.2) which might be of independent interest. The proof of optimal convergence behaviour is given in Sect. 5. In Sect. 6, we show convergence for the η-driven algorithm.

For the empirical verification of the optimal convergence behavior of Algorithm 3.1 for μ- as well as η-driven adaptivity and a comparison of IGABEM and standard BEM with discontinuous piecewise polynomials, we refer to the numerous numerical experiments in our preceding work [24].

Preliminaries

General notation

Throughout, |·| denotes the absolute value of scalars, the Euclidean norm of vectors in R2, the measure of a set in R (e.g., the length of an interval), or the arclength of a curve in R2. The respective meaning will be clear from the context. We write AB to abbreviate AcB with some generic constant c>0 which is clear from the context. Moreover, AB abbreviates ABA. Throughout, mesh-related quantities have the same index, e.g., N is the set of nodes of the partition T, and h is the corresponding local mesh-width etc. The analogous notation is used for partitions T+ resp. T etc.

Sobolev spaces

For any measurable subset Γ0Γ, let L2(Γ0) denote the Lebesgue space of all square integrable functions which is associated with the norm uL2(Γ0)2:=Γ0|u(x)|2dx. We define for any 0<σ1 the Hilbert space

Hσ(Γ0):={uL2(Γ0):uHσ(Γ0)<}, 2.1

associated with the Sobolev–Slobodeckij norm

uHσ(Γ0)2:=uL2(Γ0)2+|u|Hσ(Γ0)2, 2.2

with

|u|Hσ(Γ0)2:=Γ0Γ0|u(x)-u(y)|2|x-y|1+2σdydx,for0<σ<1ΓuL2(Γ0),forσ=1, 2.3

where γ denotes the arclength derivative. For finite intervals IR, we use analogous definitions. By H~-σ(Γ0), we denote the dual space of Hσ(Γ0), where duality is understood with respect to the extended L2(Γ0)-scalar product, i.e.,

u;ϕΓ0=Γ0u(x)ϕ(x)dxfor alluHσ(Γ0)andϕL2(Γ0). 2.4

We note that Hσ(Γ)L2(Γ)H~-σ(Γ) form a Gelfand triple and all inclusions are dense and compact. Amongst other equivalent definitions of Hσ(Γ0) are for example interpolation techniques. All these definitions provide the same space of functions but different norms, where norm equivalence constants depend only on Γ0; see, e.g., the monographs [33, 34] and the references therein. Throughout our proofs, we shall use the Sobolev–Slobodeckij norm (2.2), since it is numerically computable.

Weakly-singular integral equation

It is known [33, 34] that the weakly-singular integral operator V:H~-1/2(Γ)H1/2(Γ) from (1.1) is a symmetric and elliptic isomorphism if diam(Ω)<1 which can always be achieved by scaling. For a given right-hand side fH1/2(Γ), the strong form (1.1) is thus equivalently stated by

Vϕ;ψΓ=f;ψΓfor allψH~-1/2(Γ), 2.5

and the left-hand side defines an equivalent scalar product on H~-1/2(Γ). In particular, the Lax–Milgram lemma proves existence and uniqueness of the solution ϕH~-1/2(Γ). Additionally, V:L2(Γ)H1(Γ) is well-defined, linear, and continuous.

In the Galerkin boundary element method, the test space H~-1/2(Γ) is replaced by some discrete subspace XL2(Γ)H~-1/2(Γ). Again, the Lax–Milgram lemma guarantees existence and uniqueness of the solution ΦX of the discrete variational formulation

VΦ;ΨΓ=f;ΨΓfor allΨX. 2.6

Below, we shall assume that X is linked to a partition T of Γ into a set of connected segments.

Boundary parametrization

Let Γ=iΓi be decomposed into its finitely many connected components Γi. Since the Γi are compact and piecewise smooth as well, it holds

uH1/2(Γ)2=iuH1/2(Γi)2+i,jijΓiΓj|u(x)-u(y)|2|x-y|2dydxiuH1/2(Γi)2;

see, e.g., [25, Section 2.2]. The usual piecewise polynomial and NURBS basis functions have connected support and are hence supported by some single Γi each. Without loss of generality and for the ease of presentation, we may therefore assume throughout that Γ is connected. All results of this work remain valid for non-connected Γ.

We assume that either Γ=Ω is parametrized by a closed continuous and piecewise two times continuously differentiable path γ:[a,b]Γ such that the restriction γ|[a,b) is even bijective, or that ΓΩ is parametrized by a bijective continuous and piecewise two times continuously differentiable path γ:[a,b]Γ. In the first case, we speak of closed Γ=Ω, whereas the second case is referred to as open ΓΩ.

For closed Γ=Ω, we denote the (b-a)-periodic extension to R also by γ. For the left and right derivative of γ, we assume that γ(t)0 for t(a,b] and γr(t)0 for t[a,b). Moreover we assume that γ(t)+cγr(t)0 for all c>0 and t[a,b] resp. t(a,b). Finally, let γL:[0,L]Γ denote the arclength parametrization, i.e., |γL(t)|=1=|γLr(t)|, and its periodic extension. Elementary differential geometry yields bi-Lipschitz continuity

CΓ-1|γL(s)-γL(t)||s-t|CΓfors,tR,with|s-t|34L,for closedΓ,st[0,L],for openΓ, 2.7

where CΓ>0 depends only on Γ. A proof is given in [28, Lemma 2.1] for closed Γ=Ω. For open ΓΩ, the proof is even simpler.

Let I[a,b]. If Γ=Ω is closed and |I|34L resp. if ΓΩ is open, the bi-Lipschitz continuity (2.7) implies

CΓ-1|uγL|H1/2(I)|u|H1/2(γL(I))CΓ|uγL|H1/2(I). 2.8

Boundary discretization

In the following, we describe the different quantities which define the discretization.

Nodes zj=γ(zˇj)N. Let N:={zj:j=1,,n} and z0:=zn for closed Γ=Ω resp. N:={zj:j=0,,n} for open ΓΩ be a set of nodes. We suppose that zj=γ(zˇj) for some zˇj[a,b] with a=zˇ0<zˇ1<zˇ2<<zˇn=b such that γ|[zˇj-1,zˇj]C2([zˇj-1,zˇj]).

Multiplicity #zj and knots K,Kˇ. Let pN0 be some fixed polynomial order. Each node zj has a multiplicity #zj{1,2,p+1} with #z0=#zn=p+1. This induces knots

K=(zk,,zk#zk-times,,zn,,zn#zn-times), 2.9

with k=1 resp. k=0 and corresponding knots Kˇ:=γ|(a,b]-1(K) resp. Kˇ:=γ-1(K) on the parameter domain [ab].

Elements, partition T, and [T], [T]. Let T={T1,,Tn} be a partition of Γ into compact and connected segments Tj=γ(Tˇj) with Tˇj=[zˇj-1,zˇj]. We define

[T]:={[T]:TT}with[T]:=(T,#zT,1,#zT,2), 2.10

where zT,1=zj-1 and zT,2=zj are the two nodes of T=Tj.

Local mesh-sizes h,T, hˇ,T and h, hˇ. The arclength of each element TT is denoted by h,T. We define the local mesh-width function hL(Γ) by h|T=h,T. Additionally, we define for each element TT its length hˇ,T:=|γ-1(T)| with respect to the parameter domain [ab]. This gives rise to hˇL(Γ) with hˇ|T=hˇ,T. Note that the lengths h,T and hˇ,T of an element T are equivalent, where the equivalence constants depend only on γ.

Local mesh-ratios κˇ. We define the local mesh-ratio by

κˇ:=max{hˇ,T/hˇ,T:T,TTwithTT}. 2.11

Patches ω(z), ω(U), ω(U), and U. For each set UΓ, we inductively define for mN0 (Fig. 1)

ωm(U):=Uifm=0,ω(U):={TT:TU}ifm=1,ω(ωm-1(U))ifm>1.

For nodes zΓ, we abbreviate ω(z)=:ω({z}). For each set U[T], we define

U:={TT:[T]U},

and

ωm(U):=ωmU.

Fig. 1.

Fig. 1

The patch ω(z) of some node zN resp. the patch ω(T) are illustrated in blue resp. green

Mesh-refinement

Suppose that we are given a deterministic mesh-refinement strategy ref(·) such that, for each mesh [T] and an arbitrary set of marked nodes MN, the application [T+]:=ref([T],M) provides a mesh in the sense of Sect. 2.5 such that, first, the marked nodes belong to the union of the refined elements, i.e., M([T]\[T+]), and, second, the knots K form a subsequence of the knots K+. The latter implies the estimate

|[T]\[T+]|2(|K+|-|K|), 2.12

since [T]\[T+] is the set of all elements in which a new knot is inserted and one new knot can be inserted in at most 2 elements of the old mesh, i.e., at the intersection of 2 elements.

We write [T+]ref([T]), if there exist finitely many meshes [T1],,[T] and subsets MjNj of the corresponding nodes such that [T]=[T1], [T+]=[T], and [Tj]=ref([Tj-1],Mj-1) for all j=2,,, where we formally allow m=1, i.e., [T]=[T1]ref([T]).

For the proof of our main result, we need the following assumptions on ref(·).

Assumption 2.1

For an arbitrary initial mesh [T0] and [T]:=ref([T0]), we assume that the mesh-refinement strategy satisfies the properties (M1)–(M3):

  1. There exists a constant κˇmax1 such that the local mesh-ratios (2.11) are uniformly bounded
    κˇκˇmaxfor all[T][T]. 2.13
  2. For all [T],[T+][T], there is a common refinement [TT+]ref([T])ref([T+]) such that the knots KK+ of [TT+] satisfy the overlay estimate
    |KK+||K|+|K+|-|K0|. 2.14
  3. Each sequence [T][T] of meshes generated by successive mesh-refinement, i.e., [Tj]=ref([Tj-1],Mj-1) for all jN and arbitrary MjNj, satisfies
    |K|-|K0|Cmeshj=0-1|Mj|forN, 2.15
    where Cmesh>0 depends only on [T0].

These assumptions are especially satisfied for pure h-refinement based on local bisection [1] as well as for the concrete strategy used in [24, 25]. The latter strategy looks as follows: Let [T][T]. Let MN be a set of marked nodes. To get the refined mesh [T+]:=ref([T],M), we proceed as follows:

  • (i)

    If both nodes of an element TT belong to M, the element T will be marked.

  • (ii)

    For all other nodes in M, the multiplicity will be increased if it is less or equal to p+1, otherwise the elements which contain one of these nodes zM, will be marked.

  • (iii)

    Recursively, mark further elements TT for refinement if there exists a marked element TT with TT and hˇ,T>κˇ0hˇ,T.

  • (iv)

    Refine all marked elements TT by bisection and hence obtain [T+].

According to [1], the proposed recursion in step (iii) terminates and the generated partition T+ guarantees (M1) with κˇmax=2κˇ0. The following proposition shows that also the assumptions (M2)–(M3) are satisfied.

Proposition 2.2

The proposed refinement strategy ref(·) used in [24, 25] satisfies Assumption 2.1, where κˇmax=2κˇ0 and Cmesh depends only on the initial partition of the parameter domain,  i.e.,  T0 transformed onto [ab].

Proof

For any partition T of Γ and any subset of marked elements ST, let ref~(T,S) be the partition obtained from the recursive bisection in step (iii)–(iv) above. This local h-refinement procedure has been analyzed in [1]. According to [1, Theorem 2.3], the recursion is well-defined and guarantees κˇ2κˇ0 for all Tref~(T0).

To see (M2), [1, Theorem 2.3] guarantees the existence of some coarsest common refinement T~T+ref~(T)ref~(T+) such that

|T~T+||T|+|T+|-|T0|.

The corresponding nodes just satisfy NN+=NN+. There exists a finite sequence of meshes T=T~1,T~2=ref~(T~1,S1),,T~=ref~(T~-1,S-1)=T~T+ with suitable SjTj for j=1,,-1. If we define MjNj as the set of all nodes in Sj, we see that the sequence [T]=[T1],[T2]=ref([T1],M1),[T]=ref([T-1,M-1) satisfies Tj=T~j for j=1,. By repetitively marking one single node, we obtain from [T] a mesh [TT+] with nodes NN+=NN+ and #z=max(#z,#+z), where # resp. #+ denote the multiplicity in K resp. K+ and, e.g., #+z:=0 if zN\N+. There obviously holds

|KK+|=zNN+#z|K|+|K+|-|K0|.

Moreover, [TT+] is clearly a refinement of [T+] as well.

Finally we consider (M3). As before we have T1=ref~(T0,S0),, T=ref~(T-1,S-1) for suitable SjTj, j=0,,-1. Note that there holds |Sj|2|Mj|. We denote |#j|:=|Kj+1|-|Kj|-(|Nj+1|-|Nj|) as the number of multiplicity increases during the j-th refinement. There holds

|Kj+1|-|Kj|=|Tj+1|-|Tj|+|#j|

and hence

|K|-|K0|=|T|-|T0|+j=0-1|#j|.

The term |T|-|T0| can be estimated by Cj=0-1|Sj| with some constant C>0 which depends only on the initial partition of the parameter domain, see [1, Theorem 2.3], and hence by 2Cj=0-1|Mj|. The estimate |#j||Mj| concludes the proof with Cmesh=2C+1.

B-splines and NURBS

Throughout this subsection, we consider knots Kˇ:=(ti)iZ on R with multiplicity #ti which satisfy ti-1ti for iZ and limi±ti=±. Let Nˇ:={ti:iZ}={zˇj:jZ} denote the corresponding set of nodes with zˇj-1<zˇj for jZ. For iZ, the i-th B-spline of degree p is defined inductively by (Fig. 2)

Bi,0:=χ[ti-1,ti),Bi,p:=βi-1,pBi,p-1+(1-βi,p)Bi+1,p-1forpN, 2.16

where, for tR,

βi,p(t):=t-titi+p-tiiftiti+p,0ifti=ti+p.

We also use the notations Bi,pKˇ:=Bi,p and βi,pKˇ:=βi,p to stress the dependence on the knots Kˇ. The following lemma collects some basic properties of B-splines.

Fig. 2.

Fig. 2

B-splines on the interval [0, 1] corresponding to knot sequence (,0,0,0,1/3,1/3,1/3,2/3,2/3,1,1,1,)

Lemma 2.3

Let I=[a,b) be a finite interval and pN0. Then,  the following assertions (i)–(vi) hold : 

  • (i)

    The set {Bi,p|I:iZ,Bi,p|I0} is a basis for the space of all right-continuous Nˇ-piecewise polynomials of degree lower or equal p on I which are,  at each knot ti, p-#ti times continuously differentiable if p-#ti0.

  • (ii)

    For iZ, Bi,p vanishes outside the interval [ti-1,ti+p). It is positive on the open interval (ti-1,ti+p).

  • (iii)

    For iZ, Bi,p is completely determined by the p+2 knots ti-1,,ti+p.

  • (iv)
    The B-splines of degree p form a (locally finite) partition of unity,  i.e., 
    iZBi,p=1onR. 2.17

Proof

The proof of (i) is found in [14, Theorem 6], and (ii)–(iii) are proved in [14, Section 2]. (iv) is proved in [14, page 9–10].

In addition to the knots Kˇ=(ti)iZ, we consider positive weights W:=(wi)iZ with wi>0. For iZ and pN0, we define the i-th NURBS by

Ri,p:=wiBi,pZwB,p. 2.18

We also use the notation Ri,pKˇ,W:=Ri,p. Note that the denominator is locally finite and positive.

For any pN0, we define the B-spline space

Sp(Kˇ):=iZaiBi,p:aiR 2.19

as well as the NURBS space

Np(Kˇ,W):=iZaiRi,p:aiR=Sp(Kˇ)iZwB,pKˇ. 2.20

Ansatz spaces

Let [T0] be a given initial mesh with corresponding knots K0 such that h0|Γ|/4 for closed Γ=Ω. We set [T]:=ref([T0]). Suppose that W0=(wi)i=1-pN-p are given initial weights with N=|K0| for closed Γ=Ω resp. N=|K0|-(p+1) for open ΓΩ.

If Γ=Ω is closed, we extend the transformed knot sequence Kˇ0=(ti)i=1N arbitrarily to (ti)iZ with t-p==t0=a, titi+1, limi±ti=± and W0=(wi)iZ with wi>0. For the extended sequences, we also write Kˇ0 and W0 and set

X0:=Np(Kˇ0,W0)|[a,b)γ|[a,b)-1. 2.21

If ΓΩ is open, we extend the sequences Kˇ0=(ti)i=-pN and W0 arbitrarily to (ti)iZ with titi+1, limi±ti=± and W0=(wi)iZ with wi>0. This allows to define

X0:=Np(Kˇ0,W0)|[a,b]γ-1. 2.22

Due to Lemma 2.3, this definition does not depend on how the sequences are extended.

Let [T][T] be a mesh with knots K. Via knot insertion from K0 to K, one obtains unique corresponding weights W. These are chosen such that the denominators of the NURBS functions do not change. In particular, this implies nestedness

XX+for all[T][T],[T+]ref(T), 2.23

where the spaces X resp. X+ are defined analogously to (2.21)–(2.22). Moreover, the weights are just convex combinations of W0, wherefore

wmin:=min(W0)min(W)max(W)max(W0)=:wmax. 2.24

For further details, we refer to, e.g., [25, Section 4.2].

Adaptive algorithm and main results

For each mesh [T][T], define the node-based error estimator

μ2=zNμ(z)2, 3.1a

where the refinement indicators read

μ(z)2:=|γ-1(ω(z))|Γ(f-VΦ)L2(ω(z))2for allzN. 3.1b

Here, we must additionally suppose fH1(Γ) to ensure that μ is well-defined. It has been proved in [24] that μ is reliable, i.e.,

ϕ-ΦH~-1/2(Γ)Crelμ, 3.2

where Crel>0 depends only on p, wmin, wmax, γ, and κˇmax. We note that the weighted-residual error estimator in the form μh1/2Γ(f-VΦ)L2(Γ) goes back to the works [6, 13], where reliability (3.2) is proved for standard 2D BEM with piecewise constants on polyhedral geometries, while the corresponding result for 3D BEM is found in [12]. We consider the following adaptive algorithm which employs the Dörfler marking strategy (3.3) from [17] to single out nodes for refinement.

Algorithm 3.1

Input: Adaptivity parameter 0<θ<1, Cmark1, polynomial order pN0, initial mesh [T0], initial weights W0.

Adaptive loop: For each =0,1,2, iterate the following steps (i)–(iv):

  • (i)

    Compute discrete approximation ΦX from Galerkin BEM.

  • (ii)

    Compute refinement indicators μ(z) for all nodes zN.

  • (iii)
    Determine an up to the multiplicative constant Cmark minimal set of nodes MN such that
    θμ2zMμ(z)2. 3.3
  • (iv)

    Generate refined mesh [T+1]:=ref([T],M).

Output: Approximate solutions Φ and error estimators μ for all N0.

Our main result is that the proposed algorithm is linearly convergent, even with the optimal algebraic rate. For a precise statement of this assertion, let [TN]:={[T][T]:|K|-|K0|N} be the finite set of all refinements having at most N knots more than [T0]. Following [8], we introduce an estimator-based approximation class As for s>0: We write ϕAs if

ϕAs:=supNN0(N+1)smin[T][TN]μ<. 3.4

In explicit terms, this just means that an algebraic convergence rate of O(N-s) for the estimator is possible, if the optimal meshes are chosen. The following theorem is the main result of our work:

Theorem 3.2

Let fH1(Γ), so that the weighted-residual error estimator μ from (3.1) is well-defined and that Algorithm 3.1 is driven by μ. We suppose that the Assumption 2.1 on the mesh-refinement holds true. Then,  for each 0<θ1, there exist constants 0<qlin<1 and Clin>0 such that Algorithm 3.1 is linearly convergent in the sense of

μ+nClinqlinnμfor all,nN0. 3.5

In particular,  this implies convergence

Crel-1ϕ-ΦH~-1/2(Γ)μClinqlinμ00. 3.6

Moreover,  there is a constant 0<θopt<1 such that for all 0<θ<θopt, there exists a constant Copt>0 such that,  for all s>0, it holds

ϕAsμCopt1+s(1-qlin1/s)sϕAs(|K|-|K0|)-sfor allN0. 3.7

The constants qlin,Clin depend only on p,wmin,wmax,γ,θ, and κˇmax from (M1). The constant θopt depends only on p,wmin,wmax,γ, and (M1)–(M3), and Copt depends additionally on θ.

Remark 3.3

The proof of Theorem 3.2 reveals that linear convergence (3.5) only requires (M1), while optimal rates (3.7) rely on (3.5) and (M2)–(M3). Provided that there exists a constant Cson>0 such that |K|Cson|ref([T],M)| for all [T][T] and MN, also the converse implication in (3.7) holds true. The proof follows along the lines of [8, Proposition 4.15] and thus is left to the reader.

The proof of Theorem 3.2 is given in Sects. 4 and 5. The ideas essentially follow those of [8], where an axiomatic approach of adaptivity for abstract problems is found. We note, however, that [8] only considers h-refinement, while the present formulation of Algorithm 3.1 steers both, the h-refinement and the knot multiplicity increase.

If Algorithm 3.1 is steered by the Faermann estimator

η2=zNη(z)2 3.8a

with the refinement indicators

η(z)2:=|f-VΦ|H1/2(ω(z))2for allzN, 3.8b

instead of μ, we can prove at least plain convergence of the estimator to zero. In contrast to the weighted-residual estimator which requires additional regularity fH1(Γ), the Faermann estimator η allows a right-hand side fH1/2(Γ). Moreover, η estimator is efficient and reliable

Ceff-1ηϕ-ΦH~-1/2(Γ)Crelη, 3.9

where Ceff>0 depends only on Γ, while Crel>0 depends additionally on p,κˇmax,wmin,wmax and γ; see [25, Theorem 3.1 and 4.4]. This equivalence of error and estimator puts some interest on the following convergence theorem which is, however, weaker than the statement of Theorem 3.2.

Theorem 3.4

Let fH1/2(Γ). We suppose that (M1) from Assumption 2.1 for the mesh-refinement holds. Then,  for each 0<θ1, Algorithm 3.1 steered by the Faermann estimator (3.8) is convergent in the sense of

η0. 3.10

According to (3.9),  this is equivalent to

ϕ-ΦH~-1/2(Γ)0. 3.11

Remark 3.5

The statements of Theorems 3.2 and 3.4 remain valid, if only adaptive h-refinement is used, i.e., if Algorithm 3.1 does not steer the knot multiplicity.

Proof of Theorem 3.2, linear convergence (3.5)

As an auxiliary result, we need an inverse-type estimate for NURBS with respect to the fractional H~-1/2(Γ)-norm. In the following, a result is stated and proved for the H~-σ(Γ)-norm, where 0<σ<1. For piecewise polynomials, an analogous result is already found in [30, Theorem 3.6] resp. [29, Theorem 3.9]. Our proof is inspired by [15, Section 4.3], where a similar result is found for piecewise constant functions as well as for piecewise affine and globally continuous functions in 1D. For integer-order Sobolev norms, inverse estimates for NURBS are found in [3, Section 4], and (4.2) is proved in [2, Theorem 3.1] for piecewise polynomials.

Proposition 4.1

Let [T][T] and 0<σ<1. Then,  there is a constant Cinv>0 such that

hσΨL2(Γ)CinvΨH~-σ(Γ)for allΨX. 4.1

For σ=1/2, it holds

h1/2Γ(VΨ)L2(Γ)+h1/2ΨL2(Γ)CinvΨH~-1/2(Γ)for allΨX. 4.2

The constant Cinv only depends on κˇmax,p,wmin,wmax, γ, and σ.

Proof

The proof is done in four steps. First, we show that hσψL2(Γ)ψH~-σ(Γ) holds for all ψL2(Γ) which satisfy a certain assumption. In the second step, we prove an auxiliary result for polynomials which is needed in the third one, where we show that all ψX satisfy the mentioned assumption. In the last step, we apply a recent result of [2], which then concludes the proof.

Step 1 Let XL2(Γ) satisfy the following assumption: There exists a constant q(0,1) such that for all TT and all ψX there exists some connected subset Δ(T,ψ)T of length |Δ(T,ψ)|q|T| such that ψ does not change its sign on Δ(T,ψ) and

minxΔ(T,ψ)|ψ(x)|qmaxxT|ψ(x)|. 4.3

Then, there exists a constant C>0 which depends only on q and κˇ, such that

hσψL2(Γ)CψH~-σ(Γ)for allψX.

For a compact nonempty interval [c,d]=I[a,b], we define the bubble function

PI(t):=t-cd-c·d-td-c2iftI,0ift[a,b]\I.

It obviously satisfies 0PI1 and suppPI=I. A standard scaling argument proves

C1|I|PIL2(I)2PIL1(I)C2|I| 4.4

and

|I|2PIL2(I)2C3PIL2(I)2 4.5

with generic constants C1,C2,C3>0 which do not depend on I. For each TT, let I(T,ψ) be some interval with γ(I(T,ψ))=Δ(T,ψ). With the arclength parametrization γL, we define, for all TT, the functions PΔ(T,ψ):=PI(T,ψ)γL and the coefficients

cT:=sgn(ψ|Δ(T,ψ))h,T2σminxΔ(T,ψ)|ψ(x)|. 4.6

Note that (4.4) and (4.5) hold for PΔ(T,ψ) with I simply replaced by Δ(T,ψ) and with (·) replaced by the arclength derivative Γ. By definition of the dual norm, it holds

ψH~-σ(Γ)|ψ;χ|χHσ(Γ)with, e.g.,χ:=TTcTPΔ(T,ψ)H1(Γ)Hσ(Γ). 4.7

First, we estimate the numerator in (4.7):

|ψ;χ|=TTTψ(x)cTPΔ(T,ψ)(x)dx=(4.6)TTh,T2σminxΔ(T,ψ)|ψ(x)|2PΔ(T,ψ)L1(Δ(T,ψ))(4.3)q2TTh,T2σmaxxT|ψ(x)|2PΔ(T,ψ)L1(Δ(T,ψ))(4.4)C1q3TTh,T2σψL2(T)2=C1q3hσψL2(Γ)2.

It remains to estimate the denominator in (4.7): We first note that it holds |u|Hσ(I)2|I|1-σuL2(I) for any interval IR of finite length and uH1(I). This is already stated in [7, Lemma 7.4]. However, a detailed proof is given only for 1/2<σ<1. For 0<σ1/2 this inequality can be shown exactly as in the proof of [24, Lemma 4.5], where only σ=1/2 is considered. This, together with (2.8), implies for any connected ωΓ with |ω|34|Γ| that

|u|Hσ(ω)|ω|1-σΓuL2(ω)for alluH1(Γ). 4.8

The hidden constant in (4.8) depends only on σ and Γ. Equation (4.8) is applicable for any node patch ω(z) since we assumed in Sect. 2.8 that h0|Γ|/4 if Γ=Ω With [18, Lemma 2.3], we hence see

|χ|Hσ(Γ)2[18]h-σχL2(Γ)2+zN|χ|Hσ(ωz)2(4.8)h-σχL2(Γ)2+zNh1-σΓχL2(ωz)2h-σχL2(Γ)2+TTh1-σΓχL2(Δ(T,ψ))2=h-σχL2(Γ)2+TTh,T2-2σcT2ΓPΔ(T,ψ)L2(Δ(T,ψ))2(4.5)h-σχL2(Γ)2+C3TTh,T2-2σcT2|Δ(T,ψ)|-2PΔ(T,ψ)L2(Δ(T,ψ))2h-σχL2(Γ)2.

This yields

χHσ(Γ)2=χL2(Γ)2+|χ|Hσ(Γ)2h-σχL2(Γ)2,

where the hidden constant depends only on κˇmax,σ, and γ. With

h-σχL2(Γ)2=TTh,T-2σcT2PΔ(T,ψ)L2(Δ(T,ψ))2(4.4)C2TTh,T-2σcT2|Δ(T,ψ)|=(4.6)C2TTh,T2σminxΔ(T,ψ)|ψ(x)|2|Δ(T,ψ)|C2TTh,T2σψL2(Δ(T,ψ))2C2hσψL2(Γ)2,

we finish the first step.

Step 2 For some fixed polynomial degree pN0, there exists a constant q1(0,1) such that for all polynomials F of degree p on [0, 1] there exists some interval I[0,1] of length |I|q1 with

mintI|F(t)|q1maxt[0,1]|F(t)|. 4.9

Instead of considering general polynomials Pp([0,1]) of degree p, it is sufficient to consider the following subset

M:={FPp([0,1]):F=1}.

Note that M is a compact subset of L([0,1]) and that differentiation (·) is a continuous mapping on M due to finite dimension. This especially implies boundedness supFMFC4<. We may assume C4>2. For given FM, we define the interval I as follows: Without loss of generality, we assume that the maximum of |F| is attained at some t1[0,1/2] and that F(t1)=1. We set t3:=t1+C4-1(t1,1] and t2:=t1+C4-1/2(t1,3/4] and I:=[t1,t2]. Then, |I|=1/(2C4) and for all tI it holds

1/2C4(t3-t)=F(t1)+C4(t1-t)F(t1)+F(t1-t)F(t)=|F(t)|.

Altogether, we thus have

q1:=1/(2C4)1/2mintI|F(t)|and|I|=q1

and conclude this step.

Step 3 We show that X satisfies the assumption of Step 1 and hence conclude hσΨL2(Γ)ΨH~-σ(Γ) for all ΨX: Let Tˇ[a,b] be the interval with γ(Tˇ)=T and ψˇ:=ψγ|Tˇ. Since |I||γ(I)| for any interval I[a,b], where the hidden constants depend only on γ, we just have to find a uniform constant q2(0,1) and some interval ITˇ of length |I|q2|Tˇ| with

mintI|ψˇ(t)|q2maxxTˇ|ψˇ(t)|. 4.10

The function ψˇ has the form F / w with a polynomial F of degree p and the weight function w, which is also a polynomial of degree p and which satisfies wminwwmax. Hence, (4.10) is especially satisfied if

mintI|F(t)|q1wmaxwminmaxxTˇ|F(t)|. 4.11

After scaling to the interval [0, 1], we can apply Step 2 and conclude this step. Altogether, this proves (4.1).

Step 4 According to [2], it holds h1/2Γ(Vψ)L2(Γ)h1/2ψL2(Γ)+ψH~-1/2(Γ) for all ψL2(Γ), where the hidden constant depends only on Γ, γ, and κˇmax. Together with Step 3, this shows (4.2).

The proof of linear convergence (3.5) will be done with the help of some auxiliary (and purely theoretical) error estimator ρ~. The latter relies on the following definition of an equivalent mesh-size function which respects the multiplicity of the knots.

Proposition 4.2

Assumption 2.1 (M1) implies the existence of a modified mesh-size function h~:[T]L(Γ) with the following properties :  There exists a constant Cwt>0 and 0<qctr<1 which depend only on κˇmax,p and γ such that for all [T][T] and all refinements [T+]ref([T]), the corresponding mesh-sizes h~:=h~([T]) and h~+:=h~([T+]) satisfy equivalence

Cwt-1hˇh~Cwthˇ, 4.12

reduction

h~+h~, 4.13

as well as contraction on the patch of refined elements

h~+|ω+([T+]\[T])qctrh~|ω+([T+]\[T]). 4.14

Note that ω+([T+]\[T])=ω([T]\[T+]), which follows from ([T+]\[T])=([T]\[T+]) and the fact that the application of ω+ resp. ω only adds elements of TT+.

Proof

For all [T]T, we define h~L(Γ) by

h~|T=|γ-1(ω(T))|·q1zNω(T)#zfor allTT,

where 0<q1<1 is fixed later. Clearly, h~hˇ, where the hidden equivalence constants depend only on κˇ, p, and q1. Let xΓ. First, suppose xω+([T+]\[T])N+, i.e., neither the element [T][T+] containing x nor its neighbors result from h-refinement or from multiplicity increase. Then, h~+(x)=h~(x). Second, suppose xω+([T+]\[T])\N+, i.e., the element [T][T+] containing x or one of its neighbors result from h-refinement and/or multiplicity increase. If only multiplicity increase took place, we get

q1zN+ω+(T)#zq1·q1zNω(T)#z.

In the other case, consider the father [T][T] of [T], i.e., TT. Note that

|γ-1(ω+(T))|q2|γ-1(ω(T))|

with a constant 0<q2<1 which depends only on κˇmax. Choose 0<q1<1 sufficiently large such that

q2/q14p<1.

This choice yields h~+(x)(q2/q14p)·h~(x), since Nω(T) contains at most 4 nodes. Therefore, we conclude the proof with qctr:=max(q1,q2/q14p).

Remark 4.3

Note that the construction of h~ in Proposition 4.2 even ensures contraction h~+|ω+(T)qctrh~|ω+(T) if [T][T+]\[T] is obtained by h-refinement, while the multiplicity of all nodes zN+ω+(T) is arbitrarily chosen #z{1,,p+1}. In explicit terms, this allows for instance to set the multiplicity of all nodes zN+ω+(T) to #z:=1, if T is obtained by h-refinement.

For any [T][T], we define the auxiliary estimator

ρ~2:=TTρ~2(T)withρ~2(T):=h~1/2Γ(f-VΦ)L2(T)2 4.15

which employs the novel mesh-size function h~ from Proposition 4.2. Obviously the estimators μ and ρ~ are locally equivalent

ρ~2(T)μ2(z)TTzTρ~2(T)for allzNandTTwithzT, 4.16

where the hidden constants depend only on κˇmax, p, and γ. The proof of the following lemma is inspired by [26, Proposition 3.2] resp. [8, Lemma 8.8], where only h-refinement is considered.

Lemma 4.4

(Estimator reduction of ρ~) Algorithm 3.1 guarantees

ρ~+12qestρ~2+CestΦ+1-ΦH~-1/2(Γ)2for all0. 4.17

The constants 0<qest<1 and Cest>0 depend only on κˇmax,p,wmin,wmax,γ, and θ.

Proof

The proof is done in several steps.

Step 1 With the inverse estimate (4.2), there holds the following stability property for any measurable Γ0Γ

h~+11/2Γ(f-VΦ+1)L2(Γ0)-h~+11/2Γ(f-VΦ)L2(Γ0)h~+11/2ΓV(Φ+1-Φ)L2(Γ0)CΦ+1-ΦH~-1/2(Γ),

with a constant C>0 which depends only on Cwt,Cinv, and γ.

Step 2 With Proposition 4.2, we split the estimator into a contracting and into a non-contracting part

ρ~+12=h~+11/2Γ(f-VΦ+1)L2(ω+1([T+1]\[T]))2+h~+11/2Γ(f-VΦ+1)L2(Γ\ω+1([T+1]\[T]))

Step 1, the Young inequality, and Proposition 4.2 show, for arbitrary δ>0, that

h~+11/2Γ(f-VΦ+1)L2(ω+1([T+1]\[T]))2(1+δ)h~+11/2Γ(f-VΦ)L2(ω+1([T+1]\[T]))2+(1+δ-1)C2Φ+1-ΦH~-1/2(Γ)2(1+δ)qctrh~1/2Γ(f-VΦ)L2(ω([T]\[T+1]))2+(1+δ-1)C2Φ+1-ΦH~-1/2(Γ)2.

Analogously, we get

h~+11/2Γ(f-VΦ+1)L2(Γ\ω+1([T+1]\[T]))2(1+δ)h~1/2Γ(f-VΦ)L2(Γ\ω([T]\[T+1]))2+(1+δ-1)C2Φ+1-ΦH~-1/2(Γ)2.

Combining these estimates, we end up with

ρ~+12(1+δ)ρ~2-(1+δ)(1-qctr)h~1/2Γ(f-VΦ)L2(ω([T]\[T+1]))2+2(1+δ-1)C2Φ+1-ΦH~-1/2(Γ)2. 4.18

Step 3 Local equivalence (4.16) and the Dörfler marking (3.3) for μ imply

θρ~2θμ2zMμ(z)2TTTω(M)ρ~(T)2,

where the hidden constants depend only on κˇmax, p, and γ. Hence, ρ~ satisfies some Dörfler marking with a certain parameter 0<θ~<1. With M([T]\[T+1]), (4.18) hence becomes

ρ~+12(1+δ)-(1+δ)(1-qctr)θ~ρ~2+2(1+δ-1)C2Φ+1-ΦH~-1/2(Γ)2.

By choosing δ sufficiently small, we prove (4.17) with Cest:=2(1+δ-1)C2 and qest:=(1+δ)(1-(1-qctr)θ~)<1.

Proof of linear convergence (3.5)

Due to the properties of the weakly-singular integral operator V, the bilinear form A(ϕ,ψ):=Vϕ;ψΓ defines even a scalar product, and the induced norm ψV:=A(ψ,ψ)1/2 is an equivalent norm on H~-1/2(Γ). According to nestedness of the ansatz spaces XX+1, the Galerkin orthogonality implies the Pythagoras theorem

ϕ-Φ+1V2+Φ+1-ΦV2=ϕ-ΦV2for allN0.

Together with the estimator reduction (4.17) and reliability (3.2)

ϕ-ΦVϕ-ΦH~-1/2(Γ)μρ~,

this implies the existence of 0<κ,λ<1, which depend only on Crel,Cest and qest, such that Δ:=ϕ-ΦV2+λρ~2ρ~2 satisfies

Δ+1κΔfor allN0;

see, e.g., [26, Theorem 4.1], while the original idea goes back to [10]. From this, we infer

μ+n2ρ~+n2Δ+nκnΔκnρ~2κnμ2for all,nN0

and hence conclude the proof.

Proof of Theorem 3.2, optimal convergence (3.7)

As in the previous section, we define an auxiliary error estimator. For each [T][T], let

ρ2:=TTρ(T)2withρ(T)2:=hˇ1/2Γ(f-VΦ)L2(T)2. 5.1

Note that the estimators μ and ρ are again locally equivalent

ρ2(T)μ2(z)TTzTρ2(T)for allzNandTTwithzT, 5.2

where the hidden constant depends only on κˇmax. Analogous versions of the next two lemmas are already proved in [26, Proposition 4.2 and 4.3] for h-refinement and piecewise constants; see also [8, Propostion 5.7] for discontinuous piecewise polynomials and h-refinement. The proof for Lemma 5.1 is essentially based on Proposition 4.1. The proof of Lemma 5.2 requires the construction of a Scott–Zhang type operator (5.9) which is not necessary in [8, 26], since both works consider discontinuous piecewise polynomials.

Lemma 5.1

(Stability of ρ) Let [T][T] and [T+]ref(T). For STT+ there holds

TSρ+(T)21/2-TSρ(T)21/2CstabΦ+-ΦH~-1/2(Γ), 5.3

where Cstab>0 depends only on the parametrization γ and the constant Cinv of Proposition 4.1.

Proof

For all subsets Γ0Γ, it holds

hˇ+1/2Γ(f-VΦ+)L2(Γ0)-hˇ+1/2Γ(f-VΦ)L2(Γ0)hˇ+1/2ΓV(Φ+-Φ)L2(Γ0)h+1/2ΓV(Φ+-Φ)L2(Γ0)CinvΦ+-ΦH~-1/2(Γ). 5.4

The choice Γ0=S shows stability

TSρ+(T)21/2-TSρ(T)21/2CinvΦ+-ΦH~-1/2(Γ),

and we conclude the proof.

Lemma 5.2

(Discrete reliability of ρ) There exist constants Crel,Cref>0, which depend only on κˇmax,p,wmin,wmax, and γ, such that for all refinements [T+]ref([T]) of [T][T] there exists a subset R(T+)T with

Φ+-ΦH~-1/2(Γ)2CrelTR(T+)ρ(T)2 5.5

as well as

([T]\[T+])R(T+)and|R(T+)|Cref|[T]\[T+]|. 5.6

For the proof of Lemma 5.2, we need to introduce a Scott–Zhang type operator. Let [T][T] and {Ri,p|[a,b:i=1-p,,N-p}γ|[a,b-1 be the basis of NURBS of X, where “” stands for “)” if Γ=Ω is closed and for “]” if ΓΩ is open. Here, N denotes the number of transformed knots Kˇ in (ab]. With the corresponding B-splines there holds Ri,p=wiBi,p/w, where w=ZwB,p is the fixed denominator satisfying wminwwmax; see Sect. 2.8. In [4, Section 2.1.5], it is shown that, for i{1-p,,N-p}, there exist dual basis functions Bi,pL2(suppBi,p) with

suppBi,pBi,p(t)Bj,p(t)dt=δij=1ifi=j,0else, 5.7

and

Bi,pL2(suppBi,p)(2p+3)9p|suppBi,p|-1/2. 5.8

Define Ri,p:=Bi,pw/wi with the denominator w from before, and R^i,p:=Ri,p|[a,bγ|[a,b-1. For I{1-p,,N-p}, we define the following Scott–Zhang type operator

P,I:L2(Γ)X:ψiIsuppRi,pRi,p(t)ψ(γ(t))dtR^i,p. 5.9

In [4, Section 3.1.2], a similar operator is considered for I={1-p,,N-p}, and [4, Proposition 2.2] proves an analogous version of the following lemma.

Lemma 5.3

The Scott–Zhang type operator (5.9) satisfies the following two properties : 

  • (i)

    Local projection property :  For TT with {i:TsuppR^i,p}I and ψL2(Γ), the inclusion ψ|ωp(T)X|ωp(T):={ξ|ωp(T):ξX} implies ψ|T=(P,Iψ)|T.

  • (ii)
    Local L2-stability :  For ψL2(Γ) and TT, there holds
    P,I(ψ)L2(T)CszψL2(ωp(T)),
    where Csz depends only on κˇmax,p,wmax, and γ.

Proof

All NURBS basis functions which are non-zero on T, have support in ωp(T). With this, (i) follows easily from the definition of P,I. For stability (ii), we use 0R^i,p1 and (5.8) to see

P,IψL2(T)=iIsuppRi,pRi,p(t)ψ(γ(t))dtR^i,pL2(T)iI|suppR^i,pT|>0suppRi,pRi,p(t)ψ(γ(t))dtR^i,pL2(T)iI|suppR^i,pT|>0Ri,pL2(suppRi,p)ψL2(suppR^i,p)h,T1/2(5.8)iI|suppR^i,pT|>0ψL2(suppR^i,p)ψL2(ωp(T)).

Overall, the hidden constants depend only on κˇmax,p,wmax, and γ.

Proof of Lemma 5.2

We choose

I:={i:|suppR^i,pΓ\ωp([T]\[T+])|>0}.

We prove that

P,I(Φ+-Φ)=Φ+-ΦonΓ\ωp([T]\[T+]),0on([T]\[T+]). 5.10

To see this, let TT with TΓ\ωp([T]\[T+])¯. Then, {i:TsuppR^i,p}I. It holds ωp(T)([T][T+]). This implies that no new knots are inserted in ωp(T). With Lemma 2.3(i), it follows X+|ωp(T)=X|ωp(T) and, in particular, (Φ+-Φ)|ωp(T)X|ωp(T). Hence Lemma 5.3(i) is applicable and proves P,I(Φ+-Φ)|T=(Φ+-Φ)|T. For TT with T([T]\[T+]), the assertion follows immediately from the definition of P,I, since R^i,p|T=0 for iI.

Let N~:={zN:zωp([T]\[T+])}. For zN~, let φz be the P1 hat function, i.e., φz(z)=δzz for all zN, supp(φz)=ω(z), and Γφz=const. on Tz,1 and Tz,2, where ω(z)=Tz,1Tz,2 with Tz,1,Tz,2T. Because of Galerkin orthogonality and zN~φz=1 on ωp([T]\[T+]), we see

Φ+-ΦV2=f-VΦ;(1-P,I)(Φ+-Φ)Γ=zN~φz(f-VΦ);(1-P,I)(Φ+-Φ)Γ.

We abbreviate Σ:=zN~φz(f-VΦ) and estimate with (M1), Lemma 5.3(ii) and Proposition 4.1

Σ;P,I(Φ+-Φ)h-1/2ΣL2(Γ)h1/2P,I(Φ+-Φ)L2(Γ)=(5.10)h-1/2ΣL2(Γ)h+1/2P,I(Φ+-Φ)L2(([T][T+]))Lem.5.3h-1/2ΣL2(Γ)h+1/2(Φ+-Φ)L2(ωp([T][T+]))Prop.4.1h-1/2ΣL2(Γ)Φ+-ΦV,

as well as

Σ;Φ+-ΦΣH1/2(Γ)Φ+-ΦH~-1/2(Γ)ΣH1/2(Γ)Φ+-ΦV.

So far, we thus have proved

Φ+-ΦVh-1/2ΣL2(Γ)+ΣH1/2(Γ)h-1/2(f-VΦ)L2(ωp+1([T]\[T+]))+ΣH1/2(Γ). 5.11

Next, we use [25, Lemma 3.4], [24, Lemma 4.5], and |Γφz||ω(z)|-1 to estimate

ΣH1/2(Γ)2[25]zN|Σ|H1/2(ω(z))2+h-1/2ΣL2(Γ)2[24]zNh1/2ΓΣL2(ω(z))2+h-1/2ΣL2(Γ)2h1/2ΓΣL2(Γ)2+h-1/2ΣL2(Γ)2h1/2Γ(f-VΦ)zN~φzL2(Γ)2+h1/2(f-VΦ)zN~ΓφzL2(Γ)2+h-1/2ΣL2(Γ)2h1/2Γ(f-VΦ)L2(ωp+1([T]\[T+]))2+h-1/2(f-VΦ)L2(ωp+1([T]\[T+]))2. 5.12

It remains to consider the term h-1/2(f-VΦ)L2(ωp+1([T]\[T+])) of (5.11) and (5.12). It holds

h-1/2(f-VΦ)L2(ωp+1([T]\[T+]))2=TTTωp+1([T]\[T+])h-1/2(f-VΦ)L2(T)2. 5.13

For any TT, there is a function ψTX with connected support, Tsupp(ψT)ωp/2(T) and 1-ψTL2(supp(ψT))2q|supp(ψT)| with some q(0,1) which depends only on κˇmax,γ,p,wmin, and wmax; see [25, (A1)–(A2), Theorem 4.4]. We use some Poincaré inequality (see, e.g., [18, Lemma 2.5]) to see

f-VΦL2(suppψT)2|supp(ψT)|22Γ(f-VΦ)L2(supp(ψT))2+1|supp(ψT)|supp(ψT)(f-VΦ)(x)dx2. 5.14

The Galerkin orthogonality proves

supp(ψT)(f-VΦ)(x)dx2=supp(ψT)(f-VΦ)(x)(1-ψT(x))dx2f-VΦL2(supp(ψT))2q|supp(ψT)|.

Using (5.14), we therefore get

f-VΦL2(supp(ψT))2|supp(ψT)|22Γ(f-VΦ)L2(supp(ψT))2+qf-VΦL2(supp(ψT))2,

which implies

f-VΦL2(T)2h,T2Γ(f-VΦ)L2(ωp/2(T))2.

Hence, we are led to

h-1/2(f-VΦ)L2(ωp+1([T]\[T+]))2h1/2Γ(f-VΦ)L2(ωp/2+p+1([T]\[T+]))2.

With

R(T+):={TT:Tωp/2+p+1([T]\[T+])},

we therefore conclude the proof.

Since we use a different mesh-refinement strategy, we cannot directly cite the following lemma from [8]. However, we may essentially follow the proof of [8, Proposition 4.12] verbatim. Details are left to the reader.

Lemma 5.4

(Optimality of Dörfler marking) Define

θ¯opt:=(1+Cstab2Crel2)-1. 5.15

For all 0<θ¯<θ¯opt there is some 0<qopt<1 such that for all refinements [T+]ref([T]) of [T][T] the following implication holds true

ρ+2qoptρ2θ¯ρ2TR(T+)ρ(T)2. 5.16

The constant qopt depends only on θ¯ and the constants Cstab of Lemma 5.1 and Crel of Lemma 5.2.

The next lemma reads similarly as [8, Lemma 3.4]. Since we use a different mesh-refinement strategy and our estimator ρ does not satisfy the reduction axiom (A2), we cannot directly cite the result. However, the idea of the proof is the same. Indeed, one only needs a weaker version of the mentioned axiom.

Lemma 5.5

(Quasi-monotonicity of ρ) For all refinements [T+]ref([T]) of [T][T], there holds

ρ+2Cmonρ2, 5.17

where Cmon>0 depends only on the parametrisation γ and the constants Cinv of Proposition 4.1 and Crel of Lemma 5.2.

Proof

We split the estimator as follows

ρ+2=TT+\Tρ+(T)2+TTT+ρ+(T)2.

For the first sum, we use (5.4), (T+\T)=(T\T+), and hˇ+hˇ to estimate

TT+\Tρ+(T)2=hˇ+1/2Γ(f-VΦ+)L2((T+\T))2Φ+-ΦH~-1/2(Γ)+hˇ1/2Γ(f-VΦ)L2((T\T+))22Φ+-ΦH~-1/2(Γ)2+2TT\T+ρ(T)2

For the second sum, we use Lemma 5.1 to see

TTT+ρ+(T)22TTT+ρ(T)2+2Cstab2Φ-Φ+H~-1/2(Γ)2.

We end up with

ρ+2Φ+-ΦH~-1/2(Γ)2+ρ2.

Lemma 5.2 concludes the proof.

The optimality in Theorem 3.2 essentially follows from the following lemma. It was inspired by an analogous version from [8, Lemma 4.14].

Lemma 5.6

Suppose that ϕAs for some s>0. Then,  for all 0<θ¯<θ¯opt there exist constants C1,C2>0 such that for all meshes [T][T] there exists some refinement [T+]ref([T]) such that the corresponding set R(T+)T from Lemma 5.2 satisfies

|R(T+)|C1C21/sϕAs1/sρ-1/s, 5.18

and

θ¯ρ2TR(T+)ρ(T)2. 5.19

With the constants Crel,Cmon, and qopt from Lemmas 5.25.4 and 5.5, it holds C1=2Crel and C2=(Cmonqopt-1)1/2.

Proof

We set α:=Cmon-1qopt with the constants of Lemma 5.4 and Lemma 5.5, and δ2:=αρ2.

Step 1  There exists [Tδ][T] with

ρδδand|Kδ|-|K0|ϕAs1/sδ-1/s.

Let NN0 be minimal with (N+1)-sϕAsδ. If N=0, then ρ0ϕAsδ and we can choose [Tδ]=[T0]. If N>0, minimality of N implies N-sϕAs>δ or equivalently N<ϕAs1/sδ-1/s. We choose [Tδ][TN] such that

ρδ=min[T][TN]ρ.

By the definition of ϕAs, we see

ρδ(N+1)-sϕAsδ.

By the definition of [TN], we see

|Kδ|-|K0|N<ϕAs1/sδ-1/s.

Step 2 We consider the overlay [T+]:=[T][Tδ] of (M2). Quasi-monotonicity shows

ρ+2Cmonρδ2Cmonδ2=qoptρ2. 5.20

Step 3 Finally, the assumptions on the refinement strategy are used. The overlay estimate and Step 1 give

|K+|-|K|(|Kδ|+|K|-|K0|)-|K|=|Kδ|-|K0|ϕAs1/sδ-1/s.

Lemma 5.2 and (2.12) show

|R(T+)|Crel|[T]\[T+]|2Crel(|K+|-|K|).

Combining the last two estimates, we end up with

|R(T+)|2CrelϕAs1/sα-1/2sρ-1/s,

This proves (5.18) with C1=2Crel and C2=α-1/2. By (5.20) we can apply Lemma 5.4 and see (5.19).

So far, we have only considered the auxiliary estimator ρ. In particular, we did not use Algorithm 3.1, but only the refinement strategy ref(·) itself. For the proof of optimal convergence (3.7), we proceed similarly as in [8, Theorem 8.4 (ii)].

Proof of (3.7)

Due to (5.2), there is a constant C1 which depends only on κˇmax with μ2Cρ2 for all [T][T]. We set θopt:=θ¯opt/C and θ¯:=Cθ and suppose that θ is sufficiently small, namely, θ<θopt and hence θ¯<θ¯opt. Let N0 and j. Choose a refinement [T+] of [Tj] as in Lemma 5.6. In particular, the set Rj(T+) satisfies the Dörfler marking (5.20). According to (5.2), this implies

θμj2θ¯ρj2TRj(T+)ρj(T)2zNjRj(T+)μj(z)2,

i.e., the set NjRj(T+) satisfies the Dörfler marking (3.3) from Algorithm 3.1. Since the chosen set Mj of Algorithm 3.1 has essentially minimal cardinality, we see with (5.18) that

|Mj|Cmark|NjRj(T+)|2Cmark|Rj(T+)|2CmarkC1C21/sϕAs1/sρj-1/s

With the mesh-closure estimate of (M3), we get

|K|-|K0|Cmeshj=0-1|Mj|2CmarkCmeshC1C21/sϕAs1/sj=0-1ρj-1/s2CmarkCmeshC1C21/sC1/sϕAs1/sj=0-1μj-1/s.

Linear convergence (3.5) shows

μClinqlin-jμjfor allj=0,,.

Hence,

|K|-|K0|2CmarkCmeshC1C21/sC1/sϕAs1/sj=0-1μj-1/s2CmarkCmeshC1(C2ClinC)1/sϕAs1/sμ-1/sj=0-1(qlin1/s)-j(C2ClinC)1/s2CmarkCmeshC11-qlin1/sϕAs1/sμ-1/s.

This concludes the proof.

Proof of Theorem 3.4, plain convergence (3.10)

To prove convergence of Algorithm 3.1 driven by the Faermann estimators η, we apply an abstract result of [23, Section 2] which is recalled in the following: Let H be a Hilbert space with dual space H and V:HH be a linear elliptic operator and fH. Let (X(f))N0 be a sequence of finite dimensional nested subspaces of H, i.e., X(f)X+1(f), with Galerkin approximations Φ(f)X(f) for the equation Vϕ=f. Further, let (N(f))N0 be a sequence of arbitrary finite sets and

η(f):=η(f,N(f))withη(f,E):=zEη(f,z)21/2<for allEN(f)

some heuristical error estimator, where we only require η(f,z)0 for each zN(f). Let (M(f))N0 be a sequence of marked elements with M(f)N(f) which satisfies the Dörfler marking, i.e.,

θη(f)2η(f,M(f))2.

Additionally let

ρ~(f):=ρ~(f,N(f))withρ~(f,E):=zEρ~(f,z)21/2<for allEN(f)

be an auxiliary error estimator with local contributions ρ~(f,z)0. Then, there holds the following convergence result.

Lemma 6.1

Suppose that DH is a dense subset of H such that for all fD and all N0 there is a set R(f)M(f) such that the following assumptions (A1)–(A3) hold : 

  1. η(f) is a local lower bound of ρ~(f): There is a constant C1>0 such that
    η(f,M(f))C1ρ~(f,R(f))for allN0.
  2. ρ~(f) is contractive on R(f): There is a constant C2 such that for all N0,mN and all δ>0, it holds
    C2-1ρ~(f,R(f))2ρ~(f)2-11+δρ~+m(f)2+(1+δ-1)C2Φ+m(f)-Φ(f)H2.

In addition,  we suppose for all fH validity of : 

  • (A3)
    η is stable on M(f) with respect to f :  there is a constant C3>0 such that,  for all N0 and fH, it holds
    |η(f,M(f))-η(f,M(f))|C3f-fH.

Then,  there holds convergence limη=0 for all fH.

Proof of plain convergence (3.10)

We choose H=H~-1/2(Γ), H=H1/2(Γ), V the weakly-singular integral operator (1.1). Moreover, Algorithm 3.1 generates the transformed NURBS spaces X(f), the set of nodes N(f), the Faermann estimator η(f) and the set of marked nodes M(f). We use the mesh-size function h~ of Proposition 4.2 to define

ρ~(f,z):=h~1/2Γ(f-VΦ)L2(ω(z))for allzN, 6.1

if f is in the dense set D=H1(Γ). We aim to apply Lemma 6.1 and show in the following that (A1)–(A2) hold for all fH1(Γ) even with R(f)=M(f) and that (A3) holds for all fH1/2(Γ). Then, Lemma 6.1 shows convergence (3.10) of the Faermann estimator.

  1. Of Lemma 6.1 follows immediately from [24, Theorem 4.3], where the constant C1 depends only on κˇmax,p, and γ.

  2. Can be proved exactly as in [23, Section 2.4] as η is efficient (see [25, Theorem 3.1]) and has a semi-norm structure. The constant C3 depends only on Γ.

The only challenging part is the proof of (A2) for fixed fH1(Γ). We proceed similarly as in the proof of [23, Theorem 3.1]. In the following, we skip the dependence of f. The heart of the matter are the estimates h~+1qctrh~ on ω(M) and h~+1h~ on Γ, which follow from Proposition 4.2 and

M([T]\[T+1]).

This shows

h~-h~+mh~-h~+1(1-qctr)h~χω(M)for allN0andmN.

Hence, the estimator ρ~ satisfies

(1-qctr)ρ~(M)2/2(1-qctr)ω(M)h~|Γ(f-VΦ)|2dxΓh~|Γ(f-VΦ)|2-Γh~+m|Γ(f-VΦ)|2dx=h~1/2Γ(f-VΦ)L2(Γ)2-h~+m1/2Γ(f-VΦ)L2(Γ)2.

Here, the factor 1 / 2 on the left-hand side stems from the fact that each node patch consists (generically) of two elements. This fact also shows h~1/2Γ(f-VΦ)L2(Γ)2=ρ~2/2. The Young inequality (c+d)2(1+δ)c2+(1+δ-1)d2 for c,d0, together with the triangle inequality shows

(1-qctr)ρ~(M)2/2ρ~2/2-11+δρ~+m2/2+1+δ-11+δh~+m1/2ΓV(Φ-Φ+m)L2(Γ)2.

Finally, we use Proposition 4.1 and see

h~+m1/2ΓV(Φ-Φ+m)L2(Γ)C~invΦ-Φ+mH~-1/2(Γ).

with a constant C~inv>0 which depends only on Cinv and hh~. This yields

(1-qctr)ρ~(M)2/2ρ~2/2-11+δρ~+m2/2+1+δ-11+δC~inv2Φ-Φ+mH~-1/2(Γ)2.

and concludes the proof of (A2) with C2=max(11-qctr,2Cinv2).

Acknowledgments

Open access funding provided by [TU Wien (TUW)]. The authors acknowledge support through the Austrian Science Fund (FWF) under Grant P27005 Optimal adaptivity for BEM and FEM-BEM coupling, P29096 Optimal isogeometric boundary element methods and the FWF doctoral school Dissipation and Dispersion in Nonlinear PDEs funded under Grant W1245. Moreover, MF was supported by the Australian Research Council under grant number DP160101755.

Contributor Information

Michael Feischl, Email: m.feischl@unsw.edu.au.

Gregor Gantner, Email: gregor.gantner@tuwien.ac.at.

Alexander Haberl, Email: alexander.haberl@asc.tuwien.ac.at.

Dirk Praetorius, Email: dirk.praetorius@tuwien.ac.at.

References

  • 1.Aurada M, Feischl M, Führer T, Karkulik M, Praetorius D. Efficiency and optimality of some weighted-residual error estimator for adaptive 2D boundary element methods. Comput. Methods Appl. Math. 2013;13(3):305–332. doi: 10.1515/cmam-2013-0010. [DOI] [Google Scholar]
  • 2.Aurada, M., Feischl, M., Führer, T., Karkulik, M., Melenk, J.M., Praetorius, D.: Local inverse estimates for non-local boundary integral operators. Math. Comput. (2016) (accepted for publication), (preprint). arXiv:1504.04394
  • 3.Bazilevs Y, da Veiga LB, Cottrell JA, Hughes TJR, Sangalli G. Isogeometric analysis: approximation, stability and error estimates for h-refined meshes. Math. Mod. Methods Appl. Sci. 2006;16(07):1031–1090. doi: 10.1142/S0218202506001455. [DOI] [Google Scholar]
  • 4.Beirão da Veiga, L., Buffa, A., Sangalli, G., Vázquez, R.: Mathematical analysis of variational isogeometric methods. Acta Numer. 23, 157–287 (2014)
  • 5.Buffa, A., Giannelli, C.: Adaptive isogeometric methods with hierarchical splines: error estimator and convergence. Math. Models Meth. Appl. Sci. 26(1), 1–25 (2016)
  • 6.Carstensen C. An a posteriori error estimate for a first-kind integral equation. Math. Comput. 1997;66(217):139–155. doi: 10.1090/S0025-5718-97-00790-4. [DOI] [Google Scholar]
  • 7.Carstensen C, Faermann B. Mathematical foundation of a posteriori error estimates and adaptive mesh-refining algorithms for boundary integral equations of the first kind. Eng. Anal. Bound. Elem. 2001;25(7):497–509. doi: 10.1016/S0955-7997(01)00012-1. [DOI] [Google Scholar]
  • 8.Carstensen C, Feischl M, Page M, Praetorius D. Axioms of adaptivity. Comput. Math. Appl. 2014;67(6):1195–1253. doi: 10.1016/j.camwa.2013.12.003. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Cottrell JA, Hughes TJR, Bazilevs Y. Isogeometric Analysis: Toward Integration of CAD and FEA. Chichester: Wiley; 2009. [Google Scholar]
  • 10.Cascon JM, Kreuzer C, Nochetto RH, Siebert KG. Quasi-optimal convergence rate for an adaptive finite element method. SIAM J. Numer. Anal. 2008;46(5):2524–2550. doi: 10.1137/07069047X. [DOI] [Google Scholar]
  • 11.Carstensen C, Maischak M, Praetorius D, Stephan EP. Residual-based a posteriori error estimate for hypersingular equation on surfaces. Numer. Math. 2004;97(3):397–425. doi: 10.1007/s00211-003-0506-5. [DOI] [Google Scholar]
  • 12.Carstensen C, Maischak M, Stephan EP. A posteriori error estimate and h-adaptive algorithm on surfaces for Symm’s integral equation. Numer. Math. 2001;90(2):197–213. doi: 10.1007/s002110100287. [DOI] [Google Scholar]
  • 13.Carstensen C, Stephan EP. Adaptive boundary element methods for some first kind integral equations. SIAM J. Numer. Anal. 1996;33(6):2166–2183. doi: 10.1137/S0036142993253503. [DOI] [Google Scholar]
  • 14.de Boor C. B (asic)-spline basics. Madison: University of Wisconsin-Madison, Mathematics Research Center; 1986. [Google Scholar]
  • 15.Dahmen W, Faermann B, Graham IG, Hackbusch W, Sauter SA. Inverse inequalities on non-quasi-uniform meshes and application to the mortar element method. Math. Comput. 2004;73(247):1107–1138. doi: 10.1090/S0025-5718-03-01583-7. [DOI] [Google Scholar]
  • 16.Dörfel MR, Jüttler B, Simeon B. Adaptive isogeometric analysis by local h-refinement with T-splines. Comput. Methods Appl. Mech. Eng. 2010;199(5–8):264–275. doi: 10.1016/j.cma.2008.07.012. [DOI] [Google Scholar]
  • 17.Dörfler W. A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal. 1996;33(3):1106–1124. doi: 10.1137/0733054. [DOI] [Google Scholar]
  • 18.Faermann B. Localization of the Aronszajn–Slobodeckij norm and application to adaptive boundary element methods. I. The two-dimensional case. IMA J. Numer. Anal. 2000;20(2):203–234. doi: 10.1093/imanum/20.2.203. [DOI] [Google Scholar]
  • 19.Feischl M, Führer T, Heuer N, Karkulik M, Praetorius D. Adaptive boundary element methods: a posteriori error estimators, adaptivity, convergence, and implementation. Arch. Comput. Methods Eng. 2015;22:309–389. doi: 10.1007/s11831-014-9114-z. [DOI] [Google Scholar]
  • 20.Feischl M, Führer T, Karkulik M, Melenk JM, Praetorius D. Quasi-optimal convergence rates for adaptive boundary element methods with data approximation, part I: weakly-singular integral equation. Calcolo. 2014;51(4):531–562. doi: 10.1007/s10092-013-0100-x. [DOI] [Google Scholar]
  • 21.Feischl M, Führer T, Karkulik M, Melenk JM, Praetorius D. Quasi-optimal convergence rates for adaptive boundary element methods with data approximation, part II: hyper-singular integral equation. Electron. Trans. Numer. Anal. 2015;44:153–176. [Google Scholar]
  • 22.Feischl M, Führer T, Karkulik M, Praetorius D. ZZ-type a posteriori error estimators for adaptive boundary element methods on a curve. Eng. Anal. Bound. Elem. 2014;38:49–60. doi: 10.1016/j.enganabound.2013.10.008. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 23.Feischl M, Führer T, Mitscha-Eibl G, Praetorius D, Stephan EP. Convergence of adaptive BEM and adaptive FEM-BEM coupling for estimators without h-weighting factor. Comput. Methods Appl. Math. 2014;14(4):485–508. doi: 10.1515/cmam-2014-0019. [DOI] [Google Scholar]
  • 24.Feischl M, Gantner G, Haberl A, Praetorius D. Adaptive 2D IGA boundary element methods. Eng. Anal. Bound. Elem. 2016;62:141–153. doi: 10.1016/j.enganabound.2015.10.003. [DOI] [Google Scholar]
  • 25.Feischl M, Gantner G, Praetorius D. Reliable and efficient a posteriori error estimation for adaptive IGA boundary element methods for weakly-singular integral equations. Comput. Methods Appl. Mech. Eng. 2015;290:362–386. doi: 10.1016/j.cma.2015.03.013. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 26.Feischl M, Karkulik M, Melenk JM, Praetorius D. Quasi-optimal convergence rate for an adaptive boundary element method. SIAM J. Numer. Anal. 2013;51(2):1327–1348. doi: 10.1137/110842569. [DOI] [Google Scholar]
  • 27.Gantumur T. Adaptive boundary element methods with convergence rates. Numer. Math. 2013;124(3):471–516. doi: 10.1007/s00211-013-0524-x. [DOI] [Google Scholar]
  • 28.Gantner, G.: Isogeometric adaptive BEM. Master’s thesis, Vienna University of Technology (2014)
  • 29.Georgoulis E. Inverse-type estimates on hp-finite element spaces and applications. Math. Comput. 2008;77(261):201–219. doi: 10.1090/S0025-5718-07-02068-6. [DOI] [Google Scholar]
  • 30.Graham IG, Hackbusch W, Sauter SA. Finite elements on degenerate meshes: inverse-type inequalities and applications. IMA J. Numer. Anal. 2005;25(2):379–407. doi: 10.1093/imanum/drh017. [DOI] [Google Scholar]
  • 31.Heltai L, Arroyo M, DeSimone A. Nonsingular isogeometric boundary element method for Stokes flows in 3D. Comput. Methods Appl. Mech. Eng. 2014;268:514–539. doi: 10.1016/j.cma.2013.09.017. [DOI] [Google Scholar]
  • 32.Hughes TJR, Cottrell JA, Bazilevs Y. Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement. Comput. Methods Appl. Mech. Eng. 2005;194(39–41):4135–4195. doi: 10.1016/j.cma.2004.10.008. [DOI] [Google Scholar]
  • 33.Hsiao, G.C., Wendland, W.L.: Boundary Integral Equations. Applied Mathematical Sciences, vol. 164. Springer, Berlin (2008)
  • 34.McLean W. Strongly Elliptic Systems and Boundary Integral Equations. Cambridge: Cambridge University Press; 2000. [Google Scholar]
  • 35.Marussig B, Zechner J, Beer G, Fries T-P. Fast isogeometric boundary element method based on independent field approximation. Comput. Methods Appl. Math. 2015;284:458–488. [Google Scholar]
  • 36.Politis, C., Ginnis, A.I., Kaklis, P.D., Belibassakis, K., Feurer, C.: An isogeometric BEM for exterior potential-flow problems in the plane. In: 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling, pp. 349–354. ACM (2009)
  • 37.Peake MJ, Trevelyan J, Coates G. Extended isogeometric boundary element method (XIBEM) for two-dimensional Helmholtz problems. Comput. Methods Appl. Mech. Eng. 2013;259:93–102. doi: 10.1016/j.cma.2013.03.016. [DOI] [Google Scholar]
  • 38.Simpson RN, Bordas SPA, Trevelyan J, Rabczuk T. A two-dimensional isogeometric boundary element method for elastostatic analysis. Comput. Methods Appl. Mech. Eng. 2012;209(212):87–100. doi: 10.1016/j.cma.2011.08.008. [DOI] [Google Scholar]
  • 39.Sauter, S.A., Schwab, C.: Boundary Element Methods. Springer Series in Computational Mathematics, vol. 39. Springer, Berlin (2011). Translated and expanded from the 2004 German original
  • 40.Scott MA, Simpson RN, Evans JA, Lipton S, Bordas SPA, Hughes TJR, Sederberg TW. Isogeometric boundary element analysis using unstructured T-splines. Comput. Methods Appl. Mech. Eng. 2013;254:197–221. doi: 10.1016/j.cma.2012.11.001. [DOI] [Google Scholar]
  • 41.Steinbach, O.: Numerical Approximation Methods for Elliptic Boundary Value Problems. Springer, New York (2008). Translated from the 2003 German original
  • 42.Takahashi T, Matsumoto T. An application of fast multipole method to isogeometric boundary element method for Laplace equation in two dimensions. Eng. Anal. Bound. Elem. 2012;36(12):1766–1775. doi: 10.1016/j.enganabound.2012.06.004. [DOI] [Google Scholar]
  • 43.Vuong A-V, Giannelli C, Jüttler B, Simeon B. A hierarchical approach to adaptive local refinement in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 2011;200(49–52):3554–3567. doi: 10.1016/j.cma.2011.09.004. [DOI] [Google Scholar]
  • 44.Zechner, J., Marussig, B., Beer, G., Fries, T.-P.: Isogeometric boundary element method with hierarchical matrices (2014) (preprint). arXiv:1406.2817

Articles from Numerische Mathematik are provided here courtesy of Springer

RESOURCES