pith. sign in

arxiv: 2502.19542 · v4 · submitted 2025-02-26 · 🧮 math.NA · cs.NA

Construction of exact refinements for the two-dimensional hierarchical B-spline de Rham complex

Diogo C. Cabanas , Kendrick M. Shepherd , Deepesh Toshniwal , Rafael V\'azquez This is my paper

Pith reviewed 2026-05-23 01:50 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords hierarchical B-splinesde Rham complexadaptive refinementisogeometric analysisfinite elementsMaxwell eigenvaluesvector Laplace problem
0
0 comments X

The pith

A refinement algorithm for hierarchical B-splines preserves the exactness of the two-dimensional de Rham complex by enforcing L-chain refinements on conflicting functions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops theoretical guarantees and a practical algorithm for refining hierarchical B-spline spaces while keeping the de Rham complex structure intact. In two dimensions, when refinement of one function conflicts with another, the method requires refining an entire L-shaped chain of additional functions to maintain the necessary relations between spaces. This prevents the appearance of spurious harmonic fields that would otherwise degrade solution accuracy in problems from electromagnetism and fluid mechanics. Under a standard admissibility restriction, the property holds uniformly across all spaces in the complex, allowing integration with adaptive refinement procedures that deliver optimal convergence rates.

Core claim

The central discovery is a constructive procedure that, upon detecting a conflict between a pair of hierarchical B-spline functions during refinement, adds all functions in the L-chain connecting them; this ensures the discrete de Rham sequence remains exact on the unit square, and the same admissibility class is inherited by subsequent spaces under the common restriction.

What carries the argument

The L-chain, which is the minimal set of additional basis functions that must be refined to resolve a conflict between two functions while preserving the commutation properties of the de Rham complex.

If this is right

  • Spurious harmonic fields are avoided in the discrete spaces.
  • Admissible hierarchical meshes can be constructed that also satisfy the de Rham structure.
  • The algorithm fits directly into existing adaptive mesh refinement loops.
  • Numerical tests on vector Laplace and Maxwell eigenvalue problems confirm improved stability and accuracy.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This approach may generalize to three-dimensional de Rham complexes or other spline types.
  • Combining it with isogeometric analysis could yield more reliable solvers for Maxwell's equations without extra stabilization.
  • Implementation in existing codes would require tracking L-chains during the refinement decision step.

Load-bearing premise

The admissibility restriction is assumed to hold so that the class of the first space carries over to the others in the complex.

What would settle it

A concrete falsifier would be the appearance of a non-zero harmonic field in a mesh produced by the algorithm, or the failure to preserve exactness after applying the L-chain rule to a known conflicting pair.

Figures

Figures reproduced from arXiv: 2502.19542 by Deepesh Toshniwal, Diogo C. Cabanas, Kendrick M. Shepherd, Rafael V\'azquez.

Figure 1
Figure 1. Figure 1: Illustration of three different scenarios, all using [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Example of a chain, Ci,j , with a “kink”, and its counterpart, Cei,j , with the “kink” removed. Shaded regions represent the supports of the bicubic B-splines βi and βj , filled dots the indices of functions in each chain, and hollow dots the indices of functions in □i,j that can be used to remove the “kink”. Proof. We will prove the result directly, by showing that there is a shortest chain between any pa… view at source ↗
Figure 3
Figure 3. Figure 3: Two hierarchical meshes for Test 1. Both meshes were created from the same set of marked elements, the difference [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Magnitude of the analytical solution eq. (10). [PITH_FULL_IMAGE:figures/full_fig_p018_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Adaptive refinement without Algorithm 1 for the vector Laplace problem with analytical solution (10). After the [PITH_FULL_IMAGE:figures/full_fig_p019_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Adaptive refinement using Algorithm 1 for the vector Laplace problem with analytical solution (10). By adding [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Two hierarchical meshes for the test of Maxwell eigenvalue problem. Both meshes were created from the same set of [PITH_FULL_IMAGE:figures/full_fig_p020_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Comparison of the first 50 non-null eigenvalues computed using the two meshes of Fig. 8. We are now accounting for [PITH_FULL_IMAGE:figures/full_fig_p021_9.png] view at source ↗
read the original 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 $\Omega \subseteq \mathbb{R}^2$, and provide theoretical results and a constructive algorithm to ensure that the structure of the complex is preserved: when a pair of functions are 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 multi-level 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The paper presents theoretical results and a constructive algorithm to preserve the exact sequence of the two-dimensional hierarchical B-spline de Rham complex by refining additional functions in L-chains when conflicts arise between pairs of functions. It further shows that, under a common restriction, the admissibility of the first space persists to the remaining spaces, enabling combination with admissible refinement strategies. The algorithm is designed to integrate into standard adaptive mesh refinement schemes, and numerical results are included for the vector Laplace and Maxwell eigenvalue problems.

Significance. If the central claims hold, the work enables stable, structure-preserving discretizations using hierarchical B-splines for problems in electromagnetism and fluid mechanics, while maintaining admissibility for optimal convergence. The provision of an explicit constructive algorithm together with numerical tests on the vector Laplace and Maxwell problems supplies a direct route to verification and practical application.

major comments (1)
  1. [Abstract, admissibility paragraph] Abstract, admissibility paragraph: the persistence of admissibility is asserted only under an unspecified 'common restriction'; this is load-bearing for the claim that admissible refinement can be combined with the algorithm to obtain meshes respecting the de Rham structure, and the restriction must be stated explicitly (with its precise scope) to allow verification of the result.
minor comments (1)
  1. The abstract states that 'research shows that an arbitrary choice of refinement domains may give rise to spurious harmonic fields' but provides no citation; adding a reference to the relevant prior work would improve context and traceability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive assessment and the recommendation of minor revision. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract, admissibility paragraph] Abstract, admissibility paragraph: the persistence of admissibility is asserted only under an unspecified 'common restriction'; this is load-bearing for the claim that admissible refinement can be combined with the algorithm to obtain meshes respecting the de Rham structure, and the restriction must be stated explicitly (with its precise scope) to allow verification of the result.

    Authors: We agree that the abstract should state the common restriction explicitly, as this is necessary for readers to verify the claim that admissibility persists and can be combined with the algorithm. The restriction in question is the standard admissibility condition on the hierarchical mesh (detailed in the body of the paper). We will revise the abstract to replace the phrase 'under a common restriction' with an explicit reference to this condition and its scope. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents a direct constructive algorithm for adding L-chain refinements to resolve conflicts in hierarchical B-spline spaces while preserving the exact de Rham sequence property, together with a proof that admissibility of the first space carries over to the others under a stated restriction. These results are derived from the definitions of the spline spaces, the notion of conflicts between basis functions, and the hierarchical refinement rules themselves; no step reduces by construction to a fitted parameter, a self-referential definition, or a load-bearing self-citation. The argument is self-contained against the external mathematical structure of the de Rham complex and is supplemented by explicit numerical tests, yielding an independent verification path.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on standard properties of B-splines, hierarchical spaces, and the de Rham complex drawn from prior literature; no free parameters, new entities, or ad-hoc axioms are introduced in the abstract.

axioms (1)
  • standard math Standard properties of hierarchical B-splines and the continuous de Rham complex
    Invoked throughout to define the discrete spaces and exactness requirement.

pith-pipeline@v0.9.0 · 5812 in / 1225 out tokens · 56538 ms · 2026-05-23T01:50:03.163191+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

35 extracted references · 35 canonical work pages

  1. [1]

    Arnold,Finite element exterior calculus, CBMS-NSF regional conference series in applied mathematics, no

    Douglas N. Arnold,Finite element exterior calculus, CBMS-NSF regional conference series in applied mathematics, no. 93, Society for Industrial and Applied Mathematics, SIAM, Philadelphia, 2018

    work page 2018

  2. [2]

    Arnold, Richard S

    Douglas N. Arnold, Richard S. Falk, and Ragnar Winther,Finite element exterior calculus, homological techniques, and applications, Acta Numerica15(2006), 1–155

    work page 2006

  3. [3]

    ,Finite element exterior calculus: from Hodge theory to numerical stability, Bull. Amer. Math. Soc. (N.S.), 47:281-354, 201047(2009), no. 2, 281–354

    work page 2009

  4. [4]

    Arnold and Ragnar Winther,Mixed finite elements for elasticity, Numerische Mathematik 92(2002), no

    Douglas N. Arnold and Ragnar Winther,Mixed finite elements for elasticity, Numerische Mathematik 92(2002), no. 3, 401–419

    work page 2002

  5. [5]

    ed ed., Applied mathematical sciences, no

    Carl De Boor,A practical guide to splines, rev. ed ed., Applied mathematical sciences, no. v. 27, Springer, New York, 2001, Includes bibliographical references (p. 331-339) and index

    work page 2001

  6. [6]

    1, 241–261

    Cesare Bracco, Annalisa Buffa, Carlotta Giannelli, and Rafael Vázquez,Adaptive isogeometric methods with hierarchical splines: An overview, Discrete & Continuous Dynamical Systems - A39(2019), no. 1, 241–261

    work page 2019

  7. [7]

    Brenner and L

    Susanne C. Brenner and L. Ridgway Scott,The mathematical theory of finite element methods, Springer New York, 2008

    work page 2008

  8. [8]

    4, 923–942

    Andrea Bressan and Espen Sande,Approximation in FEM, DG and IGA: a theoretical comparison, Numerische Mathematik143(2019), no. 4, 923–942

    work page 2019

  9. [9]

    Buffa, J

    A. Buffa, J. Rivas, G. Sangalli, and R. Vázquez,Isogeometric discrete differential forms in three di- mensions, SIAM Journal on Numerical Analysis49(2011), no. 2, 818–844

    work page 2011

  10. [10]

    Buffa, G

    A. Buffa, G. Sangalli, and R. Vázquez,Isogeometric analysis in electromagnetics: B-splines approxi- mation, Computer Methods in Applied Mechanics and Engineering199(2010), no. 17–20, 1143–1152

    work page 2010

  11. [11]

    7, 4479–4555

    AnnalisaBuffa, GregorGantner, CarlottaGiannelli, DirkPraetorius, andRafaelVázquez,Mathematical Foundations of Adaptive Isogeometric Analysis, Archives of Computational Methods in Engineering29 (2022), no. 7, 4479–4555

    work page 2022

  12. [12]

    01, 1–25

    Annalisa Buffa and Carlotta Giannelli,Adaptive isogeometric methods with hierarchical splines: Error estimator and convergence, Mathematical Models and Methods in Applied Sciences26(2015), no. 01, 1–25

    work page 2015

  13. [13]

    14, 2781–2802

    ,Adaptive isogeometric methods with hierarchical splines: Optimality and convergence rates, Mathematical Models and Methods in Applied Sciences27(2017), no. 14, 2781–2802

    work page 2017

  14. [14]

    Massimo Carraturo, Carlotta Giannelli, Alessandro Reali, and Rafael Vázquez,Suitably graded THB- spline refinement and coarsening: Towards an adaptive isogeometric analysis of additive manufacturing processes, Computer Methods in Applied Mechanics and Engineering348(2019), 660–679

    work page 2019

  15. [15]

    Ciarlet,The Finite Element Method for Elliptic Problems, Classics in applied mathematics, no

    Philippe G. Ciarlet,The Finite Element Method for Elliptic Problems, Classics in applied mathematics, no. 40, Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadel- phia, PA 19104), Philadelphia, Pa., 2002, System requirements: Adobe Acrobat Reader

    work page 2002

  16. [16]

    3, 1106–1124

    Willy Dörfler,A Convergent Adaptive Algorithm for Poisson’s Equation, SIAM Journal on Numerical Analysis33(1996), no. 3, 1106–1124

    work page 1996

  17. [17]

    Davide D’Angella, Stefan Kollmannsberger, Ernst Rank, and Alessandro Reali,Multi-level Bézier ex- traction for hierarchical local refinement of Isogeometric analysis, Computer Methods in Applied Me- chanics and Engineering328(2018), 147–174. 22

    work page 2018

  18. [18]

    DavideD’AngellaandAlessandroReali,Efficient extraction of hierarchical B-splines for local refinement and coarsening of isogeometric analysis, Computer Methods in Applied Mechanics and Engineering367 (2020), 113131

    work page 2020

  19. [19]

    Evans, Yuri Bazilevs, Ivo Babuška, and Thomas J.R

    John A. Evans, Yuri Bazilevs, Ivo Babuška, and Thomas J.R. Hughes,n-Widths, sup–infs, and opti- mality ratios for thek-version of the isogeometric finite element method, Computer Methods in Applied Mechanics and Engineering198(2009), no. 21–26, 1726–1741

    work page 2009

  20. [20]

    1, 422–473

    John A Evans, Michael A Scott, Kendrick M Shepherd, Derek C Thomas, and Rafael Vázquez Hernán- dez,Hierarchical B-spline complexes of discrete differential forms, IMA Journal of Numerical Analysis 40(2018), no. 1, 422–473

    work page 2018

  21. [21]

    Farin,Curves and surfaces for cagd, 5

    Gerald E. Farin,Curves and surfaces for cagd, 5. ed., [nachdr.] ed., The @Morgan Kaufmann series in computer graphics and geometric modeling, Morgan Kaufmann Publ., San Francisco, Calif. [u.a.], 2006, Includes bibliographical references (p. 449-489)

    work page 2006

  22. [22]

    7, 485–498

    Carlotta Giannelli, Bert Jüttler, and Hendrik Speleers,THB-splines: The truncated basis for hierarchi- cal splines, Computer Aided Geometric Design29(2012), no. 7, 485–498

    work page 2012

  23. [23]

    2, 459–490

    ,Strongly stable bases for adaptively refined multilevel spline spaces, Advances in Computational Mathematics40(2013), no. 2, 459–490

    work page 2013

  24. [24]

    Hatcher,Algebraic topology, Cambridge University Press, Cambridge, 2002

    A. Hatcher,Algebraic topology, Cambridge University Press, Cambridge, 2002. MR 1867354 (2002k:55001)

    work page 2002

  25. [25]

    Thomas J. R. Hughes,The finite element method, Dover Publications, Mineola, NY, 2000, Reprint. Originally published: Englewood Cliffs, N.J. : Prentice-Hall, 1987

    work page 2000

  26. [26]

    Hughes, J.A

    T.J.R. Hughes, J.A. Cottrell, and Y. Bazilevs,Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement, Computer Methods in Applied Mechanics and Engineering194 (2005), no. 39–41, 4135–4195

    work page 2005

  27. [27]

    Les Piegl and Wayne Tiller,The nurbs book, Springer Berlin Heidelberg, 1997

    work page 1997

  28. [28]

    06, 1175–1205

    Espen Sande, Carla Manni, and Hendrik Speleers,Sharp error estimates for spline approximation: Explicit constants,n-widths, and eigenfunction convergence, Mathematical Models and Methods in Applied Sciences29(2019), no. 06, 1175–1205

    work page 2019

  29. [29]

    4, 889–929

    ,Explicit error estimates for spline approximation of arbitrary smoothness in isogeometric anal- ysis, Numerische Mathematik144(2020), no. 4, 889–929

    work page 2020

  30. [30]

    Larry Schumaker,Spline functions: Basic theory, Cambridge University Press, August 2007

    work page 2007

  31. [31]

    Sederberg, David L

    Thomas W. Sederberg, David L. Cardon, G. Thomas Finnigan, Nicholas S. North, Jianmin Zheng, and Tom Lyche,T-spline simplification and local refinement, ACM Transactions on Graphics23(2004), no. 3, 276–283

    work page 2004

  32. [32]

    Sederberg, Jianmin Zheng, Almaz Bakenov, and Ahmad Nasri,T-splines and T-NURCCs, ACM Transactions on Graphics22(2003), no

    Thomas W. Sederberg, Jianmin Zheng, Almaz Bakenov, and Ahmad Nasri,T-splines and T-NURCCs, ACM Transactions on Graphics22(2003), no. 3, 477–484

    work page 2003

  33. [33]

    Kendrick Shepherd and Deepesh Toshniwal,Locally-verifiable sufficient conditions for exactness of the hierarchical B-spline discrete de rham complex inR n, Foundations of Computational Mathematics (2024)

    work page 2024

  34. [34]

    Hendrik Speleers and Deepesh Toshniwal,A general class ofC1 smooth rational splines: Application to construction of exact ellipses and ellipsoids, Computer-Aided Design132(2021), 102982

    work page 2021

  35. [35]

    Vuong, C

    A.-V. Vuong, C. Giannelli, B. Jüttler, and B. Simeon,A hierarchical approach to adaptive local refine- ment in isogeometric analysis, Comput. Methods Appl. Mech. Engrg.200(2011), 3554–3567. 23

    work page 2011