The general problem of pole assignment: A polynomial equation approach
From MaRDI portal
Publication:3347727
DOI10.1109/TAC.1985.1103920zbMATH Open0558.93036MaRDI QIDQ3347727FDOQ3347727
Authors: Vladimír Kučera, Petr Zagalak 
Publication date: 1985
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 911777
- scientific article; zbMATH DE number 5123601
- scientific article; zbMATH DE number 270248
- An algorithm for robust pole assignment via polynomial approach
- Perturbation Analysis of the Pole Assignment Problem
- The resolution of the equation \(XA+XBX=HX\) and the pole assignment problem: a general approach
- On the pole placement problem for linear systems of arbitrary genus
- Some results on the genericity of the pole placement problem
- On pole structure assignment in linear systems
- Pole assignment at infinity and polynomial matrix equations
Pole and zero placement problems (93B55) Linear systems in control theory (93C05) Algebraic methods (93B25) Equations in general fields (12E12)
Cited In (11)
- Consistent systems and pole assignment: I
- Eigenstructure assignment in linear geometric control
- Title not available (Why is that?)
- A majorization condition for multi-input networked stabilization via coding/control codesign
- A polynomial approach to the invariant factors assignment problem via state feedback and output injection
- On the sufficient conditions for the equality of the unassignable polynomial and Davison's fixed polynomial of strongly connected systems
- On the complete controllability indexes assignment problem
- Perturbation Analysis of the Pole Assignment Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The general problem of pole assignment: A polynomial equation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347727)
