Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
From MaRDI portal
Publication:1950216
DOI10.1016/j.cagd.2013.01.003zbMath1296.65031OpenAlexW1986297032MaRDI QIDQ1950216
Publication date: 10 May 2013
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2013.01.003
Sylvester resultant matrixapproximate greatest common divisorBernstein basis polynomialsBézout resultant matrix
Symbolic computation and algebraic computation (68W30) Computer-aided design (modeling of curves and surfaces) (65D17) Solving polynomial systems; resultants (13P15)
Related Items (12)
Relaxed NewtonSLRA for approximate GCD ⋮ High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ 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 ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Detecting symmetries in polynomial Bézier curves
This page was built for publication: Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
