Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857): Difference between revisions

Latest revision as of 11:17, 27 June 2024

scientific article; zbMATH DE number 5207425

Language	Label	Description	Also known as
English	Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance	scientific article; zbMATH DE number 5207425

Statements

instance of

scholarly article

0 references

title

Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (English)

0 references

author

Dimitrios Triantafyllou

0 references

Nicos Karcanias

0 references

Marilena Mitrouli

0 references

published in

International Journal of Control

0 references

publication date

31 October 2007

0 references

zbMATH Keywords

numerical examples

0 references

greatest common divisor

0 references

polynomials

0 references

matrix pencil methods

0 references

error analysis

0 references

algorithms

0 references

symbolical programming

0 references

stability

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/00207170600725701

0 references

cites work

A New Version of the Euclidean Algorith

0 references

Rang revealing QR factorizations

0 references

Resultant properties of gcd of many polynomials and a factorization representation of gcd

0 references

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

0 references

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

0 references

Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

0 references

A Rank-Revealing Method with Updating, Downdating, and Applications

0 references

Computation of the GCD of polynomials using gaussian transformations and shifting

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

Q3897591

0 references

Approximate GCD and its application to ill-conditioned algebraic equations

0 references

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

0 references

Quasi-gcd computations

0 references

A subspace method for the computation of the GCD of polynomials

0 references

Generalized Resultant Theorem

0 references

Identifiers

zbMATH Open document ID

1125.65041

0 references

DOI

10.1080/00207170600725701

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5423857

@@ Property / author @@
-Q163546
@@ Property / author: Q163546 / rank @@
-Normal rank
@@ Property / author @@
-Marilena Mitrouli
@@ Property / author: Marilena Mitrouli / rank @@
-Normal rank
@@ Property / author @@
+Nicos Karcanias
@@ Property / author: Nicos Karcanias / rank @@
+Normal rank
@@ Property / author @@
+Marilena Mitrouli
@@ Property / author: Marilena Mitrouli / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207170600725701
+Normal rank
@@ Property / OpenAlex ID @@
+W2140382237
@@ Property / OpenAlex ID: W2140382237 / 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 @@
+Rang revealing QR factorizations
@@ Property / cites work: Rang revealing QR factorizations / rank @@
+Normal rank
@@ Property / cites work @@
+Resultant properties of gcd of many polynomials and a factorization representation of gcd
+Normal rank
@@ Property / cites work @@
+Invariance properties, and characterization of the greatest common divisor of a set of polynomials
+Normal rank
@@ Property / cites work @@
+A matrix pencil based numerical method for the computation of the GCD of polynomials
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
+Normal rank
@@ Property / cites work @@
+A Rank-Revealing Method with Updating, Downdating, and Applications
+Normal rank
@@ Property / cites work @@
+Computation of the GCD of polynomials using gaussian transformations and shifting
+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 @@
+Q3897591
@@ Property / cites work: Q3897591 / rank @@
+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 @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+A subspace method for the computation of the GCD of polynomials
+Normal rank
@@ Property / cites work @@
+Generalized Resultant Theorem
@@ Property / cites work: Generalized Resultant Theorem / rank @@
+Normal rank