pith. sign in

arxiv: 2606.11355 · v1 · pith:FK2YVU5Fnew · submitted 2026-06-09 · 🧮 math.NA · cs.NA

Dual Gauss--Legendre polynomials

Pawe{\l} Wo\'zny This is my paper

Pith reviewed 2026-06-27 12:09 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords dual polynomialsGauss-Legendre polynomialsLagrange basesapproximation problemsCAGDcomputer graphicsorthogonal polynomials
0
0 comments X

The pith

Two families of dual polynomials to Gauss-Legendre polynomials enable representations, dual Lagrange bases, and CAGD approximations.

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

The paper defines two families of dual polynomials associated with the Gauss-Legendre polynomials. These families are constructed to carry algebraic relations and approximation properties that mirror those of the originals. The definitions make it possible to recover explicit representations of the Gauss-Legendre polynomials and to build dual bases that pair with standard Lagrange bases. The same objects address concrete approximation tasks that arise in computer-aided geometric design and computer graphics.

Core claim

We define and investigate two families of dual polynomials associated with the Gauss--Legendre polynomials, which have recently found interesting applications in computer graphics. Using the presented results, one can derive representations of the Gauss--Legendre polynomials, construct the dual bases for Lagrange bases and solve certain approximation problems arising, for example, in CAGD.

What carries the argument

The two families of dual polynomials associated with the Gauss--Legendre polynomials, defined so that they satisfy the algebraic and approximation relations required for the listed constructions.

If this is right

  • Representations of the Gauss--Legendre polynomials can be derived directly from the dual families.
  • Dual bases paired with Lagrange bases can be constructed for interpolation.
  • Approximation problems that appear in CAGD can be solved using the dual polynomials.

Where Pith is reading between the lines

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

  • The dual families may reduce the cost of switching between different polynomial bases in repeated interpolation steps.
  • The construction could be tested on other classical orthogonal families to see whether similar duals exist with comparable utility.
  • In graphics pipelines the duals might allow direct control over error terms when fitting curves to sampled data.

Load-bearing premise

The two families of dual polynomials are defined such that they possess the algebraic and approximation properties needed to support the listed constructions and applications.

What would settle it

Explicit computation of the dual polynomials for low degree that fails to recover the expected representation of a Gauss--Legendre polynomial or the Kronecker-delta property for the dual Lagrange basis.

read the original abstract

We define and investigate two families of dual polynomials associated with the Gauss--Legendre polynomials, which have recently found interesting applications in computer graphics. Using the presented results, one can derive representations of the Gauss--Legendre polynomials, construct the dual bases for Lagrange bases and solve certain approximation problems arising, for example, in CAGD.

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 / 0 minor

Summary. The paper defines and investigates two families of dual polynomials associated with the Gauss--Legendre polynomials. It claims these enable derivations of representations of the Gauss--Legendre polynomials, construction of dual bases for Lagrange bases, and solutions to certain approximation problems in CAGD.

Significance. The topic intersects numerical analysis and computer-aided geometric design, where dual bases can be useful. However, with no explicit definitions, constructions, or proofs visible, it is not possible to determine whether the claimed algebraic and approximation properties hold or represent a substantive advance.

major comments (1)
  1. [Abstract] Abstract: the central claims rest on the existence of two families of dual polynomials with specific algebraic and approximation properties, but no definitions, recurrence relations, orthogonality conditions, or explicit constructions are provided, so the claims cannot be verified or assessed for correctness.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review. We address the single major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claims rest on the existence of two families of dual polynomials with specific algebraic and approximation properties, but no definitions, recurrence relations, orthogonality conditions, or explicit constructions are provided, so the claims cannot be verified or assessed for correctness.

    Authors: The abstract is a concise summary and therefore omits explicit formulas. The two families of dual polynomials are defined in Section 2 of the manuscript, with recurrence relations, orthogonality conditions, and explicit constructions given there and in Section 3, together with proofs of the claimed algebraic and approximation properties. These sections supply the material needed to verify the claims. We will revise the abstract to include a brief pointer to the definitions and key properties. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper explicitly defines two families of dual polynomials to the Gauss-Legendre polynomials and then derives their algebraic and approximation properties from those definitions. No load-bearing step reduces a claimed prediction or uniqueness result to a fitted parameter, self-citation chain, or redefinition of the input; the listed applications (representations, dual Lagrange bases, CAGD approximations) follow directly from the stated definitions and standard polynomial identities without circular reduction. The work is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no explicit free parameters, axioms, or invented entities are described.

pith-pipeline@v0.9.1-grok · 5561 in / 877 out tokens · 17078 ms · 2026-06-27T12:09:40.257078+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

34 extracted references · 1 canonical work pages · 1 internal anchor

  1. [1]

    M. K. Agoston, Computer graphics and geometric modelling. Implementation & algo- rithms, 1st ed., Springer, London, 2005

    2005

  2. [2]

    J¨ uttler, The dual basis functions of the Bernstein polynomials, Advances in Compu- tational Mathematics 8 (1998) 345–352

    B. J¨ uttler, The dual basis functions of the Bernstein polynomials, Advances in Compu- tational Mathematics 8 (1998) 345–352

    1998

  3. [3]

    Bartoˇ n, B

    M. Bartoˇ n, B. J¨ uttler, Computing roots of polynomials by quadratic clipping, Computer Aided Geometric Design 24 (2007) 125–141

    2007

  4. [4]

    Evaluation of Gauss-Legendre curves

    F. Chudy, P. Woźny, Evaluation of Gauss–Legendre curves, 2026,http://arxiv.org/ abs/2604.17331

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  5. [5]

    Ciesielski, The basis of B-splines in the space of algebraic polynomials, Ukrainian Mathematical Journal 38 (1987) 311–315

    Z. Ciesielski, The basis of B-splines in the space of algebraic polynomials, Ukrainian Mathematical Journal 38 (1987) 311–315

    1987

  6. [6]

    Farin, Curves and surfaces for Computer-Aided Geometric Design

    G. Farin, Curves and surfaces for Computer-Aided Geometric Design. A practical guide, 5th ed., Academic Press, Boston, 2002

    2002

  7. [7]

    Gautschi, Numerical analysis, 2nd ed., Birkh¨ auser, 2011

    W. Gautschi, Numerical analysis, 2nd ed., Birkh¨ auser, 2011

    2011

  8. [8]

    R. N. Goldman, Dual polynomial bases, Journal of Approximation Theory 79 (1994) 311–346

    1994

  9. [9]

    Guohui, L

    Z. Guohui, L. Xiuping, S. Zhixun, A dual functional to the univariate B-spline, Journal of Computational and Applied Mathematics 195 (2006) 292–299

    2006

  10. [10]

    N. Hale, A. Townsend, Fast and accurate computation of Gauss–Legendre and Gauss– Jacobi quadrature nodes and weights, SIAM Journal on Scientific Computing 35 (2013) A652–A674

    2013

  11. [11]

    Johansson, M

    F. Johansson, M. Mezzarobba, Fast and rigorous arbitrary-precision computation of Gauss–Legendre quadrature nodes and weights, SIAM Journal on Scientific Comput- ing 40 (2018) C726–C747

    2018

  12. [12]

    S. H. Kim, H.-P. Schr¨ ocker, H. P. Moon, Fundamental geometric operations for Gauss– Legendre curves via linear transformations of control edges, Computer Aided Geometric Design 128 (2026) 102575

    2026

  13. [13]

    Koekoek, P

    R. Koekoek, P. A. Lesky, R. F. Swarttouw, Hypergeometric orthogonal polynomials and theirq-analogues, Springer Monographs in Mathematics, Springer Berlin Heidelberg, 2010. 12

    2010

  14. [14]

    Lewanowicz, P

    S. Lewanowicz, P. Woźny, Connections between two-variable Bernstein and Jacobi poly- nomials on the triangle, Journal of Computational and Applied Mathematics 197 (2006) 520–533

    2006

  15. [15]

    Lewanowicz, P

    S. Lewanowicz, P. Woźny, Dual generalized Bernstein basis, Journal of Approximation Theory 138 (2006) 129–150

    2006

  16. [16]

    Lewanowicz, P

    S. Lewanowicz, P. Woźny, B´ ezier representation of the constrained dual Bernstein poly- nomials, Applied Mathematics and Computation 218 (2011) 4580–4586

    2011

  17. [17]

    Lewanowicz, P

    S. Lewanowicz, P. Woźny, Multi-degree reduction of tensor product B´ ezier surfaces with general boundary constraints, Applied Mathematics and Computation 217 (2011) 4596– 4611

    2011

  18. [18]

    Lewanowicz, P

    S. Lewanowicz, P. Woźny, P. Keller, Polynomial approximation of rational B´ ezier curves with constraints, Numerical Algorithms 59 (2012) 607–622

    2012

  19. [19]

    L. Liu, L. Zhang, B. Lin, G. Wang, Fast approach for computing roots of polynomials using cubic clipping, Computer Aided Geometric Design 26 (2009) 547–559

    2009

  20. [20]

    H. P. Moon, S. H. Kim, S.-H. Kwon, Gauss–Legendre polynomial basis for the shape control of polynomial curves, Applied Mathematics and Computation 451 (2023) 127995

    2023

  21. [21]

    H. P. Moon, S. H. Kim, S.-H. Kwon, A novel method for manipulating polynomial curves by the Gauss–Legendre control polygon with points interpolating property, Ap- plied Mathematics and Computation 512 (2026) 129760

    2026

  22. [22]

    Rababah, M

    A. Rababah, M. Al-Natour, The weighted dual functionals for the univariate Bernstein basis, Applied Mathematics and Computation 186 (2007) 1581–1590

    2007

  23. [23]

    Rababah, M

    A. Rababah, M. Al-Natour, Weighted dual functions for Bernstein basis satisfying bound- ary conditions, Applied Mathematics and Computation 199 (2008) 1581–1590

    2008

  24. [24]

    Ramanantoanina, K

    A. Ramanantoanina, K. Hormann, GL-kcurves: a family of polynomial curves for intu- itive modelling, Computer Aided Geometric Design 127 (2026) 102558

    2026

  25. [25]

    J. Shen, T. Tang, L.-L. Wang, Orthogonal polynomials and related approximation results, in: Spectral methods: algorithms, analysis and applications, vol. 41 of Springer Series in Computational Mathematics, Springer Berlin Heidelberg, 2011

    2011

  26. [26]

    Woźny, Simple algorithms for computing the B´ ezier coefficients of the constrained dual Bernstein polynomials, Applied Mathematics and Computation (2012), accepted for publication

    P. Woźny, Simple algorithms for computing the B´ ezier coefficients of the constrained dual Bernstein polynomials, Applied Mathematics and Computation (2012), accepted for publication

    2012

  27. [27]

    Woźny, Construction of dual bases, Journal of Computational and Applied Mathe- matics 245 (2013) 75–85

    P. Woźny, Construction of dual bases, Journal of Computational and Applied Mathe- matics 245 (2013) 75–85

    2013

  28. [28]

    Woźny, Construction of dual B-spline functions, Journal of Computational and Applied Mathematics 260 (2014) 301–311

    P. Woźny, Construction of dual B-spline functions, Journal of Computational and Applied Mathematics 260 (2014) 301–311

    2014

  29. [29]

    Woźny, S

    P. Woźny, S. Lewanowicz, Multi-degree reduction of B´ ezier curves with constraints, using dual Bernstein basis polynomials, Computer Aided Geometric Design 26 (2009) 566–579. 13

    2009

  30. [30]

    Woźny, S

    P. Woźny, S. Lewanowicz, Constrained multi-degree reduction of triangular B´ ezier sur- faces, using dual Bernstein polynomials, Journal of Computational and Applied Mathe- matics 235 (2010) 785–804

    2010

  31. [31]

    Zhang, J

    L. Zhang, J. Tan, Z. Dong, The dual bases for the B´ ezier-Said-Wang type generalized Ball polynomial bases and their applications, Applied Mathematics and Computation 217 (2010) 3088–3101

    2010

  32. [32]

    Zhang, J

    L. Zhang, J. Tan, H. Wu, Z. Liu, The weighted dual functions for Wang-B´ ezier type generalized Ball bases and their applications, Applied Mathematics and Computation 215 (2009) 22–36

    2009

  33. [33]

    Zhang, H

    L. Zhang, H. Wu, J. Tan, Dual bases for Wang-B´ ezier basis and their applications, Applied Mathematics and Computation 214 (2009) 218–227

    2009

  34. [34]

    Zhang, H

    L. Zhang, H. Wu, J. Tan, Dual basis functions for the NS power and their applications, Applied Mathematics and Computation 207 (2009) 434–441. 14

    2009