Truncated balanced realization of a stable non-minimal state-space system

1987/10/01 by M. S. TOMBS, Michael Tombs, I. POSTLETHWAITE +1 · 3 citations
Physics and Astronomy · Mathematics · Decision Sciences · #Model Reduction and Neural Networks #Numerical methods for differential equations #Probabilistic and Robust Engineering Design

paper · doi:10.1080/00207178708933971

Abstract

In this paper we present a numerically reliable algorithm to compute the balanced realization of a stable state-space system that may be arbitrarily close to being unobservable and/or uncontrollable. The resulting realization, which is known to be a good approximation of the original system, must be minimal and therefore may contain a reduced number of states. Depending on the choice of partitioning of the Hankel singular values, this algorithm can be used either as a form of minimal realization or of model reduction. This illustrates that in finite precision arithmetic these two procedures are closely related. In addition to real matrix multiplication, the algorithm only requires the solution of two Lyapunov equations and one singular value decomposition of an upper-triangular matrix.

Cited by

• A New Low-Rank Cholesky-Factor ADI Algorithm Allowing Shifts Anywhere in the Complex Plane with Applications to Data-Driven Model Reduction
• Descriptor System Tools (DSTOOLS) User's Guide
• Interconnection-based model order reduction - a survey

Related

• Balanced Truncation via Tangential Interpolation
• Minimal state space realization, static output feedback and matrix completion of families of systems
• On the balanced truncation error bound and sign parameters from arrowhead realizations
• State Reduction in Incompletely Specified Finite-State Machines
• Principal component analysis in linear systems: Controllability, observability, and model reduction