Generalized matrix Euclidean algorithms for solving diophantine equations and associated problems

J. S.H. Tsai, S. S. Chen, L. S. Shieh

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Based on the matrix fraction descriptions of multi-variable control systems, this paper presents the generalized matrix Euclidean algorithms for solving Diophantine equations and associated problems. A chain rule is developed for finding the greatest common right(left) divisor of two square(non-square) polynomial matrices and the irreducible right(left) matrix fraction description from the reducible or irreducible left(right) matrix fraction description. Also, the development of multi-variable pole-assignment controllers are discussed for engineering applications.

Original languageEnglish
Pages (from-to)55-72
Number of pages18
JournalComputers and Mathematics with Applications
Volume25
Issue number12
DOIs
Publication statusPublished - 1993 Jun

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Generalized matrix Euclidean algorithms for solving diophantine equations and associated problems'. Together they form a unique fingerprint.

Cite this