Related papers: Rigorous numerics for critical orbits in the quadr…
Studying 2 degree-of-freedom (DOF) Hamiltonian dynamical systems often involves the computation of stable & unstable manifolds of periodic orbits, due to the homoclinic & heteroclinic connections they can generate. Such study is generally…
The aim of this work is to explore the escape process of three-dimensional orbits in a star cluster rotating around its parent galaxy in a circular orbit. The gravitational field of the cluster is represented by a smooth, spherically…
In this paper we consider the times-q map on the unit interval as a subshift of finite type by identifying each number with its base q expansion, and we study certain non-dense orbits of this system where no element of the orbit is smaller…
Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some…
We study systems with periodically oscillating parameters that can give way to complex periodic or non periodic orbits. Performing the long time limit, we can define ergodic averages such as Lyapunov exponents, where a negative maximal…
We prove that almost every non-regular real quadratic map is Collet-Eckmann and has polynomial recurrence of the critical orbit (proving a conjecture by Sinai). It follows that typical quadratic maps have excellent ergodic properties, as…
Stochastic computational models in the form of pure jump processes occur frequently in the description of chemical reactive processes, of ion channel dynamics, and of the spread of infections in populations. For spatially extended models,…
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…
Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in…
The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…
Grebogi, Ott and Yorke (Phys. Rev. A 38(7), 1988) have investigated the effect of finite precision on average period length of chaotic maps. They showed that the average length of periodic orbits ($T$) of a dynamical system scales as a…
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…
Complex interval arithmetic is a powerful tool for the analysis of computational errors. The naturally arising rectangular, polar, and circular (together called primitive) interval types are not closed under simple arithmetic operations,…
In this paper we start a global study of the parameter space (dissipation, perturbation, frequency) of the dissipative spin-orbit problem in Celestial Mechanics with the aim of delimiting regions where the dynamics, or at least some of its…
Quantifying errors and losses due to the use of Floating-Point (FP) calculations in industrial scientific computing codes is an important part of the Verification, Validation and Uncertainty Quantification (VVUQ) process. Stochastic…
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs…
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…
We introduce a renormalization model which explains how the behavior of a discrete-time continuous dynamical system changes as the dimension of the system varies. The model applies to some two-dimensional systems, including H\'enon and Lozi…
From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal,…
Permutation Entropy and statistiCal Complexity Analysis for astRophYsics (PECCARY) is a computationally inexpensive, statistical method by which any time-series can be characterized as predominantly regular, complex, or stochastic. Elements…