Balancing related methods for minimal realization of periodic systems
β Scribed by A Varga
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 112 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
β¦ Synopsis
We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The ΓΏrst method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal order realizations. An alternative balancing-free square-root method has the advantage of a potentially better numerical accuracy in case of poorly scaled original systems.
The key numerical computation in both methods is the solution of nonnegative periodic Lyapunov equations directly for the Cholesky factors of the solutions. For this purpose, a numerically reliable computational algorithm is proposed to solve nonnegative periodic Lyapunov equations with time-varying dimensions.
π SIMILAR VOLUMES
The positive realization problem for linear systems is to find, for a given transfer function, all possible realizations with a state spaee of minimal dimension such that the resulting system is a positive system. In this paper, discrete-time positive linear systems having the nonnegative orthant re
We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot de