Solving matrix diophantine equations by inverting a square nonsingular system of equations
暂无分享,去创建一个
[1] B. Buchberger. An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[2] Chun Hsiung Fan,et al. A novel approach for solving Diophantine equations , 1990 .
[3] C. Fang,et al. A simple approach to solving the Diophantine equation , 1992 .
[4] V. Kučera,et al. Discrete Linear Control: The Polynomial Equation Approach , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[5] J. Feinstein,et al. The solution of the matrix polynomial equation A(s)X(s) + B(s)Y(s) = C(s) , 1984 .
[6] Chi-Tsong Chen,et al. Linear System Theory and Design , 1995 .
[7] C. Fang,et al. A new method for solving the polynomial generalized Bezout identity , 1992 .
[8] Manabu Yamada,et al. On solving Diophantine equations by real matrix manipulation , 1995, IEEE Trans. Autom. Control..
[9] Anuradha M. Annaswamy,et al. Stable Adaptive Systems , 1989 .
[10] J. Feinstein,et al. The Solution of the Matrix Polynomial Equation: A(s)X(s) + B(s)Y(S) = C(s) , 1982, 1982 American Control Conference.
[11] Nirmal K. Bose. Special Issue on Applications of Gröbner Bases to Multidimensional Systems and Signal Processing , 2001, Multidimens. Syst. Signal Process..
[12] Y. Lai,et al. An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s) , 1989 .