Abstract
In this study, the authors aim to study explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations. First, an explicit iterative algorithm based on fixed point theory of dynamic equations is presented via adding a tuning parameter. Second, a necessary and sufficient condition is provided for the convergence of the proposed algorithm. Moreover, the optimal value of the tuning parameter is derived for the fastest convergence of the algorithm. Third, by using the latest updated information, a modified version of the presented explicit iterative algorithm is also established with a necessary and sufficient condition being provided to guarantee the convergence of the modified algorithm. Finally, a numerical example is given to demonstrate the effectiveness of the proposed algorithms.
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.
