The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain

DOI10.1016/j.apnum.2021.04.011zbMath1472.65021OpenAlexW3154357399MaRDI QIDQ2029179

Yi Su, Martin Bourne, Winkler, Joab R.

Publication date: 3 June 2021

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2021.04.011

zbMATH Keywords

Bernstein polynomialsSylvester resultant matrixapproximate greatest common divisorsubresultant matrices

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Cites Work

• Unnamed Item
• Unnamed Item
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• Algorithms for polynomials in Bernstein form
• Approximate GCD and its application to ill-conditioned algebraic equations
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• Approximate factorization of multivariate polynomials using singular value decomposition
• Towards factoring bivariate approximate polynomials
• Using multivariate resultants to find the intersection of three quadric surfaces
• Factoring multivariate polynomials via partial differential equations
• The Computation of Multiple Roots of a Bernstein Basis Polynomial

This page was built for publication: The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain