Abstract
In this paper, a method is proposed to obtain a balanced minimal realization of a stable rational transfer function matrix. The Allison-Young algorithm for the interpolation problems is directly extended to matrix value cases and is applied in the realization procedure. This method uses the finite matrix of a Sarason operator instead of the infinite block Hankel matrix and the coefficients of the transfer function matrix instead of any initial realization. The advantage of this approach in connection with the solution of L∞-optimization problems and the balanced realization is also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 701-705 |
| Number of pages | 5 |
| Journal | Automatica |
| Volume | 24 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1988 Jan 1 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Balanced minimal realization via singular value decomposition of Sarason operator'. Together they form a unique fingerprint.
Cite this
Tsai, M-C., & Shih, Y. P. (1988). Balanced minimal realization via singular value decomposition of Sarason operator. Automatica, 24(5), 701-705. https://doi.org/10.1016/0005-1098(88)90119-7