A unified approach to resultant matrices for Bernstein basis polynomials
From MaRDI portal
Publication:735500
DOI10.1016/j.cagd.2007.09.004zbMath1172.65350OpenAlexW1992370024MaRDI QIDQ735500
Publication date: 22 October 2009
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2007.09.004
Related Items
High-order quadrature on multi-component domains implicitly defined by multivariate polynomials, Spiral transitions, Bernstein Bézoutians and application to intersection problems, The Bernstein polynomial basis: a centennial retrospective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bernstein-Bézoutian matrices
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- The Cayley method in computer aided geometric design
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
- Euclidean remainders for generalized polynomials
- The transformation of the companion matrix resultant between the power and Bernstein polynomial bases.
- A companion matrix resultant for Bernstein polynomials
- Multivariate polynomials, duality, and structured matrices
- Structured total least norm and approximate GCDs of inexact polynomials
- The numerical condition of univariate and bivariate degree elevated Bernstein polynomials
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
- Computing multiple roots of inexact polynomials