An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain

DOI10.1016/J.CAM.2020.113381MaRDI QIDQ2226320zbMATH OpenOpenAlexFDO

Authors Martin Bourne, Yi Su, Joab R. Winkler

Publication date 12 February 2021

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

Full work available at URL https://eprints.whiterose.ac.uk/170804/1/Revised%20Bourne%20Winkler%20Yi.pdf

zbMATH Keywords

approximate greatest common divisorbivariate Bernstein basis polynomialSylvester resultant matrix and subresultant matrices

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

Cites work

• scientific article; zbMATH DE number 40793 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• 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
• Factoring multivariate polynomials via partial differential equations
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
• Structured Total Least Norm for Nonlinear Problems
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• Towards factoring bivariate approximate polynomials
• Using multivariate resultants to find the intersection of three quadric surfaces

Cited in

(4)

• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
• An application of fast factorization algorithms in computer aided geometric design
• Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis

This page was built for publication: An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain

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