The computation of the degree of the greatest common divisor of three Bernstein basis polynomials

DOI10.1016/j.cam.2019.112373zbMath1442.13090OpenAlexW2968119093MaRDI QIDQ1989191

Martin Bourne, Yi Su, Winkler, Joab R.

Publication date: 24 April 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/150086/8/BourneWinklerYi.pdf

zbMATH Keywords

greatest common divisorSylvester resultant matrixBernstein basis polynomials

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical linear algebra (65F99) Solving polynomial systems; resultants (13P15) Numerical algebraic geometry (65H14)

Related Items (3)

Conics in rational cubic Bézier form made simple ⋮ An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain ⋮ The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial computations for blind image deconvolution
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• The computation of multiple roots of a polynomial
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• On the numerical condition of polynomials in Bernstein form
• Structured matrix methods computing the greatest common divisor of polynomials
• Computation of approximate polynomial GCDs and an extension
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
• Structured matrix methods for the computation of multiple roots of a polynomial
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• Structured total least norm and approximate GCDs of inexact polynomials
• Approximate factorization of multivariate polynomials using singular value decomposition
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Blind image deconvolution via fast approximate GCD
• Towards factoring bivariate approximate polynomials
• Greatest common divisors from generalized sylvester resultant matrices
• Computing multiple roots of inexact polynomials
• Approximate factorization of multivariate polynomials via differential equations

This page was built for publication: The computation of the degree of the greatest common divisor of three Bernstein basis polynomials