Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181): Difference between revisions

Latest revision as of 20:55, 8 July 2024

scientific article

Language	Label	Description	Also known as
English	Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials	scientific article

Statements

instance of

scholarly article

0 references

title

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (English)

0 references

zbMATH Open document ID

1293.12007

0 references

DOI

10.1016/j.cam.2013.09.021

0 references

published in

Journal of Computational and Applied Mathematics

0 references

publication date

5 August 2014

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

univariate real polynomials

0 references

greatest common divisor

0 references

shifting operation

0 references

numerical stability

0 references

0 references

0 references

0 references

describes a project that uses

MultRoot

0 references

ERES

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cam.2013.09.021

0 references

0 references

0 references

A New Version of the Euclidean Algorith

0 references

On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

0 references

Comparison of algorithms for calculation of g.c.d. of polynomials

0 references

Quasi-gcd computations

0 references

Approximate GCD and its application to ill-conditioned algebraic equations

0 references

Q4232503

0 references

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

0 references

Certified approximate univariate GCDs

0 references

On approximate GCDs of univariate polynomials

0 references

Computation of approximate polynomial GCDs and an extension

0 references

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

0 references

Computing multiple roots of inexact polynomials

0 references

Q5301644

0 references

The calculation of the degree of an approximate greatest common divisor of two polynomials

0 references

Q5629775

0 references

Greatest common divisors from generalized sylvester resultant matrices

0 references

An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials

0 references

Invariance properties, and characterization of the greatest common divisor of a set of polynomials

0 references

Computation of the GCD of polynomials using gaussian transformations and shifting

0 references

Q2785714

0 references

The ERES method for computing the approximate GCD of several polynomials

0 references

Q3653570

0 references

Q3359644

0 references

Q3850185

0 references

Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies

0 references

Numerical and Symbolical Methods for the GCD of Several Polynomials

0 references

A matrix pencil based numerical method for the computation of the GCD of polynomials

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2511181

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cam.2013.09.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2144236383
@@ Property / OpenAlex ID: W2144236383 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3234138
@@ Property / cites work: Q3234138 / 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 @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+Comparison of algorithms for calculation of g.c.d. of polynomials
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Q4232503
@@ Property / cites work: Q4232503 / 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 @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / 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 @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
+Normal rank
@@ Property / cites work @@
+Computing multiple roots of inexact polynomials
@@ Property / cites work: Computing multiple roots of inexact polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q5301644
@@ Property / cites work: Q5301644 / rank @@
+Normal rank
@@ Property / cites work @@
+The calculation of the degree of an approximate greatest common divisor of two polynomials
+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 @@
+An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
+Normal rank
@@ Property / cites work @@
+Invariance properties, and characterization of the greatest common divisor of a set of polynomials
+Normal rank
@@ Property / cites work @@
+Computation of the GCD of polynomials using gaussian transformations and shifting
+Normal rank
@@ Property / cites work @@
+Q2785714
@@ Property / cites work: Q2785714 / rank @@
+Normal rank
@@ Property / cites work @@
+The ERES method for computing the approximate GCD of several polynomials
+Normal rank
@@ Property / cites work @@
+Q3653570
@@ Property / cites work: Q3653570 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3359644
@@ Property / cites work: Q3359644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3850185
@@ Property / cites work: Q3850185 / rank @@
+Normal rank
@@ Property / cites work @@
+Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
+Normal rank
@@ Property / cites work @@
+Numerical and Symbolical Methods for the GCD of Several Polynomials
+Normal rank
@@ Property / cites work @@
+A matrix pencil based numerical method for the computation of the GCD of polynomials
+Normal rank