Division Algorithms for Bernstein Polynomials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Aided Geometric Design Year : 2008

Division Algorithms for Bernstein Polynomials

Laurent Busé


Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a mu-basis for the syzygy module of an arbitrary collection of univariate polynomials. Division algorithms for multivariate Bernstein polynomials and analogues in the multivariate Bernstein setting of Grobner bases are also discussed. All these algorithms are based on a simple ring isomorphism that converts each of these problems from the Bernstein basis to an equivalent problem in the monomial basis. This isomorphism allows all the computations to be performed using only the original Bernstein coefficients; no conversion to monomial coefficients is required.
Fichier principal
Vignette du fichier
DivBernstein.pdf (202.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00184762 , version 1 (01-11-2007)



Laurent Busé, Ron Goldman. Division Algorithms for Bernstein Polynomials. Computer Aided Geometric Design, 2008, 25 (9), pp.850--865. ⟨10.1016/j.cagd.2007.10.003⟩. ⟨inria-00184762⟩
166 View
886 Download



Gmail Facebook Twitter LinkedIn More