The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191): Difference between revisions

@@ Property / author @@
+Winkler, Joab R.
@@ Property / author: Winkler, Joab R. / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MultRoot
@@ Property / describes a project that uses: MultRoot / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2968119093
@@ Property / OpenAlex ID: W2968119093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3309525
@@ Property / cites work: Q3309525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5301644
@@ Property / cites work: Q5301644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3162294
@@ Property / cites work: Q3162294 / rank @@
+Normal rank
@@ Property / cites work @@
+The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
+Normal rank
@@ Property / cites work @@
+A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
+Normal rank
@@ Property / cites work @@
+Blind image deconvolution via fast approximate GCD
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+Structured matrix methods for the computation of multiple roots of a polynomial
+Normal rank
@@ Property / cites work @@
+Polynomial computations for blind image deconvolution
+Normal rank
@@ Property / cites work @@
+Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
+Normal rank
@@ Property / cites work @@
+Structured total least norm and approximate GCDs of inexact polynomials
+Normal rank
@@ Property / cites work @@
+An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
+Normal rank
@@ Property / cites work @@
+Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
+Normal rank
@@ Property / cites work @@
+The computation of multiple roots of a polynomial
@@ Property / cites work: The computation of multiple roots of a polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
+Normal rank
@@ Property / cites work @@
+Computing multiple roots of inexact polynomials
@@ Property / cites work: Computing multiple roots of inexact polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q5629775
@@ Property / cites work: Q5629775 / rank @@
+Normal rank
@@ Property / cites work @@
+Greatest common divisors from generalized sylvester resultant matrices
+Normal rank
@@ Property / cites work @@
+Structured matrix methods computing the greatest common divisor of polynomials
+Normal rank
@@ Property / cites work @@
+Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
+Normal rank
@@ Property / cites work @@
+An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
+Normal rank
@@ Property / cites work @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards factoring bivariate approximate polynomials
+Normal rank
@@ Property / cites work @@
+Approximate factorization of multivariate polynomials via differential equations
+Normal rank
@@ Property / cites work @@
+Approximate factorization of multivariate polynomials using singular value decomposition
+Normal rank
@@ Property / cites work @@
+On the numerical condition of polynomials in Bernstein form
+Normal rank