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

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

Statements

instance of

scholarly article

0 references

title

GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (English)

0 references

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

0 references

author

Akira Terui

0 references

published in

Computer Algebra in Scientific Computing

0 references

ACM Communications in Computer Algebra

0 references

publication date

10 September 2010

0 references

20 February 2015

0 references

full work available at URL

https://arxiv.org/abs/1007.1836

0 references

describes a project that uses

MultRoot

0 references

GPGCD

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials

0 references

Q4008406

0 references

Quasi-gcd computations

0 references

Q4227296

0 references

Certified approximate univariate GCDs

0 references

&lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials

0 references

QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients

0 references

DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS

0 references

Computation of approximate polynomial GCDs and an extension

0 references

Q4232503

0 references

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

0 references

Q3447170

0 references

On approximate GCDs of univariate polynomials

0 references

An iterative method for calculating approximate GCD of univariate polynomials

0 references

A geometric method in nonlinear programming

0 references

The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

0 references

An algorithm for computing certified approximate GCD of $n$ univariate polynomials

0 references

GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

0 references

Q4348513

0 references

Identifiers

zbMATH Open document ID

1290.68139

0 references

1308.68195

0 references

DOI

10.1007/978-3-642-15274-0_22

0 references

10.1145/1940475.1940509

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3587712

@@ 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