Nearest common root of a set of polynomials: a structured singular value approach
From MaRDI portal
Publication:2332430
DOI10.1016/j.laa.2019.09.005zbMath1478.93235OpenAlexW2972657769MaRDI QIDQ2332430
George D. Halikias, Olga Limantseva, 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
structured singular valueSylvester resultant matrixapproximate GCDdistance to singularityalmost common root
Sensitivity (robustness) (93B35) Perturbations in control/observation systems (93C73) Eigenvalue problems (93B60) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate zero polynomials of polynomial matrices and linear systems
- On structured singular values of reciprocal matrices
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- The ERES method for computing the approximate GCD of several polynomials
- Approximate GCD and its application to ill-conditioned algebraic equations
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- 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
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Normal factorisation of polynomials and computational issues.
- The complex structured singular value
- Necessary and sufficient conditions for zero assignment by constant squaring down
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Generalized Resultant Theorem
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- Computational complexity of μ calculation
- Resultant properties of gcd of many polynomials and a factorization representation of gcd
- Properties of the mixed μ problem and its bounds
- Computation of the GCD of polynomials using gaussian transformations and shifting
- On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
- A Novel Iterative Method To Approximate Structured Singular Values
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance