Computing the B\'ezier Control Points of the Lagrangian Interpolant in Arbitrary Dimension
Mark Ainsworth, Manuel A. S\'anchez

TL;DR
This paper introduces a new, stable, and simple algorithm for computing the Bernstein control points of the Lagrangian interpolant, generalizing to multiple dimensions with the same efficiency as existing methods.
Contribution
It presents an alternative to the Marco-Martinez algorithm that is easier to derive, more accessible, and naturally extends to multivariate cases.
Findings
Same computational complexity as Marco-Martinez algorithm
Demonstrates numerical stability comparable to existing methods
Provides a straightforward derivation using basic Lagrange interpolation theory
Abstract
The Bernstein-B\'ezier form of a polynomial is widely used in the fields of computer aided geometric design, spline approximation theory and, more recently, for high order finite element methods for the solution of partial differential equations. However, if one wishes to compute the classical Lagrange interpolant relative to the Bernstein basis, then the resulting Bernstein-Vandermonde matrix is found to be highly ill-conditioned. In the univariate case of degree , Marco and Martinez showed that using Neville elimination to solve the system exploits the total positivity of the Bernstein basis and results in an complexity algorithm. Remarkable as it may be, the Marco-Martinez algorithm has some drawbacks: The derivation of the algorithm is quite technical; the interplay between the ideas of total positivity and Neville elimination are not part of the standard…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
