Generalised resultants, dynamic polynomial combinants and the minimal design problem

DOI10.1080/00207179.2013.791402zbMath1311.93034OpenAlexW2129467262MaRDI QIDQ5252968

Nicos Karcanias

Publication date: 3 June 2015

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/7287/1/%28249%29%20General%20Resultants%20Dyn%20Comb%20%26%20Minimal%20Design%20%28NK%29%2017-01-13.pdf

zbMATH Keywords

linear systemsminimal designgeneralized resultantsspectrum assignmentpolynomial combinants

Mathematics Subject Classification ID

Feedback control (93B52) Linear systems in control theory (93C05) Eigenvalue problems (93B60) Pole and zero placement problems (93B55)

Related Items

Solution of the determinantal assignment problem using the Grassmann matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new sufficient condition for arbitrary pole placement by real constant output feedback
• Dynamic pole assignment using global, blow up linearization: Low complexity solutions
• Global asymptotic linearisation of the pole placement map: A closed-form solution for the constant output feedback problem
• 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
• Multivariable Nyquist criteria, root loci, and pole placement: A geometric viewpoint
• Applications of algebraic geometry to systems theory--Part I
• Pole mobility and minimal norm stabilization of SISO systems under bounded state feedback
• Resultant properties of gcd of many polynomials and a factorization representation of gcd

This page was built for publication: Generalised resultants, dynamic polynomial combinants and the minimal design problem