Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis

DOI10.1007/978-3-540-87827-8_6zbMath1166.68379MaRDI QIDQ3597981

Manfred Minimair

Publication date: 29 January 2009

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_6

zbMATH Keywords

Bernstein basis; Lagrange basis; polynomial division

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

Related Items

The Bernstein polynomial basis: a centennial retrospective

Cites Work

• Unnamed Item
• Unnamed Item
• Division of generalized polynomials using the comrade matrix
• Euclidean remainders for generalized polynomials
• Greatest common divisor of generalized polynomials and polynomial matrices
• A companion matrix resultant for Bernstein polynomials
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Polynomial algorithms in computer algebra
• Polynomial evaluation and interpolation on special sets of points
• On computing polynomial GCDs in alternate bases
• Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
• On the optimal stability of the Bernstein basis
• Numerical Polynomial Algebra
• Algorithm 812: BPOLY
• A resultant matrix for scaled Bernstein polynomials
• Generalized polynomial bases and the Bézoutian