Abstract
In this paper, we propose a new approximation algorithm for solving generalized Lyapunov matrix equations. We also present a convergence analysis for this algorithm. In each step of this algorithm two standard Lyapunov matrix equations with real coefficient matrices should be solved. Then we determine the optimal parameter to minimize the corresponding spectral radius of iteration matrix to obtain fastest speed of convergence. Finally some numerical examples are given to prove the capability of the present algorithm and a comparison is made with the existing results.
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.
