Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881): Difference between revisions

@@ Property / cites work @@
+Q5301644
@@ Property / cites work: Q5301644 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured Matrix Based Methods for Approximate Polynomial GCD
+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 @@
+The ERES method for computing the approximate GCD of several polynomials
+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 @@
+Q3837876
@@ Property / cites work: Q3837876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3162299
@@ Property / cites work: Q3162299 / rank @@
+Normal rank
@@ Property / cites work @@
+Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
+Normal rank
@@ Property / cites work @@
+Q4717942
@@ Property / cites work: Q4717942 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+An ODE-based method for computing the approximate greatest common divisor of polynomials
+Normal rank
@@ Property / cites work @@
+Computing the Nearest Rank-Deficient Matrix Polynomial
+Normal rank
@@ Property / cites work @@
+Stable and Efficient Algorithms for Structured Systems of Linear Equations
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
+Normal rank
@@ Property / cites work @@
+Q3447170
@@ Property / cites work: Q3447170 / rank @@
+Normal rank
@@ Property / cites work @@
+Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
+Normal rank
@@ Property / cites work @@
+Approximate polynomial GCD over integers
@@ Property / cites work: Approximate polynomial GCD over integers / rank @@
+Normal rank
@@ Property / cites work @@
+Extended QRGCD Algorithm
@@ Property / cites work: Extended QRGCD Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Q5590398
@@ Property / cites work: Q5590398 / rank @@
+Normal rank
@@ Property / cites work @@
+New fast Euclidean algorithms
@@ Property / cites work: New fast Euclidean algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4008406
@@ Property / cites work: Q4008406 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+Variable projection methods for approximate (greatest) common divisor computations
+Normal rank
@@ Property / cites work @@
+Approximate polynomial GCD: small degree and small height perturbations
+Normal rank
@@ Property / cites work @@
+The numerical greatest common divisor of univariate polynomials
+Normal rank