Abstract
This paper addresses an algorithm of J spectral factorization for discrete time polynomial matrices. Particularly, we focus on the computation of J spectral factorization for discrete time polynomial matrices. Our approach is based on two-variable polynomial matrices, which is introduced for the analysis and synthesis of discrete time dissipativeness by authors, and algebraic Riccati equations. We show that the solvablity of J spectral factorization of a given polynomial matrix is equivalent to that of an algebraic Riccati equation consisting of the coefficient matrices of the given polynomial matrix. And then we provide an algorithm of discrete time J spectral factorization. Moreover, we give an illustrative example in order to show the validity of our results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transactions of the Institute of Systems, Control and Information Engineers
Disclaimer: 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.