GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6406666
@@ Property / title @@
+GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68195
@@ Property / zbMATH Open document ID: 1308.68195 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/1940475.1940509
@@ Property / DOI: 10.1145/1940475.1940509 / rank @@
+Normal rank
@@ Property / published in @@
+ACM Communications in Computer Algebra
@@ Property / published in: ACM Communications in Computer Algebra / rank @@
+Normal rank
@@ Property / publication date @@
+February 2015Timestamp +2015-02-20T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-02-20T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 20 February 2015 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6406666
@@ Property / zbMATH DE Number: 6406666 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GPGCD
@@ Property / describes a project that uses: GPGCD / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1937717232
@@ Property / OpenAlex ID: W1937717232 / 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 @@
+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 @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / 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 @@
+QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
+Normal rank
@@ Property / cites work @@
+DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+Q4232503
@@ Property / cites work: Q4232503 / 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 @@
+An iterative method for calculating approximate GCD of univariate polynomials
+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 @@
+The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
+Normal rank
@@ Property / cites work @@
+An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
+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 @@
+Q4348513
@@ Property / cites work: Q4348513 / rank @@
+Normal rank

Latest revision as of 04:05, 3 July 2024

scientific article; zbMATH DE number 6406666

GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials

Language	Label	Description	Also known as
English	GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials	scientific article; zbMATH DE number 6406666	GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials