Structured matrix methods computing the greatest common divisor of polynomials (Q1678991): Difference between revisions

@@ Property / cites work @@
+Q5579582
@@ Property / cites work: Q5579582 / 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 @@
+Q3162294
@@ Property / cites work: Q3162294 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Version of the Euclidean Algorith
@@ Property / cites work: A New Version of the Euclidean Algorith / rank @@
+Normal rank
@@ Property / cites work @@
+Structured Matrix Based Methods for Approximate Polynomial GCD
+Normal rank
@@ Property / cites work @@
+Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
+Normal rank
@@ Property / cites work @@
+Q3653570
@@ Property / cites work: Q3653570 / rank @@
+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 @@
+Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
+Normal rank
@@ Property / cites work @@
+Rank and null space calculations using matrix decomposition without column interchanges
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+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 @@
+Q3902876
@@ Property / cites work: Q3902876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3447170
@@ Property / cites work: Q3447170 / rank @@
+Normal rank
@@ Property / cites work @@
+A matrix pencil based numerical method for the computation of the GCD of polynomials
+Normal rank
@@ Property / cites work @@
+Q4229394
@@ Property / cites work: Q4229394 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227320
@@ Property / cites work: Q4227320 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of the GCD of polynomials using gaussian transformations and shifting
+Normal rank
@@ Property / cites work @@
+Resultant properties of gcd of many polynomials and a factorization representation of gcd
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Comparison of algorithms for calculation of g.c.d. of polynomials
+Normal rank
@@ Property / cites work @@
+Q5659396
@@ Property / cites work: Q5659396 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
+Normal rank
@@ Property / cites work @@
+On rank and null space computation of the generalized Sylvester matrix
+Normal rank
@@ Property / cites work @@
+Polynomial computations for blind image deconvolution
+Normal rank
@@ Property / cites work @@
+The calculation of the degree of an approximate greatest common divisor of two polynomials
+Normal rank
@@ Property / cites work @@
+Linear multivariable control. A geometric approach
+Normal rank