Nearest common root of a set of polynomials: a structured singular value approach

DOI10.1016/J.LAA.2019.09.005MaRDI QIDQ2332430zbMATH OpenOpenAlexFDO

Authors Olga Limantseva, George Halikias, Nicos Karcanias

Publication date 4 November 2019

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://openaccess.city.ac.uk/id/eprint/22993/8/Nearest_common_root.pdf

zbMATH Keywords

almost common rootapproximate GCDdistance to singularitystructured singular valueSylvester resultant matrix

Mathematics Subject Classification ID

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

Recommendations

• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
• scientific article; zbMATH DE number 1254271
• scientific article; zbMATH DE number 1262454
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• An ODE-based method for computing the approximate greatest common divisor of polynomials

Cites work

• A matrix pencil based numerical method for the computation of the GCD of polynomials
• A novel iterative method to approximate structured singular values
• An algorithm for computing certified approximate GCD of n univariate polynomials
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Approximate zero polynomials of polynomial matrices and linear systems
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Computational complexity of μ calculation
• Generalized Resultant Theorem
• Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems
• Greatest common divisor via generalized Sylvester and Bezout matrices
• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 3355217 (Why is no real title available?)
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
• Necessary and sufficient conditions for zero assignment by constant squaring down
• Normal factorisation of polynomials and computational issues.
• On structured singular values of reciprocal matrices
• On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
• Properties of the mixed μ problem and its bounds
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link
• The complex structured singular value
• The ERES method for computing the approximate GCD of several polynomials
• The greatest common divisor of a set of polynomials, control theory and approximate algebraic computations
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

Cited in

(3)

• Overdetermined Weierstrass iteration and the nearest consistent system
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
• The feedback invariant measures of distance to uncontrollability and unobservability

Describes a project that uses

Uses Software

• Mu Analysis and Synthesis Toolbox

This page was built for publication: Nearest common root of a set of polynomials: a structured singular value approach

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