Discrete model reduction preserving bounded realness
In model reduction theory, it is required that the reduced-order system retains as many good properties of the original system as possible. There are some particular classes of systems, such as bounded real and positive real systems, for which it is not sufficient to minimize the \(H^\infty\)-norm error. In this paper, the authors propose a discrete model reduction method that preserves the bounded realness. They define the discrete bounded real balancing and obtain the reduced order discrete models from the generalized singular perturbation approximation and direct truncation of the bounded real balanced system. They show the properties of the reduced order systems and derive the \(H^\infty\) norm error bounds in some cases.
- Positive realness preserving model reduction with H/sub /spl infin norm error bounds
- Model reduction via balanced realizations: an extension and frequency weighting techniques
- Positive real and bounded real balancing for model reduction of descriptor systems
- Modellreduktion mit Hilfe balancierter Realisierungen / Model reduction using balanced realizations
- A contraction mapping preserving balanced reduction scheme and its infinity norm error bounds
- All optimal Hankel-norm approximations of linear multivariable systems and theirL,∞-error bounds†
- An error bound for a discrete reduced order model of a linear multivariable system
- Fast projection methods for minimal design problems in linear system theory
- Model reduction via balanced realizations: an extension and frequency weighting techniques
- Model reduction via balanced state space representations
- Relative-error bound for discrete balanced stochastic truncation
- Singular perturbation approximation of balanced systems
- Singular perturbation approximation of bounded real balanced and stochastically balanced transfer matrices
- Singular perturbational approximations for discrete-time balanced systems
- Singular perturbational model reduction of balanced systems
- The discrete-time bounded-real lemma in digital filtering
- The discrete-time strictly bounded-real lemma and the computation of positive definite solutions to the 2-D Lyapunov equation
This page was built for publication: Discrete model reduction preserving bounded realness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361343)