The greatest common divisor of a set of polynomials, control theory and approximate algebraic computations

MaRDI QIDQ3606313zbMATH OpenFDO

Authors Nicos Karcanias

Publication date 26 February 2009

zbMATH Keywords

approximate solutionscontrol theorycomputationsgreatest common divisor of polynomials

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Algebraic methods (93B25) Geometric methods (93B27)

Recommendations

• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Numerical and symbolical methods for the GCD of several polynomials
• Computation of approximate polynomial GCDs and an extension
• scientific article; zbMATH DE number 953021
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

Cited in

(2)

• Nearest common root of a set of polynomials: a structured singular value approach
• scientific article; zbMATH DE number 4145746 (Why is no real title available?)

This page was built for publication: The greatest common divisor of a set of polynomials, control theory and approximate algebraic computations

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