Guaranteed stability with subspace methods
Maciejowski J.M.
Systems and Control Letters, Volume 26, Pages 153-156, 1995Abstract
We show how stability of models can be guaranteed when using the class of identification algorithms which have become known as `subspace methods'. In many of these methods the `A' matrix is obtained (or can be obtained) as the product of a shifted matrix with a pseudo-inverse. We show that whenever the shifted matrix is formed by introducing one block of zeros in the appropriate position, then a stable model results. The cost of this is some (possibly large) distortion of the results, but in some applications that is outweighed by the advantage of guaranteed stability.
Pre-Prints
[PDF]
BibTex Entry
- @Article{,
- author = {Maciejowski J.M.},
- journal = {Systems and Control Letters},
- title = {Guaranteed stability with subspace methods},
- year = {1995},
- pages = {153-156},
- volume = {26}
- }
|
![[Dept of Engineering]](http://www.eng.cam.ac.uk/images/house_style/engban-s.gif)
