22,426 research outputs found
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
Stable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a
zero-dimensional ideal . The criterion used in the computation involves
specific commutation polynomials and leads to an algorithm and an
implementation extending the one provided in [MT'05]. This general border basis
algorithm weakens the monomial ordering requirement for \grob bases
computations. It is up to date the most general setting for representing
quotient algebras, embedding into a single formalism Gr\"obner bases, Macaulay
bases and new representation that do not fit into the previous categories. With
this formalism we show how the syzygies of the border basis are generated by
commutation relations. We also show that our construction of normal form is
stable under small perturbations of the ideal, if the number of solutions
remains constant. This new feature for a symbolic algorithm has a huge impact
on the practical efficiency as it is illustrated by the experiments on
classical benchmark polynomial systems, at the end of the paper
On computing Belyi maps
We survey methods to compute three-point branched covers of the projective
line, also known as Belyi maps. These methods include a direct approach,
involving the solution of a system of polynomial equations, as well as complex
analytic methods, modular forms methods, and p-adic methods. Along the way, we
pose several questions and provide numerous examples.Comment: 57 pages, 3 figures, extensive bibliography; English and French
abstract; revised according to referee's suggestion
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory.
Given an algebraic model of a physical process, which variables can be, in
theory, deduced from the input-output behavior of an experiment? How many of
the remaining variables should we assume to be known in order to determine all
the others? These questions are parts of the \emph{local algebraic
observability} problem which is concerned with the existence of a non trivial
Lie subalgebra of the symmetries of the model letting the inputs and the
outputs invariant. We present a \emph{probabilistic seminumerical} algorithm
that proposes a solution to this problem in \emph{polynomial time}. A bound for
the necessary number of arithmetic operations on the rational field is
presented. This bound is polynomial in the \emph{complexity of evaluation} of
the model and in the number of variables. Furthermore, we show that the
\emph{size} of the integers involved in the computations is polynomial in the
number of variables and in the degree of the differential system. Last, we
estimate the probability of success of our algorithm and we present some
benchmarks from our Maple implementation.Comment: 26 pages. A Maple implementation is availabl
- …