An iterative pole-placement algorithm
From MaRDI portal
Publication:3677592
DOI10.1080/0020718508961172zbMATH Open0563.93028OpenAlexW2043934333MaRDI QIDQ3677592FDOQ3677592
Publication date: 1985
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020718508961172
Recommendations
- An iterative algorithm for pole placement by output feedback
- Non-iterative pole placement technique: a step further
- Efficient recursive adaptive pole placement algorithm
- A unified method for optimal arbitrary pole placement
- Approximate pole placement by involution and vector decomposition
- A robust periodic pole assignment algorithm
- scientific article; zbMATH DE number 27319
- scientific article
- An algorithm for robust pole assignment via polynomial approach
- An algorithm for the multiinput pole assignment problem
Numerical optimization and variational techniques (65K10) Decomposition methods (49M27) Large-scale systems (93A15) Pole and zero placement problems (93B55)
Cites Work
Cited In (10)
- Recursive approach to assigning eigenstructure in linear systems
- Parallel and large-scale matrix computations in control: Some ideas
- Construction and parametrization of a class of minimum-time deadbeat controllers
- An iterative algorithm for pole placement by output feedback
- Recursive eigenstructure assignment in linear systems
- Robust eigenstructure assignment for multi-input systems
- On 2-D pole placement
- A unified method for optimal arbitrary pole placement
- Non-iterative pole placement technique: a step further
- A new iterative algorithm for block-diagonalization of discrete-time systems
This page was built for publication: An iterative pole-placement algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677592)
