Division Algorithms for Bernstein Polynomials

Laurent Busé 1 Ron Goldman 2
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00184762
Contributor : Laurent Busé <>
Submitted on : Thursday, November 1, 2007 - 2:44:00 PM
Last modification on : Thursday, January 11, 2018 - 4:57:38 PM
Long-term archiving on : Monday, April 12, 2010 - 1:10:53 AM

Files

DivBernstein.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

374

Files downloads

857