Abstract

We present a highly efficient approach for realizing a positive-real balanced truncation (PRBT) of symmetric systems. The solution of a pair of dual algebraic Riccati equations in conventional PRBT, whose cost constrains practical large-scale deployment, is reduced to the solution of one cross-Riccati equation (XRE). The cross-Riccatian nature of the solution then allows a simple construction of PRBT projection matrices, using a Schur decomposition, without actual balancing. An invariant subspace method and a modified quadratic alternating-direction-implicit iteration scheme are proposed to efficiently solve the XRE. A low-rank variant of the latter is shown to offer a remarkably fast PRBT speed over the conventional implementations. The XRE-based framework can be applied to a large class of linear passive networks, and its effectiveness is demonstrated through numerical examples.

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 call

Disclaimer: 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.