GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2012.10.023
@@ Property / DOI: 10.1016/j.tcs.2012.10.023 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+mctoolbox
@@ Property / describes a project that uses: mctoolbox / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ApaTools
@@ Property / describes a project that uses: ApaTools / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MultRoot
@@ Property / describes a project that uses: MultRoot / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GPGCD
@@ Property / describes a project that uses: GPGCD / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2167303512
@@ Property / OpenAlex ID: W2167303512 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0630
@@ Property / arXiv ID: 1207.0630 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
+Normal rank
@@ Property / cites work @@
+Q3162294
@@ Property / cites work: Q3162294 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
@@ Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank @@
+Normal rank
@@ Property / cites work @@
+A subdivision method for computing nearest gcd with certification
+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 @@
+Q4348513
@@ Property / cites work: Q4348513 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+Accuracy and Stability of Numerical Algorithms
@@ Property / cites work: Accuracy and Stability of Numerical Algorithms / rank @@
+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 @@
+On approximate GCDs of univariate polynomials
@@ Property / cites work: On approximate GCDs of univariate polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q5491447
@@ Property / cites work: Q5491447 / rank @@
+Normal rank
@@ Property / cites work @@
+On Computations with Dense Structured Matrices
@@ Property / cites work: On Computations with Dense Structured Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
+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 @@
+A geometric method in nonlinear programming
@@ Property / cites work: A geometric method in nonlinear programming / rank @@
+Normal rank
@@ Property / cites work @@
+GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
+Normal rank
@@ Property / cites work @@
+An iterative method for calculating approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
+Normal rank
@@ Property / cites work @@
+QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
+Normal rank
@@ Property / cites work @@
+Q3514380
@@ Property / cites work: Q3514380 / rank @@
+Normal rank
@@ Property / cites work @@
+The numerical greatest common divisor of univariate polynomials
+Normal rank
@@ Property / cites work @@
+DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2012.10.023
@@ Property / DOI: 10.1016/J.TCS.2012.10.023 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:385007