This paper presents an extension of Gauthier’s algorithm, which solves the problem of searching for the multivariable minimal realization starting from square transference matrices. Previously, the algorithm incorporates the coprime fractions developed with Silvester matrices and qr factorization. Since the coprime fractions have a special relation with matrices in polynomial fraction, they show their differences by analyzing them independently. The general features are set out, and the developed functions named, in order to emphasize the different search paths and their representation in state space (neither of which are not unique) for the coprime fraction. For demonstration we used a multivariable dynamic system, where the efficiency and limitations of the developed algorithm are checked based on the functions performed with the Matlab® Control Toolbox
Algorithms, matrix, multivariate analysisAlgoritmos, matrices, análisis multivariante
CHEN, C. T. Linear system theory and design. 3th. ed. Oxford: Oxford University Press, 2009.
DE SCHUTTER, B. Minimal state-space realization in linear system theory: an overview. Journal of Computational and Applied Mathematics, Special Issue on Numerical Analysis in the 20th Century, 2000, vol. 121, núms. 1-2, pp. 331-354.
GAUTHIER, A. Formas canónicas: curso de sistemas lineales de múltiples variables [notas de clase]. Bogotá: Universidad de los Andes, 2008.
—. Identification recurrente des systemes multi-entrees, multi-sorties [These de doctorat]. Grenoble: Institut National Polytechnique de Grenoble, 1977.
PANOS, J. A. y ANTHONY, N. M. Polynomial matrix description and matrix fractional description of system. En: Linear systems. Boston: Birkhäuser, 2005.
POLAK, E. An algorithm for reducing a linear. time-invariant differential system to state form. IEEE Transactions on Automatic Control, 1966, vol. 11, núm. 3, pp. 577-579.
ROUGH, J. W. Linear system theory. New York: Prentice Hall, 1996.
SINHA, A. Linear systems optimal and robust control. Boca Ratón: CRC Press, 2007.