A minimal lattice realization for multivariable systems
An algorithm for constructing a minimal lattice realization of a multivariable stable linear discrete-time system is proposed. The algorithm consists of four steps. (i) Transform a reachable and observable state space representation into an input normal Hessenberg realization (A B C D). (ii) Construct an input normal Hessenberg realization (F G H J) of an LBR system from (A B C D). (iii) Construct a lattice realization of the LBR system (F G H J). (iv) Transform the lattice realization of (F G H J) into a lattice realization of (A B C D). The step (iii) is the main procedure of the algorithm.
- Covariance characterization by partial autocorrelation matrices
- Generalized Hessenberg transformations for reduced-order modelling of large-scale systems†
- Lossless chain scattering matrices and optimum linear prediction: The vector case
- On a generalized Szegö- Levinson realization algorithm for optimal linear predictors based on a network synthesis approach
- On Sigma-lossless transfer functions and related questions
- State-space formulae for discrete-time H∞ optimization
- The generation of all q-Markov covers
This page was built for publication: A minimal lattice realization for multivariable systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805572)