Computation of Minimal Realizations of Periodic Systems
نویسنده
چکیده
We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The first 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.
منابع مشابه
Square-Root Balancing and Computation of Minimal Realizations of Periodic Systems
We propose a numerically reliable approach for balancing and minimal realization of linear periodic systems with time-varying dimensions. The proposed approach to balancing belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be also used to compute balanced minimal order realizations from non-minimal ones. An alternative balancing-free square-roo...
متن کاملBalancing related methods for minimal realization of periodic systems
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 potent...
متن کاملComputation of transfer function matrices of periodic systems
We present a numerical approach to evaluate the transfer function matrices of a periodic system corresponding to lifted state-space representations as constant systems. The proposed pole-zero method determines each entry of the transfer function matrix in a minimal zerospoles-gain representation. A basic computational ingredient for this method is the extended periodic real Schur form of a peri...
متن کاملOn computing minimal realizations of periodic descriptor systems
We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability and observability) is the orthogonal reduction of periodic matrix pairs to Kronecker-like forms. Specializations of a general reduction algorith...
متن کاملRealization problem for positive multivariable continuous-time systems with delays
The realization problem for positive, multivariable continuous-time linear systems with delays in state and in control is formulated and solved. Sufficient conditions for the existence of positive realizations of a given proper transfer function are established. A procedure for computation of positive minimal realizations is presented and illustrated by an example.
متن کامل