Generalized minimal realization of transfer-function matrices
- 1 May 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 25 (5) , 785-803
- https://doi.org/10.1080/00207177708922269
Abstract
An efficient minimal realization technique that is based on the dyadic expansion of transfer-function matrices is introduced. The proposed algorithm is fundamental and straightforward in the sense that it does not require the solution of sets of equations or any polynomial manipulations and it can therefore overcome the need for using the computer, even in problems of relatively high order. The cases of both distinct and multiple poles are rigorously treated and a detailed algorithm is given which is illustrated by two examples. A reduction in digital computation time of the order of 1 : 10 compared with other realization algorithms has been achieved.Keywords
This publication has 5 references indexed in Scilit:
- A generalized-Jordan-form-approach one-step irreducible realization of matricesIEEE Transactions on Automatic Control, 1974
- Minimal realisation of transfer-function matrices using the system matrixProceedings of the Institution of Electrical Engineers, 1971
- A computer program for the minimal realization of transfer function matricesIEEE Transactions on Automatic Control, 1969
- Computation of minimal representations of a rational transfer-function matrixProceedings of the Institution of Electrical Engineers, 1968
- Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systemsInformation and Control, 1967