Related papers: Computing the exact number of periodic orbits for …
Starting from a Pfaffian equation in dimension $N$ and focusing on compact solutions for it, we place in perspective the variational method used in [29] to solve Hilbert's 16th problem. In addition to exploring how this viewpoint can help…
These notes were written during the 9th and 10th sessions of the subject Dynamical Systems II coursed at DTU (Denmark) during the Winter Semester 2015-2016, and later extended in February 2017. They aim to provide students with a…
Piecewise smooth maps are known to exhibit a wide range of dynamical features including numerous types of periodic orbits. Predicting regions in parameter space where such periodic orbits might occur and determining their stability is…
A method to determine the admissibility of symbolic sequences and to find the unstable periodic orbits corresponding to allowed symbolic sequences for the diamagnetic Kepler problem is proposed by using the ordering of stable and unstable…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem).…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
Periodic orbits are fundamental to understand the dynamics of nonlinear systems. In this work, we focus on two aspects of interest regarding periodic orbits, in the context of a dissipative mapping, derived from a prototype model of a…
In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear circuits. Regular set-multilinear circuits are commutative…
We analyze the dynamics of a 4-parameter family of planar ordinary differential equations, given by a polynomial of degree 5 that is equivariant under a symmetry of order 6. We obtain the number of limit cycles as a function of the…
A computational flow is a pair consisting of a sequence of computational problems of a certain sort and a sequence of computational reductions among them. In this paper we will develop a theory for these computational flows and we will use…
In this paper, we examine a time-dependent family of two-dimensional algebras. We investigate the conditions under which any two algebras from this family, formed at different times, are isomorphic. Our findings reveal that the flow…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
For many classes of symplectic manifolds, the Hamiltonian flow of a function with sufficiently large variation must have a fast periodic orbit. This principle is the base of the notion of Hofer-Zehnder capacity and some other symplectic…
We analyse and compare several algorithms to compute numerically periodic solutions of high-dimensional dynamical systems and investigate their Floquet stability without building the monodromy matrix. The solution and its perturbation are…
We introduce novel mathematical and computational tools to develop a complete algorithm for computing the set of non-properness of polynomials maps in the plane. In particular, this set, which we call \emph{the Jelonek set}, is a subset of…
We consider an autonomous differential system in $\mathbb{R}^n$ with a periodic orbit and we give a new method for computing the characteristic multipliers associated to it. Our method works when the periodic orbit is given by the…