30,717 research outputs found
Formal Solutions of a Class of Pfaffian Systems in Two Variables
In this paper, we present an algorithm which computes a fundamental matrix of
formal solutions of completely integrable Pfaffian systems with normal
crossings in two variables, based on (Barkatou, 1997). A first step was set in
(Barkatou-LeRoux, 2006) where the problem of rank reduction was tackled via the
approach of (Levelt, 1991). We give instead a Moser-based approach. And, as a
complementary step, we associate to our problem a system of ordinary linear
singular differential equations from which the formal invariants can be
efficiently derived via the package ISOLDE, implemented in the computer algebra
system Maple.Comment: Keywords: Linear systems of partial differential equations, Pfaffian
systems, Formal solutions, Moser-based reduction, Hukuhara- Turritin normal
for
NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions
This article describes the implementation in the software package NumGfun of
classical algorithms that operate on solutions of linear differential equations
or recurrence relations with polynomial coefficients, including what seems to
be the first general implementation of the fast high-precision numerical
evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our
descriptions contain improvements over existing algorithms. We also provide
references to relevant ideas not currently used in NumGfun
Thomas Decomposition of Algebraic and Differential Systems
In this paper we consider disjoint decomposition of algebraic and non-linear
partial differential systems of equations and inequations into so-called simple
subsystems. We exploit Thomas decomposition ideas and develop them into a new
algorithm. For algebraic systems simplicity means triangularity, squarefreeness
and non-vanishing initials. For differential systems the algorithm provides not
only algebraic simplicity but also involutivity. The algorithm has been
implemented in Maple
Integral D-Finite Functions
We propose a differential analog of the notion of integral closure of
algebraic function fields. We present an algorithm for computing the integral
closure of the algebra defined by a linear differential operator. Our algorithm
is a direct analog of van Hoeij's algorithm for computing integral bases of
algebraic function fields
A Geometric Index Reduction Method for Implicit Systems of Differential Algebraic Equations
This paper deals with the index reduction problem for the class of
quasi-regular DAE systems. It is shown that any of these systems can be
transformed to a generically equivalent first order DAE system consisting of a
single purely algebraic (polynomial) equation plus an under-determined ODE
(that is, a semi-explicit DAE system of differentiation index 1) in as many
variables as the order of the input system. This can be done by means of a
Kronecker-type algorithm with bounded complexity
Algorithmic Thomas Decomposition of Algebraic and Differential Systems
In this paper, we consider systems of algebraic and non-linear partial
differential equations and inequations. We decompose these systems into
so-called simple subsystems and thereby partition the set of solutions. For
algebraic systems, simplicity means triangularity, square-freeness and
non-vanishing initials. Differential simplicity extends algebraic simplicity
with involutivity. We build upon the constructive ideas of J. M. Thomas and
develop them into a new algorithm for disjoint decomposition. The given paper
is a revised version of a previous paper and includes the proofs of correctness
and termination of our decomposition algorithm. In addition, we illustrate the
algorithm with further instructive examples and describe its Maple
implementation together with an experimental comparison to some other
triangular decomposition algorithms.Comment: arXiv admin note: substantial text overlap with arXiv:1008.376
- …