Approximate zero polynomials of polynomial matrices and linear systems
From MaRDI portal
Publication:389575
DOI10.1016/j.laa.2012.12.027zbMath1305.15050OpenAlexW2038937687MaRDI QIDQ389575
Nicos Karcanias, George D. Halikias
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.12.027
Sensitivity (robustness) (93B35) Linear systems in control theory (93C05) Matrices over function rings in one or more variables (15A54) Linear equations (linear algebraic aspects) (15A06)
Related Items (2)
Nearest common root of a set of polynomials: a structured singular value approach ⋮ The feedback invariant measures of distance to uncontrollability and unobservability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Between controllable and uncontrollable
- The ERES method for computing the approximate GCD of several polynomials
- Fast projection methods for minimal design problems in linear system theory
- Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
- Necessary and sufficient conditions for zero assignment by constant squaring down
- Grassmann invariants, matrix pencils, and linear system properties
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- On the basis matrix characterization of controllability subspaces
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Matrix pencil characterization of almost ( A, Z) -invariant subspaces : A classification of geometric concepts
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Structured squaring down and zero assignment
- Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems
- Computing the distance to an uncontrollable system
- Geometric approach to analysis and synthesis of system zeros Part 2. Non-square systems
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- Resultant properties of gcd of many polynomials and a factorization representation of gcd
- Dynamical indices of a transfer function matrix
- Computation of the GCD of polynomials using gaussian transformations and shifting
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
This page was built for publication: Approximate zero polynomials of polynomial matrices and linear systems