Abstract
The present work proposes a gradient based iterative method to find the solutions of the general Sylvester discrete-time periodic matrix equations ∑j=1m(AijXiBij+CijXi+1Dij+EijYiFij+GijYi+1Hij)=Mi,i=1,2,…. It is proven that the proposed iterative method can obtain the solutions of the periodic matrix equations for any initial matrices. Finally a numerical example is included to demonstrate the validity and applicability of the iterative method.
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.
