Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CAGD
2008

favoriteEmaildiscussreport

80views more CAGD 2008»

Division algorithms for Bernstein polynomials

13 years 4 months ago

Division algorithms for Bernstein polynomials

Download hal.inria.fr

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

Laurent Busé, Ron Goldman

Real-time Traffic

Algorithms | Bernstein Polynomials | CAGD 2008 | Univariate Polynomials |

claim paper

Related Content

» BasisIndependent Polynomial Division Algorithm Applied to Division in Lagrange and Bernste...

» Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion

» Solving nonlinear polynomial systems in the barycentric Bernstein basis

» Division of Entire Functions by Polynomial Ideals

» Fast Bounds on the Distribution of Smooth Numbers

» Parallel sparse polynomial division using heaps

» Sparse polynomial division using a heap

» List Decoding for Binary Goppa Codes

» On Short Multiplications and Divisions

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CAGD
Authors	Laurent Busé, Ron Goldman

Comments (0)