The problem of developing an adaptive isogeometric method (AIGM) for solving elliptic second-order partial differential equations with truncated hierarchical B-splines of arbitrary degree and different order of continuity is addressed. The adaptivity analysis holds in any space dimensions. We consider a simple residual-type error estimator for which we provide a posteriori upper and lower bound in terms of local error indicators, taking also into account the critical role of oscillations as in a standard adaptive finite element setting. The error estimates are properly combined with a simple marking strategy to define a sequence of admissible locally refined meshes and corresponding approximate solutions. The design of a refine module that preserves the admissibility of the hierarchical mesh configuration between two consectutive steps of the adaptive loop is presented. The contraction property of the quasi-error, given by the sum of the energy error and the scaled error estimator, leads to the convergence proof of the AIGM.
The design of globally $C^s$-smooth ($s \geq 1$) isogeometric spline spaces over multi-patch geometries is a current and challenging topic of research in the framework of isogeometric analysis. In this work, we extend the recent methods [25,28] and [31-33] for the construction of $C^1$-smooth and $C^2$-smooth isogeometric spline spaces over particular planar multi-patch geometries to the case of $C^s$-smooth isogeometric multi-patch spline spaces of an arbitrary selected smoothness $s \geq 1$. More precisely, for any $s \geq 1$, we study the space of $C^s$-smooth isogeometric spline functions …
We study the space of $C^1$ isogeometric spline functions defined on trilinearly parameterized multi-patch volumes. Amongst others, we present a general framework for the design of the $C^1$ isogeometric spline space and of an associated basis, which is based on the two-patch construction [7], and which works uniformly for any possible multi-patch configuration. The presented method is demonstrated in more detail on the basis of a particular subclass of trilinear multi-patch volumes, namely for the class of trilinearly parameterized multi-patch volumes with exactly one inner edge. For this spe…
We formulate and analyze an adaptive algorithm for isogeometric analysis with hierarchical B-splines for weakly-singular boundary integral equations. We prove that the employed weighted-residual error estimator is reliable and converges at optimal algebraic rate. Numerical experiments with isogeometric boundary elements for the 3D Poisson problem confirm the theoretical results, which also cover general elliptic systems like linear elasticity.
Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well suited for the representation of complex geometries, and to maintain high continuity on general domains special constructions on multi-patch geometries must be used. In this paper we focus on adaptive isogeometric methods with hierarchical splines, and extend the construction of $C^1$ isogeometric spline spaces on multi-patch planar domains to…
In this paper we provide a priori error estimates with explicit constants for both the $L^2$-projection and the Ritz projection onto spline spaces of arbitrary smoothness defined on arbitrary grids. This extends the results recently obtained for spline spaces of maximal smoothness. The presented error estimates are in agreement with the numerical evidence found in the literature that smoother spline spaces exhibit a better approximation behavior per degree of freedom, even for low smoothness of the functions to be approximated. First we introduce results for univariate spline spaces, and then …
We present the construction of additive multilevel preconditioners, also known as BPX preconditioners, for the solution of the linear system arising in isogeometric adaptive schemes with (truncated) hierarchical B-splines. We show that the locality of hierarchical spline functions, naturally defined on a multilevel structure, can be suitably exploited to design and analyze efficient multilevel decompositions. By obtaining smaller subspaces with respect to standard tensor-product B-splines, the computational effort on each level is reduced. We prove that, for suitably graded hierarchical meshes…
Tchebycheffian splines are smooth piecewise functions whose pieces are drawn from (possibly different) Tchebycheff spaces, a natural generalization of algebraic polynomial spaces. They enjoy most of the properties known in the polynomial spline case. In particular, under suitable assumptions, Tchebycheffian splines admit a representation in terms of basis functions, called Tchebycheffian B-splines (TB-splines), completely analogous to polynomial B-splines. A particularly interesting subclass consists of Tchebycheffian splines with pieces belonging to null-spaces of constant-coefficient linear …
Brigham Young University（杨百翰大学）；Coreform LLC（Coreform有限责任公司）；Technische Universität Kaiserslautern（凯泽斯劳滕工业大学）；Istituto di Matematica Applicata e Tecnologie Informatiche del CNR（意大利国家研究委员会应用数学与信息技术研究所）
Bézier projection: a unified approach for local projection and quadrature-free refinement and coarsening of NURBS and T-splines with particular application to isogeometric design and analysis
Brigham Young University（杨百翰大学）；University of Colorado, Boulder（科罗拉多大学博尔德分校）
Adaptive isogeometric methods for the solution of partial differential equations rely on the construction of locally refinable spline spaces. A simple and efficient way to obtain these spaces is to apply the multi-level construction of hierarchical splines, that can be used on single-patch domains or in multi-patch domains with $C^0$ continuity across the patch interfaces. Due to the benefits of higher continuity in isogeometric methods, recent works investigated the construction of spline spaces with global $C^1$ continuity on two or more patches. In this paper, we show how these approaches c…
We propose and analyze optimal additive multilevel solvers for isogeometric discretizations of scalar elliptic problems for locally refined T-meshes. Applying the refinement strategy in Morgenstern and Peterseim (2015, Comput. Aided Geom. Design, 34, 50-66) we can guarantee that the obtained T-meshes have a multilevel structure, and that the associated T-splines are analysis-suitable, for which we can define a dual basis and a stable projector. Taking advantage of the multilevel structure, we develop two BPX preconditioners: the first on the basis of local smoothing only for the functions affe…
Adaptive isogeometric analysis with hierarchical box splines
Istituto Nazionale di Alta Matematica, Unità di Ricerca di Firenze c/o DiMaI “U. Dini”, Università di Firenze（意大利高等数学研究所佛罗伦萨研究单元）；Dipartimento di Matematica e Informatica “U. Dini”, Università degli Studi di Firenze（佛罗伦萨大学数学与信息学系）；Dipartimento di Matematica, Università degli Studi di Roma “Tor Vergata”（罗马托维加塔大学数学系）
This paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an eXtended Finite Element Method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements…
We show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly speaking, these optimal subspaces are obtained from the full spline space defined on certain uniform knot sequences by imposing specific additional boundary conditions. The spline subspaces of interest have been introduced in the literature some years ago when proving their optimality with respect to Kolmogorov $n$-widths in $L^2$-norm for some function classes. The…
Weakening the tight coupling between geometry and simulation in isogeometric analysis: from sub- and super- geometric analysis to Geometry Independent Field approximaTion (GIFT)
University of Chile（智利大学）；Hangzhou Dianzi University（杭州电子科技大学）；Institute of Computational Engineering, University of Luxembourg（卢森堡大学计算工程研究所）；School of Engineering, Cardiff University（卡迪夫大学工程学院）
An isogeometric boundary element method for electromagnetic scattering with compatible B-spline discretizations
University of Glasgow（格拉斯哥大学）；École Polytechnique Fédérale de Lausanne（洛桑联邦理工学院）；Istituto di Matematica Applicata e Tecnologie Informatiche “E. Magenes” del CNR（CNR应用数学与信息技术研究所“E. Magenes”）；University of Colorado Boulder（科罗拉多大学博尔德分校）
Adaptive isogeometric phase-field modeling of the Cahn-Hilliard equation: Suitably graded hierarchical refinement and coarsening on multi-patch geometries
We define a conforming B-spline discretisation of the de Rham complex on multipatch geometries. We introduce and analyse the properties of interpolation operators onto these spaces which commute w.r.t. the surface differential operators. Using these results as a basis, we derive new convergence results of optimal order w.r.t. the respective energy spaces and provide approximation properties of the spline discretisations of trace spaces for application in the theory of isogeometric boundary element methods. Our analysis allows for a straightforward generalisation to finite element methods.
Suitably graded THB-spline refinement and coarsening: Towards an adaptive isogeometric analysis of additive manufacturing processes
University of Pavia（帕维亚大学）；Technische Universität München（慕尼黑工业大学）；Università degli Studi di Firenze（佛罗伦萨大学）；Ecole Polytechnique Fédérale de Lausanne（洛桑联邦理工学院）；Istituto di Matematica Applicata e Tecnologie Informatiche “E. Magenes” del CNR（意大利国家研究委员会应用数学与信息技术研究所）
In this paper, we report the use of rational Triangular Bezier Splines (rTBS) to numerically solve the von Karman equations, a system of fourth order PDEs. $C^{1}$ smoothness of the mesh, generated by triangular Bezier elements, enables us to directly solve the von Karman systems of equations without using mixed formulation. Numerical results of benchmark problems show high accuracy and optimal convergence rate in L1, H1 and H2 norm for quadratic and cubic triangular Bezier elements. Results of this study show that triangular isogeometric analysis can efficiently and accurately solve systems o…
The perfectly matched layer (PML) formulation is a prominent way of handling radiation problems in unbounded domain and has gained interest due to its simple implementation in finite element codes. However, its simplicity can be advanced further using the isogeometric framework. This work presents a spline based PML formulation which avoids additional coordinate transformation as the formulation is based on the same space in which the numerical solution is sought. The procedure can be automated for any convex artificial boundary. This removes restrictions on the domain construction using PML a…
To exploit the advantageous properties of isogeometric analysis (IGA) in a scan-based setting, it is important to extract a smooth geometric domain from the scan data (e.g., voxel data). IGA-suitable domains can be constructed by convoluting the grayscale data using B-splines. A negative side-effect of this convolution technique is, however, that it can induce topological changes in the process of smoothing when features with a size similar to that of the voxels are encountered. This manuscript presents an enhanced B-spline-based segmentation procedure using a refinement strategy based on trun…
In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit the tensor product structure at the patch level. To this purpose, we extend to the isogeometric framework the so-called All-Floating variant of FETI, that allows us to use the Fast Diagonalization method at the patch level. We construct then a preconditioner for the whole system and prove its robustness with respect to the local mesh-size $h$ and patch-size…
In this paper we use the Isogeometric method to solve the Helmholtz equation with nonhomogeneous Dirichlet boundary condition over a bounded physical domain. Starting from the variational formulation of the problem, we show with details how to apply the isogeometric approach to obtain an approximation of the solution using biquadratic B-spline functions. To illustrate the power of the method we solve several difficult problems, which are particular cases of the Helmholtz equation, where the solution has discontinuous gradient in some points, or it is highly oscillatory. For these problems we e…
This work focuses on the development of a posteriori error estimates for fourth-order, elliptic, partial differential equations. In particular, we propose a novel algorithm to steer an adaptive simulation in the context of Kirchhoff plates and Kirchhoff-Love shells by exploiting the local refinement capabilities of hierarchical B-splines. The method is based on the solution of an auxiliary residual-like variational problem, formulated by means of a space of localized spline functions. This space is characterized by $C^1$ continuous B-splines with compact support on each active element of the h…
