论文信息 - Coprime fraction computation of 2-D rational matrices

Coprime fraction computation of 2-D rational matrices

This note presents a numerical method of computing a coprime fraction of a two-dimensional (2-D) rational matrix, not necessarily proper. It is achieved by searching the primary linearly dependent rows, in order from top to bottom, of the two generalized resultants. The procedure can be extended to the three- or higher dimensional case and the result can also be used to compute the greatest common divisor (GCD) of 2-D polynomial matrices without employing primitive factorizations which does not exist in the three- or higher dimensional case.

Yhean-Sen Lai | Chi-Tsong Chen | Chi-tsong Chen | Y. Lai

[1] S. Żak,et al. On 2D proper transfer functions , 1982 .

[2] Yhean-sen Lai,et al. Reduction of 2-D rational functions , 1984 .

[3] S. Żak,et al. The simplified derivation of the completion theorem to a unimodular matrix over R[zl, z2] , 1985, IEEE Transactions on Automatic Control.

[4] Dante C. Youla,et al. Notes on n-Dimensional System Theory , 1979 .

[5] Sun-Yuan Kung,et al. New results in 2-D systems theory, part I: 2-D polynomial matrices, factorization, and coprimeness , 1977, Proceedings of the IEEE.

[6] Dante C. Youla,et al. The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices , 1984 .

[7] E. Emre,et al. Regulation of linear systems over rings by dynamic output feedback , 1983 .

[8] Jr. G. Forney,et al. Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[9] J. Guiver,et al. Polynomial matrix primitive factorization over arbitrary coefficient field and related results , 1982 .

[10] Coprime fraction of 2-D rational matrices , 1984, The 23rd IEEE Conference on Decision and Control.