Comparison of algorithms for calculation of g.c.d. of polynomials
From MaRDI portal
Publication:5668674
DOI10.1080/00207727308920007zbMath0253.93014OpenAlexW2020156690MaRDI QIDQ5668674
No author found.
Publication date: 1973
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207727308920007
Linear systems in control theory (93C05) Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
A compound matrix algorithm for the computation of the Smith form of a polynomial matrix ⋮ Computation of the GCD of polynomials using gaussian transformations and shifting ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Unified adaptive control of non-minimum-phase systems Part 2. Target tracking and dynamic compensation ⋮ Normal factorisation of polynomials and computational issues. ⋮ Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance ⋮ Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ On rank and null space computation of the generalized Sylvester matrix ⋮ On the Computation of the GCD of 2-D Polynomials ⋮ Algorithms for symbolic reduction of signal flow graphs. ⋮ Numerically stable algorithm for transfer function matrix evaluation ⋮ Computation of approximate polynomial GCDs and an extension ⋮ Part I-Smith form and common divisor of polynomial matrices ⋮ Part II Minimal realization
Cites Work
- Greatest common divisor of two polynomials
- Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation
- A new method for solving polynomial equations
- Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
- A note on the automatic pretreatment of polynomials
- A New Version of the Euclidean Algorith
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparison of algorithms for calculation of g.c.d. of polynomials
