Related papers: Computational Complexity of Iterated Maps on the I…
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…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
It is well known that the computation of accurate trajectories of the Lorenz system is a difficult problem. Computed solutions are very sensitive to the discretization error determined by the time step size and polynomial order of the…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
A novel fast multi-impulse optimization method for long-duration perturbed orbit rendezvous is proposed. First, based on the analytically estimated impulses, the terminal rendezvous deviation with precise dynamics model can be predicted.…
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…
In this short note, we discuss the basic approach to computational modeling of dynamical systems. If a dynamical system contains multiple time scales, ranging from very fast to slow, computational solution of the dynamical system can be…
Iterative gradient-based optimization algorithms are widely used to solve difficult or large-scale optimization problems. There are many algorithms to choose from, such as gradient descent and its accelerated variants such as Polyak's Heavy…
We introduce and study the notion of a directional complexity and entropy for maps of degree 1 on the circle. For piecewise affine Markov maps we use symbolic dynamics to relate this complexity to the symbolic complexity. We apply a…
In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…
We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
We compare the divergence of orbits and the reversibility error for discrete time dynamical systems. These two quantities are used to explore the behavior of the global error induced by round off in the computation of orbits. The similarity…
Stochastic dynamical systems are fundamental in state estimation, system identification and control. System models are often provided in continuous time, while a major part of the applied theory is developed for discrete-time systems.…
The study addresses the problem of precision in floating-point (FP) computations. A method for estimating the errors which affect intermediate and final results is proposed and a summary of many software simulations is discussed. The basic…