Abstract
In this paper, we present a new numerical methods for solving large-scale differential Sylvester matrix equations with low rank right hand sides. These differential matrix equations appear in many applications such as robust control problems, model reduction problems and others. We present two approaches based on extended global Arnoldi process. The first one is based on approximating exponential matrix in the exact solution using the global extended Krylov method. The second one is based on a low-rank approximation of the solution of the corresponding Sylvester equation using the extended global Arnoldi algorithm. We give some theoretical results and report some numerical experiments to show the effectiveness of the proposed methods compared with the extended block Krylov method given in Hached and Jbilou (Numer Linear Algebra Appl 255:e2187, 2018).
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.
