• DocumentCode
    486491
  • Title

    Recursive Algorithms for Coprime Fractions and Diophantine Equations

  • Author

    Kuo, F. ; Chen, C.T.

  • Author_Institution
    Department of Electrical Engineering, State University of New York, Stony Brook, New York 11794
  • fYear
    1985
  • fDate
    19-21 June 1985
  • Firstpage
    1672
  • Lastpage
    1677
  • Abstract
    The computation of coprime fractions for proper rational matrices and the solving of Diophantine equations are important in the design of multivariable systems by using polynomial fractional forms. Recursive algorithms, which fully exploit the shift-invariant property of the generalized resultants, are developed to carry out these computations. They are more efficient than the existing ones.
  • Keywords
    Algorithm design and analysis; Application software; Controllability; Differential equations; MIMO; Matrices; Observability; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference, 1985
  • Conference_Location
    Boston, MA, USA
  • Type

    conf

  • Filename
    4788882