Abstract
In this paper, we firstly introduce the origin of Lyapunov matrix equation, and then the geometric methods for solving Lyapunov equation are given by using the Log-Euclidean metric and the fiber bundle-based Riemannian metric based on the manifold of positive definite Hermitian matrices. Then, the solution of Lyapunov matrix equation is presented by providing a natural gradient descent algorithm (NGDA), a Log-Euclidean descent algorithm (LGDA) and a Riemannian gradient algorithm based on fiber bundle (RGA). At last, the convergence speeds of the RGA, the NGDA and the LGDA are compared via two simulation examples. Simulation results show that the convergence speed of the RGA is faster than both of the LGDA and the NGDA.
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.
