6,861 research outputs found

    Identification of linear systems by an asymptotically stable observer

    Get PDF
    A formulation is presented for the identification of a linear multivariable system from single or multiple sets of input-output data. The system input-output relationship is expressed in terms of an observer, which is made asymptotically stable by an embedded eigenvalue assignment procedure. The prescribed eigenvalues for the observer may be real, complex, mixed real and complex, or zero. In this formulation, the Markov parameters of the observer are identified from input-output data. The Markov parameters of the actual system are then recovered from those of the observer and used to obtain a state space model of the system by standard realization techniques. The basic mathematical formulation is derived, and extensive numerical examples using simulated noise-free data are presented to illustrate the proposed method

    An application of eigenspace methods to symmetric flutter suppression

    Get PDF
    An eigenspace assignment approach to the design of parameter insensitive control laws for linear multivariable systems is presented. The control design scheme utilizes flexibility in eigenvector assignments to reduce control system sensitivity to changes in system parameters. The methods involve use of the singular value decomposition to provide an exact description of allowable eigenvectors in terms of a minimum number of design parameters. In a design example, the methods are applied to the problem of symmetric flutter suppression in an aeroelastic vehicle. In this example the flutter mode is sensitive to changes in dynamic pressure and eigenspace methods are used to enhance the performance of a stabilizing minimum energy/linear quadratic regulator controller and associated observer. Results indicate that the methods provide feedback control laws that make stability of the nominal closed loop systems insensitive to changes in dynamic pressure

    Minimizing Communication for Eigenproblems and the Singular Value Decomposition

    Full text link
    Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network. Communication often dominates arithmetic and represents a rapidly increasing proportion of the total cost, so we seek algorithms that minimize communication. In \cite{BDHS10} lower bounds were presented on the amount of communication required for essentially all O(n3)O(n^3)-like algorithms for linear algebra, including eigenvalue problems and the SVD. Conventional algorithms, including those currently implemented in (Sca)LAPACK, perform asymptotically more communication than these lower bounds require. In this paper we present parallel and sequential eigenvalue algorithms (for pencils, nonsymmetric matrices, and symmetric matrices) and SVD algorithms that do attain these lower bounds, and analyze their convergence and communication costs.Comment: 43 pages, 11 figure

    Dynamic mode decomposition with control

    Full text link
    We develop a new method which extends Dynamic Mode Decomposition (DMD) to incorporate the effect of control to extract low-order models from high-dimensional, complex systems. DMD finds spatial-temporal coherent modes, connects local-linear analysis to nonlinear operator theory, and provides an equation-free architecture which is compatible with compressive sensing. In actuated systems, DMD is incapable of producing an input-output model; moreover, the dynamics and the modes will be corrupted by external forcing. Our new method, Dynamic Mode Decomposition with control (DMDc), capitalizes on all of the advantages of DMD and provides the additional innovation of being able to disambiguate between the underlying dynamics and the effects of actuation, resulting in accurate input-output models. The method is data-driven in that it does not require knowledge of the underlying governing equations, only snapshots of state and actuation data from historical, experimental, or black-box simulations. We demonstrate the method on high-dimensional dynamical systems, including a model with relevance to the analysis of infectious disease data with mass vaccination (actuation).Comment: 10 pages, 4 figure
    corecore