Abstract
We propose numerically reliable state-space algorithms for computing several coprime factorizations of rational matrices: (1) factorizations with factors having poles in a given stability domain; (2) factorizations with proper stable factors; (3) factorizations with inner and J-inner denominators. The new algorithms are based on a recursive generalized Schur algorithm for pole dislocation. They are generally applicable whether the underlying descriptor state-space representation is minimal or not, and whether it is stabilizable/detectable or not. The proposed algorithms are useful in solving various computational problems for both standard and descriptor system representations.
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.
