Abstract
AbstractEfficient numerical algorithms for the solution of large and sparse matrix Riccati and Lyapunov equations based on the low rank alternating directions implicit (ADI) iteration have become available around the year 2000. Over the decade that passed since then, additional methods based on extended and rational Krylov subspace projection have entered the field and proved to be competitive alternatives. In this survey we sketch both types of methods and discuss their advantages and drawbacks. We focus on the continuous time case here, but corresponding results for discrete time problems can for most results be found in the available literature. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
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.
