SearcharxivSearch

arXiv · 2609.03461

Adaptively-refinable polar-spline discrete differential forms: hierarchical construction, exactness, and applications

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Diogo C. Cabanas, Deepesh Toshniwal, Rafael Vazquez. 2026-09-03. Adaptively-refinable polar-spline discrete differential forms: hierarchical construction, exactness, and applications. https://arxiv.org/abs/2609.03461

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA