The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2513773657
@@ Property / OpenAlex ID: W2513773657 / 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 @@
+Bernstein-Bézoutian matrices
@@ Property / cites work: Bernstein-Bézoutian matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Computing curve intersection by means of simultaneous iterations
+Normal rank
@@ Property / cites work @@
+Q4232503
@@ Property / cites work: Q4232503 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+&amp;lt;tex&amp;gt;$QR$&amp;lt;/tex&amp;gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Scaling
@@ Property / cites work: Polynomial Scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 812: BPOLY
@@ Property / cites work: Algorithm 812: BPOLY / rank @@
+Normal rank
@@ Property / cites work @@
+Structured matrix methods for the computation of multiple roots of a polynomial
+Normal rank
@@ Property / cites work @@
+A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
+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 @@
+QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
+Normal rank