Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
From MaRDI portal
Publication:3599994
Recommendations
- An application of fast factorization algorithms in computer aided geometric design
- A unified approach to resultant matrices for Bernstein basis polynomials
- Bernstein-Bézoutian matrices
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Computational experiments with resultants for scaled Bernstein polynomials
Cited in
(11)- Interpolation and convergence of Bernstein-Bézier coefficients
- The Bernstein polynomial basis: a centennial retrospective
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- An application of fast factorization algorithms in computer aided geometric design
- Linearizations of matrix polynomials in Bernstein bases
- A unified approach to resultant matrices for Bernstein basis polynomials
- A framework for structured linearizations of matrix polynomials in various bases
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- The Bézout matrix for Hermite interpolants
- Bernstein Bézoutians and application to intersection problems
- scientific article; zbMATH DE number 176580 (Why is no real title available?)
This page was built for publication: Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599994)