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

DOI10.1080/00207727308920007MaRDI QIDQ5668674zbMATH OpenOpenAlexFDO

Authors

Publication date 1973

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207727308920007

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05) Linear systems in control theory (93C05)

Cites work

• A new method for solving polynomial equations
• A New Version of the Euclidean Algorith
• A note on the automatic pretreatment of polynomials
• Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
• Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation
• Greatest common divisor of two polynomials
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3365976 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)

Cited in

(19)

• A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
• Normal factorisation of polynomials and computational issues.
• Algorithms for symbolic reduction of signal flow graphs.
• Structured matrix methods computing the greatest common divisor of polynomials
• Computation of approximate polynomial GCDs and an extension
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• Numerical and symbolical methods for the GCD of several polynomials
• On the computation of the GCD of 2-D polynomials
• Unified adaptive control of non-minimum-phase systems Part 2. Target tracking and dynamic compensation
• Numerically stable algorithm for transfer function matrix evaluation
• Part I-Smith form and common divisor of polynomial matrices
• Part II Minimal realization
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• On rank and null space computation of the generalized Sylvester matrix
• Structured ramp secret sharing schemata over rings of real polynomials
• The ERES method for computing the approximate GCD of several polynomials

This page was built for publication: Comparison of algorithms for calculation of g.c.d. of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668674)