pith. sign in

arxiv: 2604.13754 · v2 · submitted 2026-04-15 · 🧮 math.NA · cs.NA

A representation and comparison of three cubic macro-elements

Pith reviewed 2026-05-10 12:39 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords cubic splinesBernstein-Bézier formmacro-elementstriangulationslocally supported basesspline spacesgeometric constructionnumerical approximation
0
0 comments X

The pith

Three cubic spline families on triangulations share a unified representation via locally supported Bernstein-Bézier basis functions.

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

The paper constructs a common set of locally supported basis functions for three distinct cubic spline spaces defined over triangulations, each tied to three degrees of freedom at every vertex. These families vary in their smoothness, polynomial reproduction, and computational demands, yet the geometric construction yields explicit Bernstein-Bézier expressions that respect the vertex data and inter-element continuity. The approach turns the splines into practical tools for approximation methods by allowing direct comparison and straightforward coding. A reader cares because the unified bases reduce the barrier to selecting and deploying the right spline type for problems on irregular meshes.

Core claim

A unified representation in terms of locally supported basis functions is established for three types of cubic splines over a triangulation that are characterized by three degrees of freedom associated with each vertex. The construction of these functions is based on geometric concepts and is expressed in the Bernstein-Bézier form. They are readily applicable in a range of standard approximation methods.

What carries the argument

Locally supported basis functions in Bernstein-Bézier form, built from geometric constructions that enforce the three vertex degrees of freedom while maintaining the smoothness and polynomial properties of each spline family.

Load-bearing premise

The three spline families admit consistent, stable, locally supported bases in Bernstein-Bézier form that preserve the stated degrees of freedom and smoothness properties across arbitrary triangulations.

What would settle it

Find a triangulation and a constructed basis function that either violates the required continuity between elements or fails to reproduce the polynomials claimed for its spline family.

Figures

Figures reproduced from arXiv: 2604.13754 by Ada \v{S}adl Praprotnik, Andrej Kolar-Po\v{z}un, Ema \v{C}e\v{s}ek, Ga\v{s}per Domen Romih, Jan Gro\v{s}elj, Maru\v{s}a Lek\v{s}e, Matija \v{S}teblaj.

Figure 1
Figure 1. Figure 1: A triangulation △ of the unit square depicted by the uninterrupted lines. The figure on the left also shows the Clough–Tocher refinement △CT of △ determined by the dotted lines. The figure on the right depicts a configuration of triangles associated with the vertices of △ suitable for construction of basis functions. Each triangle is obtained as the smallest triangle that contains the gray colored points i… view at source ↗
Figure 2
Figure 2. Figure 2: Contour plots of the basis functions Bℓ i,r for r = 0, 1, 2 and ℓ = 1, 2, 3 that are associated with the vertex vi in the interior of the domain and defined based on the triangle [qi,0, qi,1, qi,2] shown in [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Contour plots of the basis functions Bℓ j,r for r = 0, 1, 2 and ℓ = 1, 2, 3 that are associated with the vertex vj on the boundary of the domain and defined based on the triangle [qj,0, qj,1, qj,2] shown in [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A sequence of triangulations obtained by subsequently refining the triangulation of the unit square shown in Figure 1. [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The condition numbers of matrices arising in different approximation methods with respect to the scaling factor [PITH_FULL_IMAGE:figures/full_fig_p011_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Errors of the approximations from Sℓ, ℓ = 1, 2, 3, for the problem discussed in Example 4 (left) and the convergence of the coefficient vectors corresponding to the discrete best L2 approximation when the number of points is increased as described in Example 5 (right). (a) Franke’s test function. (b) Best L 2 approximation in S1. (c) Best L 2 approximation in S2. (d) Best L 2 approximation in S3 [PITH_FUL… view at source ↗
Figure 7
Figure 7. Figure 7: Contour plots of the Franke’s test function and its best [PITH_FULL_IMAGE:figures/full_fig_p013_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: The approximation error with respect to the penalty parameter [PITH_FULL_IMAGE:figures/full_fig_p014_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: A domain with curved boundary Ω (left) discussed in Example 7, which is contained in the unit square Θ. The domain Ω can be parametrized by a mapping whose components are quadratic polynomials (the contour plots of the first and the second component are shown in the middle and on the right, respectively). The left figure also depicts the partition of the domain that is obtained by using this mapping to map… view at source ↗
Figure 10
Figure 10. Figure 10: Errors of approximations from Sℓ, ℓ = 1, 2, 3, for the problems discussed in Examples 8 and 9 with respect to the length h of the longest edge in the triangulation. S1 S2 S3 n error cond error cond error cond 24 1.91e-01 8.63e+00 9.36e-02 9.85e+00 9.45e-02 1.05e+01 109 3.49e-02 3.36e+01 3.29e-02 3.54e+01 3.07e-02 3.74e+01 459 5.92e-03 1.44e+02 2.24e-03 1.40e+02 2.22e-03 1.48e+02 1879 9.83e-04 5.98e+02 1.9… view at source ↗
Figure 11
Figure 11. Figure 11: Contour plots of the function (15) and its approximations from [PITH_FULL_IMAGE:figures/full_fig_p017_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Errors of approximations from Sℓ, ℓ = 1, 2, 3, for the problems discussed in Examples 10 and 11 with respect to the length h of the longest edge in the triangulation. S1 S2 S3 N error cond error cond error cond 48 3.00e-01 4.52e+02 1.56e-01 2.88e+02 1.29e-01 2.57e+02 153 8.09e-02 4.44e+03 2.41e-02 4.33e+03 1.92e-02 3.51e+03 543 1.21e-02 5.67e+04 3.75e-03 6.36e+04 1.52e-03 5.26e+04 2043 2.80e-03 8.15e+05 8… view at source ↗
Figure 13
Figure 13. Figure 13: Contour plots of the function (15) and its approximations from [PITH_FULL_IMAGE:figures/full_fig_p019_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Impact of the penalization parameters λ and µ on the accuracy of the approximations discussed in Example 12. The first one is the classical Zienkiewicz element, which is on a triangle of the triangulation constructed by considering only the data corresponding to the three vertices of the triangle. It does not reproduce cubic polynomials and is only C 0 -smooth, but it is simple to compute. The second one … view at source ↗
read the original abstract

The paper is concerned with three types of cubic splines over a triangulation that are characterized by three degrees of freedom associated with each vertex of the triangulation. The splines differ in computational complexity, polynomial reproduction properties, and smoothness. With the aim to make them a versatile tool for numerical analysis, a unified representation in terms of locally supported basis functions is established. The construction of these functions is based on geometric concepts and is expressed in the Bernstein--B\'ezier form. They are readily applicable in a range of standard approximation methods, which is demonstrated by a number of numerical experiments.

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

0 major / 2 minor

Summary. The paper claims to establish a unified representation in terms of locally supported basis functions for three families of cubic macro-element splines on triangulations, each characterized by exactly three degrees of freedom per vertex. The families differ in computational complexity, polynomial reproduction properties, and smoothness; the basis functions are constructed geometrically and expressed in Bernstein-Bézier form, with utility demonstrated via numerical experiments in standard approximation methods.

Significance. If the geometric constructions are correct, the work supplies a practical, explicit framework that renders these macro-elements more usable in numerical analysis. Credit is due for the local support (confined to vertex stars), the dimension count matching 3V for arbitrary triangulations, and the by-construction enforcement of continuity and degrees of freedom without global constraints. The numerical experiments further strengthen applicability by showing concrete performance differences among the families.

minor comments (2)
  1. The abstract states that the splines 'differ in computational complexity, polynomial reproduction properties, and smoothness' but does not name the specific smoothness classes (e.g., C^1 versus C^2) or reproduction degrees for each family; adding one sentence would immediately orient readers.
  2. In the numerical experiments section, the error tables or figures would benefit from explicit listing of the mesh sizes (number of vertices or triangles) and the precise test functions employed, to facilitate direct reproduction and comparison with other macro-element schemes.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the recognition of its significance in providing a unified representation for the three families of cubic macro-elements, and the recommendation for minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; explicit geometric construction is self-contained

full rationale

The paper constructs unified locally supported Bernstein-Bézier bases for the three cubic macro-element families directly from vertex degrees of freedom and standard geometric concepts, enforcing smoothness and locality by design. Dimension counts match 3V for arbitrary triangulations, and the representations are built without fitted parameters, self-referential definitions, or load-bearing self-citations. All steps rely on independent spline theory and explicit coefficient assignments rather than reducing to the claimed outputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard properties of Bernstein-Bézier polynomials and spline smoothness conditions on triangulations; no free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)
  • standard math Bernstein-Bézier polynomials form a basis for polynomials on triangles and satisfy standard positivity and partition-of-unity properties.
    Invoked to express the locally supported basis functions.
  • domain assumption Spline spaces on triangulations can be characterized by vertex degrees of freedom while maintaining C^0 or higher smoothness.
    Underlies the definition of the three macro-element families.

pith-pipeline@v0.9.0 · 5444 in / 1303 out tokens · 29525 ms · 2026-05-10T12:39:44.600202+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

14 extracted references · 14 canonical work pages

  1. [1]

    M. J. Lai, L. L. Schumaker, Spline Functions on Triangulations, Cambridge University Press, 2007

  2. [2]

    P. G. Ciarlet, The Finite Element Method for Elliptic Problems, 2nd Edition, SIAM: Society for In- dustrial and Applied Mathematics, 2002

  3. [3]

    G. P. Bazaley, Y. K. Cheung, B. M. Irons, O. C. Zienkiewicz, Triangular elements in plate bending - conforming and non-conforming solutions, in: Proceedings of the Conference on Matrix Methods in Structural Mechanics, Wright Patterson, A.F. Base, Ohio, 1965, pp. 547–576

  4. [4]

    T. A. Foley, K. Opitz, Hybrid Cubic Bézier Triangle Patches, in: T. Lyche, L. L. Schumaker (Eds.), Mathematical Methods in Computer Aided Geometric Design II, Academic Press, 1992, pp. 275–286

  5. [5]

    R. W. Clough, J. L. Tocher, Finite element stiffness matrices for analysis of plates in bending, in: Conf. on Matrix Methods in Structural Mechanics, Wright–Patterson Air Force Base, Ohio, 1965, pp. 515–545

  6. [6]

    Mann, Cubic precision Clough–Tocher interpolation, Comput

    S. Mann, Cubic precision Clough–Tocher interpolation, Comput. Aided Geom. Design 16 (1999) 85–88

  7. [7]

    Dierckx, On calculating normalized Powell–Sabin B-splines, Comput

    P. Dierckx, On calculating normalized Powell–Sabin B-splines, Comput. Aided Geom. Design 15 (1997) 61–78

  8. [8]

    Speleers, A normalized basis for reduced Clough–Tocher splines, Comput

    H. Speleers, A normalized basis for reduced Clough–Tocher splines, Comput. Aided Geom. Design 27 (2010) 700–712

  9. [9]

    Lamnii, M

    A. Lamnii, M. Lamnii, H. Mraoui, A normalized basis for condensedC 1 Powell–Sabin-12 splines, Comput. Aided Geom. Design 34 (2015) 5–20. 20

  10. [10]

    Grošelj, H

    J. Grošelj, H. Speleers, Construction and analysis of cubic Powell–Sabin B-splines, Comput. Aided Geom. Design 57 (2017) 1–22

  11. [11]

    Grošelj, M

    J. Grošelj, M. Knez, GeneralizedC1 Clough–Tocher splines for CAGD and FEM, Comput. Methods Appl. Mech. Engrg. 395 (2022) 114983

  12. [12]

    J. Maes, E. Vanraes, P. Dierckx, A. Bultheel, On the stability of normalized Powell–Sabin B-splines, J. Comput. Appl. Math. 170 (2004) 181–196

  13. [13]

    L. L. Schumaker, Spline Functions: Computational Methods, Society for Industrial and Applied Math- ematics, Philadelphia, 2015

  14. [14]

    L. L. Schumaker, Solving Elliptic PDE’s on Domains with Curved Boundaries with an Immersed Pe- nalized Boundary Method, J. Sci. Comput. 80 (2019) 1369–1394. 21