Abstract
A new technique is presented for partial pole placement of linear time-invariant systems. It is almost always possible to arbitrarily assign min(n,φ) poles using this’ new method. Here n is the order’ of the system, and φ Δ max(m,ℓ) + ⌊max(m, ℓ)/2⌋ +... + ⌊max(m ℓ)/min (m,ℓ)⌋ where m and C are the number of inputs and outputs, respectively, and 1.1 denotes the nearest integer lower than or equal to (ie. floor(.)). Only the normal procedures of linear algebra are required to implement the technique. We note that φ ≥ m + ℓ- 1, which has been a long-standing barrier for linear algebra methods in the partial pole placement problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1722-1727 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 2 |
| DOIs | |
| Publication status | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 37th IEEE Conference on Decision and Control (CDC) - Tampa, FL, USA Duration: 16 Dec 1998 → 18 Dec 1998 |
Bibliographical note
Publisher Copyright:© 1998 IEEE.
Keywords
- Output Feedback
- Pole Assignment
- Pole Retainment
Fingerprint
Dive into the research topics of 'A New Technique for Partial Pole Placement using Constant Output-Feedback'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver