Fast algorithm for obtaining low-order coprime fractional representations of SISO systems

A. Nassirharand, A. Patwardhan

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Control system design and analysis based on the factorization approach requires one to compute the plant coprime factors and the solution to the Bezout identity. The available algorithms for computation of the solution to the Bezout identity usually result in high-order coprime pairs. We present an algorithm which identifies low-order coprime pairs that are solution to the Bezout identify. The algorithm is computationally fast.

Original languageEnglish
Pages (from-to)277-281
Number of pages5
JournalControl, theory and advanced technology
Volume4
Issue number2
StatePublished - Jun 1988

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Fast algorithm for obtaining low-order coprime fractional representations of SISO systems'. Together they form a unique fingerprint.

Cite this