It is known that the Berlekamp-Massey algorithm from information theory can be used to compute scalar minimal partial realizations. Recently, it has been interpreted in terms of exact modeling of behaviors. In this paper, we extend these results to the multivariable case. We put the behavioral theor
A minimal lattice realization for multivariable systems
β Scribed by Kazumi Horiguchi; Takuya Nishimura; Akira Nagata
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 408 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The ΓΏrst method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal
The prevailing framework for robust stability and performance analysis requires that the uncertain system be written as a linear fractional transformation of the uncertain parameters. This problem is algebraically equivalent to the problem of deriving the state space realization for a multidimension