This paper combines the polar spline construction with hierarchical splines to obtain adaptively-refinable polar splines, and shows how to construct hierarchical polar spline $k$-form spaces, proves that the corresponding basis functions are linearly independent, and proves that they form a cohomologically-correct discrete de Rham complex.
Abstract
A common approach to representing disk-like and sphere-like geometries in isogeometric analysis is to use collapsed-edge singularities in the underlying parameterization. The resulting tensor-product B-spline spaces on such singular parameterizations lack the required smoothness to be used in isogeometric analysis. Polar splines (Toshniwal et al., CMAME 2017) rectify this issue by extracting a smoother subspace, and have been successfully used to discretize high-order partial differential equations, as well as to perform structure-preserving discretizations of the de Rham complex.The latter is particularly relevant for mixed formulations that appear in applications such as electromagnetism and fluid dynamics. The main contributions of this paper are twofold. We combine the polar spline construction with hierarchical splines to obtain adaptively-refinable polar splines. Moreover, we do so in the context of structure-preserving methods. That is, we show how to construct hierarchical polar spline $k$-form spaces, prove that the corresponding basis functions are linearly independent, and prove that they form a cohomologically-correct discrete de Rham complex. These contributions provide a mathematically sound foundation for adaptive structure-preserving simulations on polar geometries. We also provide numerical experiments that validate the theory and illustrate the practical behavior of the construction with problems where preserving the structure is mandatory. These include a study of spurious harmonics that highlights how cohomology-breaking refinements differ between the polar and tensor-product settings, a discretization of a Maxwell eigenvalue problem on a locally-refined polar mesh, and an adaptive convergence study for a Hodge--Laplace problem.
This paper is the first in a three-part series on the construction of polynomial splines with the highest order of smoothness over hierarchical T-meshes, referred to as $\PHtwoT$-splines. For splines of bi-degree $(d,d)$, we study suitable refinement conditions for the subsequent basis construction, which requires dime...
Numerical experiments show that the projection-based low-rank approach for assembling the mass and stiffness tensors of orientation-preserving tensor-product B-spline geometries is competitive with full assembly and with the interpolation-based low-rank method, and that it applies in two situations in which interpolati...
In this work, we propose and analyze low-order nonconforming face-based finite element methods for elliptic problems on complex hybrid three-dimensional meshes, composed of arbitrary polytopal cells.
The focus is on scalar problems, but the approach can be extended in a tensor manner to design generalizations of the cl...
A. Brunel, J. Latché· ESAIM: Mathematical Modellin...· 0 citations
We propose a novel unfitted finite element method based on polynomial splines over hierarchical T-meshes (PHT-splines) for elliptic partial differential equations (PDEs) posed on domains whose boundaries are described implicitly by a level-set function. Exploiting the enhanced smoothness of the spline space, we formula...
The present paper proposes a novel B-spline-based space-fractional finite element formulation for analyzing three-dimensional scale-sensitive truss structures. The formulation is developed within the framework of space-fractional continuum mechanics, which generalizes the classical local theory by incorporating spati...
Paulina Stempin, Wojciech Sumelka· Computational Mechanics· 0 citations
We present a unified treatment of the data-fitting problems with quadratic (Hilbertian) regularization that arise in approximation theory, machine learning, engineering, and statistics. The generic problem is an optimization in the continuum: given $M$ linear measurements of an unknown function, one minimizes a convex...
Michael Unser· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.