88,127 research outputs found
Fast computation of power series solutions of systems of differential equations
We propose new algorithms for the computation of the first N terms of a
vector (resp. a basis) of power series solutions of a linear system of
differential equations at an ordinary point, using a number of arithmetic
operations which is quasi-linear with respect to N. Similar results are also
given in the non-linear case. This extends previous results obtained by Brent
and Kung for scalar differential equations of order one and two
A Fast Algorithm for Computing the p-Curvature
We design an algorithm for computing the -curvature of a differential
system in positive characteristic . For a system of dimension with
coefficients of degree at most , its complexity is \softO (p d r^\omega)
operations in the ground field (where denotes the exponent of matrix
multiplication), whereas the size of the output is about . Our
algorithm is then quasi-optimal assuming that matrix multiplication is
(\emph{i.e.} ). The main theoretical input we are using is the
existence of a well-suited ring of series with divided powers for which an
analogue of the Cauchy--Lipschitz Theorem holds.Comment: ISSAC 2015, Jul 2015, Bath, United Kingdo
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
Computation of maximal local (un)stable manifold patches by the parameterization method
In this work we develop some automatic procedures for computing high order
polynomial expansions of local (un)stable manifolds for equilibria of
differential equations. Our method incorporates validated truncation error
bounds, and maximizes the size of the image of the polynomial approximation
relative to some specified constraints. More precisely we use that the manifold
computations depend heavily on the scalings of the eigenvectors: indeed we
study the precise effects of these scalings on the estimates which determine
the validated error bounds. This relationship between the eigenvector scalings
and the error estimates plays a central role in our automatic procedures. In
order to illustrate the utility of these methods we present several
applications, including visualization of invariant manifolds in the Lorenz and
FitzHugh-Nagumo systems and an automatic continuation scheme for (un)stable
manifolds in a suspension bridge problem. In the present work we treat
explicitly the case where the eigenvalues satisfy a certain non-resonance
condition.Comment: Revised version, typos corrected, references adde
Fast iteration of cocyles over rotations and Computation of hyperbolic bundles
In this paper, we develop numerical algorithms that use small requirements of
storage and operations for the computation of hyperbolic cocycles over a
rotation. We present fast algorithms for the iteration of the quasi-periodic
cocycles and the computation of the invariant bundles, which is a preliminary
step for the computation of invariant whiskered tori
Making big steps in trajectories
We consider the solution of initial value problems within the context of
hybrid systems and emphasise the use of high precision approximations (in
software for exact real arithmetic). We propose a novel algorithm for the
computation of trajectories up to the area where discontinuous jumps appear,
applicable for holomorphic flow functions. Examples with a prototypical
implementation illustrate that the algorithm might provide results with higher
precision than well-known ODE solvers at a similar computation time
- …