Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials

MaRDI QIDQ5432212zbMATH OpenFDO

Authors John D. Allan, Joab R. Winkler

Publication date 2 January 2008

Mathematics Subject Classification ID

Matrices of integers (15B36) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• Structured total least norm and approximate GCDs of inexact polynomials
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

Cited in

(7)

• A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• Approximate GCD by bernstein basis, and its applications
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

This page was built for publication: Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432212)