Abstract
In this letter, we investigate balanced truncation for a class of continuous-time bilinear descriptor systems, appearing, e.g., in constraint circuit analysis or resulting from semi-discretization of the Navier–Stokes equations. For this, as widely done in the literature, we first aim at transforming the bilinear descriptor system into an equivalent ODE system by means of projectors for which the standard balanced truncation method for bilinear systems can be applied. Subsequently, we discuss how to solve the arising generalized Lyapunov equations corresponding to the equivalent ODE, without requiring the explicit computation of the projectors. The efficiency of the proposed algorithm is illustrated through a numerical example, which also shows its competitiveness with an iterative ${\mathcal {H}}_{2}$ -optimal model order reduction scheme.
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.
