Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
From MaRDI portal
Recommendations
Cites work
- A companion matrix resultant for Bernstein polynomials
- A resultant matrix for scaled Bernstein polynomials
- Algorithm 812: BPOLY
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- Division of generalized polynomials using the comrade matrix
- Euclidean remainders for generalized polynomials
- Generalized polynomial bases and the Bézoutian
- Greatest common divisor of generalized polynomials and polynomial matrices
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 4214646 (Why is no real title available?)
- Numerical Polynomial Algebra
- On computing polynomial GCDs in alternate bases
- On the optimal stability of the Bernstein basis
- Polynomial algorithms in computer algebra
- Polynomial evaluation and interpolation on special sets of points
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
Cited in
(3)
This page was built for publication: Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597981)
