𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pole assignment, a new proof and algorithm

✍ Scribed by Rikus Eising

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
349 KB
Volume
2
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper a new proof of the pol e assignment theorem is given. This proof is a very straightforward one. II is not based on canoni cal forms and also rhe reduction IO the single input case (Heymann's lemma) is not used. Furthermore. an algorithm is given which allows IO take into account numerical aspects with respect IO the feedback construction for the multi-input case. Furthermore rhe non-uniqueness of the feedback matrix i n the multi-input case may be exploited i n order IO reduce the gains.

πŸ“œ SIMILAR VOLUMES

Reduced order observers: A new algorithm
Reduced order observers: A new algorithm and proof
✍ Paul Van Dooren πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 505 KB

This paper gives a new recursive algorithm l o construct a reduced order observer (with prescribed spectrum) of a given observabl e system. The method is based on the staircase form and implicitly gives a new proof for the existence of such reduced order observers. Kqvwords: Numerical methods, Reduc

Some new results for system decoupling a
Some new results for system decoupling and pole assignment problems
✍ Musheng Wei; Qian Wang; Xuehan Cheng πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 438 KB

In a related article, we derived a canonical decomposition of the right invertible system {C, A, B} and applied this canonical decomposition to study the Smith form of the matrix pencil and findout the finite zeros and infinite zeros of P(s), the range of the ranks of P(s) for s ∈ C, and the contro