Nearest common root of polynomials, approximate greatest common divisor and the structured singular value

DOI10.1093/imamci/dns032zbMath1279.93042OpenAlexW2076058681MaRDI QIDQ5396892

No author found.

Publication date: 4 February 2014

Published in: IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/7289/1/%28242%29%20approx%20gcd%20IMAMCI%2024-09-12.pdf

zbMATH Keywords

structured singular valueSylvester resultant matrixdistance to singularitystructured approximationsapproximate common root of polynomialsapproximate greatest common divisor (GCD)

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Perturbations in control/observation systems (93C73) Eigenvalue problems (93B60) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (6)

Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Approximate zero polynomials of polynomial matrices and linear systems ⋮ Nearest Matrix Polynomials With a Specified Elementary Divisor ⋮ Rayleigh quotient methods for estimating common roots of noisy univariate polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ The feedback invariant measures of distance to uncontrollability and unobservability

This page was built for publication: Nearest common root of polynomials, approximate greatest common divisor and the structured singular value