411 research outputs found

    Graph theory, irreducibility, and structural analysis of differential-algebraic equation systems

    Full text link
    The Σ\Sigma-method for structural analysis of a differential-algebraic equation (DAE) system produces offset vectors from which the sparsity pattern of a system Jacobian is derived. This pattern implies a block-triangular form (BTF) of the DAE that can be exploited to speed up numerical solution. The paper compares this fine BTF with the usually coarser BTF derived from the sparsity pattern of the \sigmx. It defines a Fine-Block Graph with weighted edges, which gives insight into the relation between coarse and fine blocks, and the permitted ordering of blocks to achieve BTF. It also illuminates the structure of the set of normalised offset vectors of the DAE, e.g.\ this set is finite if and only if there is just one coarse block

    How AD Can Help Solve Differential-Algebraic Equations

    Get PDF
    A characteristic feature of differential-algebraic equations is that one needs to find derivatives of some of their equations with respect to time, as part of so called index reduction or regularisation, to prepare them for numerical solution. This is often done with the help of a computer algebra system. We show in two significant cases that it can be done efficiently by pure algorithmic differentiation. The first is the Dummy Derivatives method, here we give a mainly theoretical description, with tutorial examples. The second is the solution of a mechanical system directly from its Lagrangian formulation. Here we outline the theory and show several non-trivial examples of using the "Lagrangian facility" of the Nedialkov-Pryce initial-value solver DAETS, namely: a spring-mass-multipendulum system, a prescribed-trajectory control problem, and long-time integration of a model of the outer planets of the solar system, taken from the DETEST testing package for ODE solvers

    Towards Integrating Hybrid DAEs with a High-Index DAE Solver

    Get PDF
    J.D. Pryce and N.S. Nedialkov have developed a Taylor series method and a C++ package, DaeTs, for solving numerically an initial-value problem differential-algebraic equation (DAE) that can be of high index, high order, nonlinear, and fully implicit. Numerical results have shown this method to be efficient and very accurate, and particularly suitable for problems that are of too high an index for present DAE solvers. However, DaeTs cannot be applied to systems of DAEs that change at points it time, also called hybrid or multi-mode DAEs. This paper presents methods for extending Daets with the capability to integrate hybrid DAEs. Methods for event location and consistent initializations are given. Daets is applied to simulate a model of a parallel robot: a hybrid system of index-3 DAEs with closed-loop control

    The Typology of Causative Constructions

    Get PDF
    Wojcik, Richard H. Translation from Russian of "Tipologiia kauzativnykh konstruktsii (The Typology of Causative Constructions)" by N. Medialkov and G. Silnitskii
    • …
    corecore