
Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables
In this paper we study systems of autonomous algebraic ODEs in several d...
read it

Evaluation of Logic Programs with BuiltIns and Aggregation: A Calculus for Bag Relations
We present a scheme for translating logic programs, which may use aggreg...
read it

dxo: A System for Relational Algebra and Differentiation
We present dxo, a relational system for algebra and differentiation, wri...
read it

Wilf classes of nonsymmetric operads
Two operads are said to belong to the same Wilf class if they have the s...
read it

Bounds for elimination of unknowns in systems of differentialalgebraic equations
Elimination of unknowns in systems of equations, starting with Gaussian ...
read it

Computing inputoutput projections of dynamical models with applications to structural identifiability
Elimination of unknowns in a system of differential equations is often r...
read it

Relational Characterisations of Paths
Binary relations are one of the standard ways to encode, characterise an...
read it
Notes on Computational Graph and Jacobian Accumulation
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these relations and differences, making plain their interconvertibility. By revealing different types of multiplication relations in algebraic expressions and their elimination dependencies in linegraph, we establish a theoretical limit on the efficiency of face elimination.
READ FULL TEXT
Comments
There are no comments yet.