Javascript must be enabled to continue!
Robust approximation error estimates for analysis-suitable $G^1$ isogeometric multi-patch discretizations
View through CrossRef
We prove $p$-robust approximation error estimates for $H^2$-conforming isogeometric discretizations over planar multi-patch domains. Possible applications are fourth order boundary value problems, like the biharmonic equation or Kirchhoff–Love plates. Using Isogeometric Analysis, such conforming discretizations can be constructed effortlessly for the single-patch case. In order to obtain a globally $H^2$-conforming discretization in the multi-patch case, the functions must be $C^1$-smooth across the interfaces between the patches. To obtain optimal approximation properties, those $C^1$-smooth spaces must also reproduce splines of sufficiently high degree for traces and transversal derivatives at all patch interfaces. Such constructions are based on some assumptions on the geometry. We restrict ourselves to the class of analysis-suitable $G^1$ (AS-$G^1$) multi-patch domains, which is the subset of $C^0$-matching multi-patch domains that allows the definition of spline spaces that yield the necessary reproduction properties without the need to locally increase the degree. While approximation error estimates have been established for single-patch and $C^0$ isogeometric multi-patch spaces, corresponding results for the $C^1$ multi-patch setting have been missing. The resulting bounds on the approximation error depend on the geometry parameterization and on the Sobolev regularity of the target function, but are independent of the spline degree $p$.
Title: Robust approximation error estimates for analysis-suitable $G^1$ isogeometric multi-patch discretizations
Description:
We prove $p$-robust approximation error estimates for $H^2$-conforming isogeometric discretizations over planar multi-patch domains.
Possible applications are fourth order boundary value problems, like the biharmonic equation or Kirchhoff–Love plates.
Using Isogeometric Analysis, such conforming discretizations can be constructed effortlessly for the single-patch case.
In order to obtain a globally $H^2$-conforming discretization in the multi-patch case, the functions must be $C^1$-smooth across the interfaces between the patches.
To obtain optimal approximation properties, those $C^1$-smooth spaces must also reproduce splines of sufficiently high degree for traces and transversal derivatives at all patch interfaces.
Such constructions are based on some assumptions on the geometry.
We restrict ourselves to the class of analysis-suitable $G^1$ (AS-$G^1$) multi-patch domains, which is the subset of $C^0$-matching multi-patch domains that allows the definition of spline spaces that yield the necessary reproduction properties without the need to locally increase the degree.
While approximation error estimates have been established for single-patch and $C^0$ isogeometric multi-patch spaces, corresponding results for the $C^1$ multi-patch setting have been missing.
The resulting bounds on the approximation error depend on the geometry parameterization and on the Sobolev regularity of the target function, but are independent of the spline degree $p$.
Related Results
Novel uncertainty quantification methods for stochastic isogeometric analysis
Novel uncertainty quantification methods for stochastic isogeometric analysis
The main objective of this study is to develop novel computational methods for general high-dimensional uncertainty quantification (UQ) with a focus on stochastic isogeometric anal...
The impact of patch encounter rate on patch residence time of female parasitoids increases with patch quality
The impact of patch encounter rate on patch residence time of female parasitoids increases with patch quality
Abstract
1. For animal species that forage on patchily distributed resources, patch time allocation is of prime importance to their reproductive success. Accord...
The Feasibility of National Inference Under the NSCAW IV L-State Sample Design
The Feasibility of National Inference Under the NSCAW IV L-State Sample Design
The purpose of this Feasibility Analysis Study (FAS) was to evaluate methods for producing valid national estimates under the National Survey of Child and Adolescent Well-being (NS...
Refining intra-patch connectivity measures in landscape fragmentation and connectivity indices
Refining intra-patch connectivity measures in landscape fragmentation and connectivity indices
Abstract
Context. Measuring intra-patch connectivity, i.e. the connectivity within a habitat patch, is important to evaluate landscape fragmentation and connectivity. Howev...
Reducing Computational Complexity in Vision Transformers Using Patch Slimming
Reducing Computational Complexity in Vision Transformers Using Patch Slimming
Vision Transformers (ViTs) have emerged as a dominant class of deep learning models for image recognition tasks, demonstrating superior performance compared to traditional Convolut...
Learning Theory and Approximation
Learning Theory and Approximation
The workshop
Learning Theory and Approximation
, organised by Kurt Jetter (Stuttgart-Hohenheim), Steve Smale (Berkeley) and Ding-Xuan Zhou (...
Rigless Well Intervention Using Tubing Patch Technology Helps Restore Inactive Wells
Rigless Well Intervention Using Tubing Patch Technology Helps Restore Inactive Wells
Abstract
This paper provides in-depth analysis of a low-cost solution to economically sustain production and avoid high workover costs. This paper conducts the techn...
Water Isolation and Sand Control: Breaking Barriers with Expandable Steel Patch Technology
Water Isolation and Sand Control: Breaking Barriers with Expandable Steel Patch Technology
Abstract
This paper describes the design, planning, and successful installation of a fit-for-purpose casing patch to isolate a water producing zone, the subsequent p...

