218,787 research outputs found

    On a differential algebraic system structure theory

    No full text
    International audienceThe structure at infinity and the essential structure are two control theory notions which were first defined for linear, then for the so-called affine, systems. And they were shown to be useful tools for the study of the fundamental problem of noninteracting control. They also appeared as related to the solutions of other important control problems such as disturbance decoupling. Their definitions are however entirely in terms of an algorithm, namely the so-called structure algorithm. The present work proposes new definitions with some advantages: they extend the class of systems from linear and affine systems to systems which may be described by algebraic differential equations, they are not tied to specific algorithms, and finally they provide more information on system structure. Let a system be a set of differential equations in variables which are grouped as m inputs, p outputs and n latent variables. To each input component is attached a rational integer, which, for a single input single output system defined by a single differential equation, is the difference between the order in the output and the order in the input of the differential equation defining the system. The m-tuple of these rational integers is the new structure at infinity of the system. Associated to the structure at infinity is also defined a p-tuple of rational integers representing a new notion of essential structure. The old structure at infinity is shown to be recoverable from the new one. Computations of system structure based upon the suggested definitions are quite complex. The present paper focuses on proofs of algorithms which attempt to reduce the complexity of these computations

    Dynamics of a rational system of difference equations in the plane

    Get PDF
    We consider a rational system of first order difference equations in the plane with four parameters such that all fractions have a common denominator. We study, for the different values of the parameters, the global and local properties of the system. In particular, we discuss the boundedness and the asymptotic behavior of the solutions, the existence of periodic solutions and the stability of equilibria

    Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K

    Full text link
    We consider systems A_\ell(t) y(q^\ell t) + ... + A_0(t) y(t) = b(t) of higher order q-recurrence equations with rational coefficients. We extend a method for finding a bound on the maximal power of t in the denominator of arbitrary rational solutions y(t) as well as a method for bounding the degree of polynomial solutions from the scalar case to the systems case. The approach is direct and does not rely on uncoupling or reduction to a first order system. Unlike in the scalar case this usually requires an initial transformation of the system.Comment: 8 page

    On projective systems of rational difference equations

    Get PDF
    We discuss first order systems of rational difference equations which have the property that lines through the origin are mapped into lines through the origin. We call such systems projective systems of rational difference equations and we show a useful change of variables which helps us to understand the behavior in these cases. We include several examples to demonstrate the utility of this change of variables
    corecore