Abstract
A new algorithm for computing irreducible matrix-fraction descriptions of transfer functions matrices is presented. In this communication we give a method for obtaining an irreducible right (left) factorization from an arbitrary left (right) factorization, The problem is to obtain a basis-matrix of the set of solutions of a homogeneous linear system of equations, which is a polynomial module M. This algorithm constructs a set of subspaces of M by elementary operations in a scalar matrix, From these subs paces one can write by simple inspection a basis-matrix for the module M which is in proper column form.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
