Guaranteed and Sharp a Posteriori Error Estimates in Isogeometric Analysis

Guaranteed and Sharp a Posteriori Error Estimates
in Isogeometric Analysis

Stefan K. Kleiss Johannes Kepler University, Altenberger Strasse 69, A-4040 Linz, Austria stefan.kleiss@jku.at \ and\ Satyendra K. Tomar Dornacher Strasse 6/21, A-4040 Linz, Austria [
September 8, 2014,  (First version April 21, 2013)
Abstract.

We present functional-type a posteriori error estimates in isogeometric analysis. These estimates, derived on functional grounds, provide guaranteed and sharp upper bounds of the exact error in the energy norm. Moreover, since these estimates do not contain any unknown/generic constants, they are fully computable, and thus provide quantitative information on the error. By exploiting the properties of non-uniform rational B-splines, we present efficient computation of these error estimates. The numerical realization and the quality of the computed error distribution are addressed. The potential and the limitations of the proposed approach are illustrated using several computational examples.

Key words and phrases:
Isogeometric analysis; B-splines and NURBS; A posteriori error estimates
1991 Mathematics Subject Classification:
65N15, 65N30
This work was started when both the authors were employed in RICAM, Altenberger Strasse 69, A-4040 Linz, Austria.

Corresponding author]tomar.sk.prof@gmail.com

1. Introduction

The geometry representations in finite element methods (FEM) and computer aided design (CAD) have been developed independent of each other, and are optimized for the purposes within their respective fields. As a consequence, the representations are different from each other, and a transfer of geometry information from CAD to FEM programmes (and vice versa) requires a transformation of geometry data. These transformations are, in general, not only costly, but also prone to approximation errors, and may require manual input.

Isogeometric analysis (IGA), introduced by Hughes et al. [Hughes05_4135], see also [Coott09_IGA], aims at closing this gap between FEM and CAD. The key observation is that it is a widespread standard in CAD to use geometry representations based on non-uniform rational B-splines (NURBS), and that these NURBS basis functions have properties which make them suitable as basis functions for FEM. Instead of transforming the geometry data to a conventional FEM representation, the original geometry description is used directly, and the underlying NURBS functions are used as basis for the discrete solution. This way, the geometry is represented exactly in the sense that the geometry obtained from CAD is not changed. Thus, the need for data transformation is eliminated, and furthermore, the exact representation from the coarsest mesh is preserved throughout the refinement process. IGA has been thoroughly studied and analyzed (see, e.g., [Bazi06_1031, Beirao05_271, Cott07_4160, Hughes10_301, Takacs11_3568]), and its potential has been shown by successful applications to a wide range of problems (see, e.g., [Bazi07_173, Bazi08_3, Buffa10_1143, Elgu08_33, Niel2011_3242]).

As mentioned above, the most widely used spline representations in CAD are based on NURBS. The straightforward definition of NURBS basis functions leads to a tensor-product structure of the basis functions, and thus of the discretization. Since naive mesh refinement in a tensor-product setting has global effects, the development of local refinement strategies for isogeometric analysis is a subject of current active research. Such local refinement techniques include, for example, T-splines [Bazi10_229, LiEtAl12_63, Scott11_126, Scott12_206, Sede04_276], truncated hierarchical B-splines (THB-splines) [Giannelli2012_485, GiannelliJS-14], polynomial splines over hierarchical T-meshes (PHT-splines) [Deng2008_76, Wang11_1438], and locally-refineable splines (LR-splines) [Dokken2013_331, JohannessenKD-14].

The issue of adaptive, local refinement is closely linked to the question of efficient a posteriori error estimation (see, e.g., [Ains00_book, Repin08_book] for a general overview on error estimators). In the light of adaptive refinement, an error estimator has to identify the areas where further refinement is needed due to the local error being significantly larger than in the rest of the domain. Hence, an accurate indication of the error distribution is essential. Another important objective in computing a posteriori error estimates is to address the quality assurance, i.e., to quantify the error in the computed solution with certain degree of guarantee. However, a posteriori error estimation in isogeometric analysis is still in an infancy stage. To the best of the authors’ knowledge, the only published results are [DedeS-12, Doerfel10_264, Johannessen11, KuruVZB-14, Vuong11_3554, Wang11_1438, Xu11_2021, XuMDG-13, ZeeV-11].

A posteriori error estimates based on hierarchical bases, proposed by Bank and Smith [BankSmith_93], have been used in [Doerfel10_264, Vuong11_3554]. The reliability and efficiency of this approach is subjected to the saturation assumption on the (enlarged) underlying space and the constants in the strengthened Cauchy inequality. As the authors remarked, the first assumption is critical and its validity depends on the considered example. Moreover, an accurate estimation of constants in the strengthened Cauchy inequality requires the solution of generalized minimum eigenvalue problem. As noted in [Johannessen11, Page 41], this approach delivers less than satisfactory results.

Residual-based a posteriori error estimates have been used in [Johannessen11, Wang11_1438, Xu11_2021, XuMDG-13]. This approach requires the computation of constants in Clement-type interpolation operators. Such constants are mesh (element) dependent, often generic/unknown or incomputable for general element shape; and the global constant often over-estimates the local constants, and thus the exact error. This fact has been explicitly stated by the authors in [Johannessen11, Pages 42-43] and in [Wang11_1438, Remark 1].

Goal-oriented error estimation approach has been studied in [DedeS-12, KuruVZB-14, ZeeV-11]. The results presented in these studies show that neither the estimates of this approach are guaranteed to be an upper bound, nor the efficiency indices of the estimates are sharp. Moreover, this approach also requires the solution of an adjoint problem, the cost of which can not be entirely neglected.

The approach of Zienkiewicz-Zhu type a posteriori error estimates is based on post-processing of approximate solutions, and depend on the superconvergence properties of the underlying basis. To the best of authors’ knowledge, superconvergence properties for B-splines (NURBS) functions are not yet known.

Summarily, in general situations, the reliability and efficiency of these methods often depend on undetermined constants, which is not suitable for quality assurance purposes. In this paper, we present functional-type a posteriori error estimates for isogeometric discretizations. These error estimates, which were introduced in [Repin97_201, Repin99_4311, Repin00_481] and have been studied for various fields (see [Repin08_book] and the references therein), provide guaranteed, sharp and fully computable bounds (without any generic undetermined constants). These estimates are derived on purely functional grounds (based on integral identities or functional analysis) and are thus applicable to any conforming approximation in the respective space. For elliptic problems with the weak solution , these error bounds involve computing an auxiliary function . In order to get a sharp estimate, this function is computed by solving a global problem. This could be perceived as a drawback when compared to error estimation techniques which rely on local computations and are thus apparently cheaper. However, as briefly explained above, our emphasis is not only on adaptivity, but also on quantifying the error in the computed solution (and thus guaranteeing the quality of the computed solution). Therefore, the associated cost should be weighed against the stated objectives. To the best of authors’ knowledge, there is no other, particularly cheaper, method available which can fulfill these objectives in general situations. In this paper, we will elaborate how such estimates can be computed efficiently by a proper set-up of the global problem.

Two aspects motivate the application of functional-type error estimates in IGA. Firstly, unlike the standard Lagrange basis functions, NURBS basis functions of degree are, in general, globally -continuous. Hence, NURBS basis functions of degree are, in general, at least -continuous, and therefore, their gradients are automatically in . Thereby, we avoid constructing complicated functions in , in particular for higher degrees (see, e.g., [Buffa11_1407, BuffaEtAl11_818, EvaEtAl13_671]). Secondly, since the considered problem is solved in an isogeometric setting, an efficient implementation of NURBS basis functions is readily available, which can be used to construct the above mentioned function . Hence, applying the technique of functional-type a posteriori error estimation in a setting that relies only on the use of already available NURBS basis functions is greatly appealing.

The remainder of this paper is organized as follows. In Section 2, we define the model problem, and recall the definition and some important properties of B-spline and NURBS basis functions. In Section LABEL:sec_FuncEE, we first recall functional-type a posteriori error estimates and known implementation issues. Then, we derive a quality criterion and the local error indicator. In Section LABEL:sec_effcomp, we discuss a cost-efficient realization of the proposed error estimator using an illustrative numerical example. Further numerical examples are presented in Section LABEL:sec_numex, and finally, conclusions are drawn in Section LABEL:sec_Conc.

2. Preliminaries

In order to fix notation and to provide an overview, we define the model problem and recall the definition and some aspects of isogeometric analysis in this section.

2.1. Model Problem

Let be an open, bounded and connected Lipschitz domain with boundary . We shall consider the following model problem:

Find the scalar function such that

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
33860
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description