Circuits, Systems and Signal Processing

, Volume 5, Issue 3, pp 371–387

A note on the genericity of simultaneous stabilizability and pole assignability

Authors

  • M. Vidyasagar
    • Department of Electrical EngineeringUniversity of Waterloo
  • B. C. Levy
    • Laboratory for Information and Decision SystemsMassachusetts Institute of Technology
  • N. Viswanadham
    • School of AutomationIndian Institute of Science
Article

DOI: 10.1007/BF01600068

Cite this article as:
Vidyasagar, M., Levy, B.C. & Viswanadham, N. Circuits Systems and Signal Process (1986) 5: 371. doi:10.1007/BF01600068

Abstract

In this paper we study the genericity of simultaneous stabilizability, simultaneous strong stabilizability, and simultaneous pole assignability, in linear multivariable systems. The main results of the paper had been previously established by Ghosh and Byrnes using state-space methods. In contrast, the proofs in the present paper are based on input-output arguments, and are much simpler to follow, especially in the case of simultaneous and simultaneous strong stabilizability. Moreover, the input-output methods used here suggest computationally reliable algorithms for solving these two types of problems. In addition to the main results, we also prove some lemmas on generic greatest common divisors which are of independent interest.

Copyright information

© Birkhäuser 1986