Abstract
AbstractWe consider the approximate computation of Gramians of large‐scale linear discrete‐time state‐space systems. Of particular interest are the Gramians which arise in frequency‐limited balanced truncation model order reduction. While there are many results for the continuous‐time situation, the discrete‐time scenario is usually considered to a much lesser extent. The Gramians are solutions of discrete‐time Lyapunov matrix equations (also called Stein matrix equations) which, if the reduction is restricted to smaller frequency intervals, also incorporate matrix functions in the form of matrix logarithms. We discuss the efficient numerical handling of these matrix function as well as the computation of low‐rank Gramian approximation by rational Krylov subspace and related iterative methods.
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.
