Division algorithms for Bernstein polynomials

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 @m-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.

[1]  Ron Goldman,et al.  Mu-bases for Polynomial Systems in One Variable , 2009, Comput. Aided Geom. Des..

[2]  Falai Chen,et al.  The moving line ideal basis of planar rational curves , 1998, Comput. Aided Geom. Des..

[3]  Falai Chen,et al.  The µ-basis of a planar rational curve: properties and computation , 2002 .

[4]  Ron Goldman,et al.  Axial moving lines and singularities of rational planar curves , 2007, Comput. Aided Geom. Des..

[5]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[6]  Ron Goldman,et al.  Pyramid algorithms - a dynamic programming approach to curves and surfaces for geometric modeling , 2002, Morgan Kaufmann series in computer graphics and geometric modeling.

[7]  Wenping Wang,et al.  The µ-basis of a planar rational curve - properties and computation , 2002, Graph. Model..

[8]  Falai Chen,et al.  A new implicit representation of a planar rational curve with high order singularity , 2002, Comput. Aided Geom. Des..

[9]  Falai Chen,et al.  Implicitization using moving curves and surfaces , 1995, SIGGRAPH.

[10]  Falai Chen.  Reparametrization of a rational ruled surface using the -basis , 2003, Comput. Aided Geom. Des..

[11]  Thomas W. Sederberg,et al.  Curve implicitization using moving lines , 1994, Comput. Aided Geom. Des..

[12]  Zhiping Lin,et al.  On syzygy modules for polynomial matrices , 1999 .

[13]  Juan Manuel Peña,et al.  Shape preserving representations and optimality of the Bernstein basis , 1993, Adv. Comput. Math..

[14]  Thomas W. Sederberg,et al.  A Direct Approach to Computing the µ-basis of Planar Rational Curves , 2001, J. Symb. Comput..

[15]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

[16]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[18]  Wenping Wang,et al.  Revisiting the [mu]-basis of a rational ruled surface , 2003, J. Symb. Comput..

[19]  Ron Goldman,et al.  Implicitizing Rational Curves by the Method of Moving Algebraic Curves , 1997, J. Symb. Comput..

[20]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[21]  D. Hilbert.  Ueber die Theorie der algebraischen Formen , 1890 .

[22]  André Galligo,et al.  A computational study of ruled surfaces , 2009, J. Symb. Comput..

[23]  Falai Chen,et al.  The mu-basis of a rational ruled surface , 2001, Comput. Aided Geom. Des..