On classical state space realizability of bilinear inout-output differential equations

This paper studies the realizability property of continuous-time bilinear i/o equations in the classical state space form. Constraints on the parameters of the bilinear i/o model are suggested that lead to realizable models. The paper proves that the 2nd order bilinear i/o differential equation, unlike the discrete-time case, is always realizable in the classical state space form. The complete list of 3rd and 4th order realizable i/o bilinear models is given and two subclasses of realizable i/o bilinear systems are suggested. Our conditions rely basically upon the property that certain combinations of coefficients of the i/o equations are zero or not zero. We provide explicit state equations for all realizable 2nd and 3rd order bilinear i/o equations, and for one realizable subclass of bilinear i/o equations of arbitrary orde

Towards deterministic subspace identification for autonomous nonlinear systems

The problem of identifying deterministic autonomous linear and nonlinear systems is studied. A specific version of the theory of deterministic subspace identification for discrete-time autonomous linear systems is developed in continuous time. By combining the subspace approach to linear identification and the differential-geometric approach to nonlinear control systems, a novel identification framework for continuous-time autonomous nonlinear systems is developed

Application of system theory to power processing problems

The work in power processing is reported. Input-output models, and Lie groups in control theory are discussed along with the methods of analysis for time invariant electrical networks

Realization Theory for LPV State-Space Representations with Affine Dependence

In this paper we present a Kalman-style realization theory for linear parameter-varying state-space representations whose matrices depend on the scheduling variables in an affine way (abbreviated as LPV-SSA representations). We deal both with the discrete-time and the continuous-time cases. We show that such a LPV-SSA representation is a minimal (in the sense of having the least number of state-variables) representation of its input-output function, if and only if it is observable and span-reachable. We show that any two minimal LPV-SSA representations of the same input-output function are related by a linear isomorphism, and the isomorphism does not depend on the scheduling variable.We show that an input-output function can be represented by a LPV-SSA representation if and only if the Hankel-matrix of the input-output function has a finite rank. In fact, the rank of the Hankel-matrix gives the dimension of a minimal LPV-SSA representation. Moreover, we can formulate a counterpart of partial realization theory for LPV-SSA representation and prove correctness of the Kalman-Ho algorithm. These results thus represent the basis of systems theory for LPV-SSA representation.Comment: The main difference with respect to the previous version is as follows: typos have been fixe