Greatest common divisor via generalized Sylvester and Bezout matrices
暂无分享,去创建一个
[1] H. W. Turnbull,et al. Lectures on Matrices , 1934 .
[2] M. Laidacker. Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor , 1969 .
[3] S. Barnett. Regular polynomial matrices having relatively prime determinants , 1969, Mathematical Proceedings of the Cambridge Philosophical Society.
[4] Alston S. Householder,et al. Bezoutiants, Elimination and Localization , 1970 .
[5] N. Munro. Determination of the least order of transfer-function matrices , 1971 .
[6] A. Rowe. The Generalized Resultant Matrix , 1972 .
[7] E. Davison,et al. A minimization algorithm for the design of linear multivariable systems , 1973 .
[8] L. Silverman,et al. Relatively prime polynomial matrices: Algorithms , 1975, 1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes.
[9] Jr. G. Forney,et al. Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .
[10] M. Morf,et al. A generalized resultant matrix for polynomial matrices , 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.
[11] L. E. Lerer,et al. Resultants of matrix polynomials , 1976 .
[12] B. O. Anderson,et al. Generalized Bezoutian and Sylvester matrices in multivariable linear control , 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.
[13] E. Davison,et al. An algorithm for obtaining the minimal realization of a linear time-invariant system and determining if a system is stabilizable-detectable , 1977 .
[14] Brian D. O. Anderson,et al. The Matrix Cauchy Index: Properties and Applications , 1977 .