Construction of Exact Refinements for the Two-Dimensional Hierarchical B-Spline de Rham Complex

Abstract. The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the continuous one. This property is not necessarily guaranteed when the discrete function spaces are hierarchical B-splines, and research shows that an arbitrary choice of refinement domains may give rise to spurious harmonic fields that ruin the accuracy of the solution. We will focus on the two-dimensional de Rham complex over the unit square [Formula: see text] and provide theoretical results and a constructive algorithm to ensure that the structure of the complex is preserved: when a pair of functions is in conflict, some additional functions, forming an L-chain between the pair, are also refined. Another crucial aspect to consider in the hierarchical setting is the notion of admissibility, as it is possible to obtain optimal convergence rates of numerical solutions and improved stability by limiting the multilevel interaction of basis functions. We show that, under a common restriction, the admissibility class of the first space of the discrete complex persists throughout the remaining spaces. As such, admissible refinement can be combined with our new algorithm to obtain admissible meshes that also respect the structure of the de Rham complex. Moreover, we detail how our algorithm can be easily included in standard adaptive mesh refinement schemes. Finally, we include numerical results that motivate the importance of the previous concerns for the vector Laplace and Maxwell eigenvalue problems. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/MantisFEM/Research/tree/paper/2026/L-chain and in the supplementary materials ( Research-paper-2026-L-chain.zip [32.9KB]). [Formula: see text]

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-10-26
DOI
https://doi.org/10.1137/25m1778924
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Construction of Exact Refinements for the Two-Dimensional Hierarchical B-Spline de Rham Complex

Deepesh Toshniwal, Kendrick M. Shepherd, Rafael Vázquez, Diogo C. Cabanas
2 links
SIAM Journal on Scientific Computing
Advanced Numerical Methods in Computational Mathematics
article

Construction of Exact Refinements for the Two-Dimensional Hierarchical B-Spline de Rham Complex

Deepesh Toshniwal, Kendrick M. Shepherd, Rafael Vázquez, Diogo C. Cabanas
article en

Abstract

Abstract. The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the continuous one. This property is not necessarily guaranteed when the discrete function spaces are hierarchical B-splines, and research shows that an arbitrary choice of refinement domains may give rise to spurious harmonic fields that ruin the accuracy of the solution. We will focus on the two-dimensional de Rham complex over the unit square [Formula: see text] and provide theoretical results and a constructive algorithm to ensure that the structure of the complex is preserved: when a pair of functions is in conflict, some additional functions, forming an L-chain between the pair, are also refined. Another crucial aspect to consider in the hierarchical setting is the notion of admissibility, as it is possible to obtain optimal convergence rates of numerical solutions and improved stability by limiting the multilevel interaction of basis functions. We show that, under a common restriction, the admissibility class of the first space of the discrete complex persists throughout the remaining spaces. As such, admissible refinement can be combined with our new algorithm to obtain admissible meshes that also respect the structure of the de Rham complex. Moreover, we detail how our algorithm can be easily included in standard adaptive mesh refinement schemes. Finally, we include numerical results that motivate the importance of the previous concerns for the vector Laplace and Maxwell eigenvalue problems. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/MantisFEM/Research/tree/paper/2026/L-chain and in the supplementary materials ( Research-paper-2026-L-chain.zip [32.9KB]). [Formula: see text]

SIAM Journal on Scientific ComputingVol. 48(5)
Brigham Young University (US), Universidade de Santiago de Compostela (ES), Delft University of Technology (NL)
Fundação para a Ciência e a Tecnologia
Openalex Percentile: Top 99%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon