Pole assignment, a new proof and algorithm
From MaRDI portal
Publication:5905283
DOI10.1016/S0167-6911(82)80036-4zbMath0497.93017OpenAlexW2074683501MaRDI QIDQ5905283
Publication date: 1982
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6911(82)80036-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A direct algorithm for pole assignment of time-invariant multi-input linear systems using state feedback ⋮ Upper bounds for the distance between a controllable switched linear system and the set of uncontrollable ones ⋮ Pole assignment for systems over rings
Cites Work
- Unnamed Item
- Synthesis of linear systems with desired equivalent form
- The generalized eigenstructure problem in linear system theory
- Properties of numerical algorithms related to computing controllability
- A Schur method for pole assignment
- An algorithm for pole assignment of time invariant linear systems†
- Recursive simplification of pole-assignment problem in multi-input systems†
- Pole assignment, a new proof and algorithm
This page was built for publication: Pole assignment, a new proof and algorithm
