Related papers: Computing the Invariant Measure and the Lyapunov E…
We apply the maximum entropy principle to construct the natural invariant density and Lyapunov exponent of one-dimensional chaotic maps. Using a novel function reconstruction technique that is based on the solution of Hausdorff moment…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
Let $\tau: I=[0, 1]\to [0, 1]$ be a piecewise convex map with countably infinite number of branches. In \cite{GIR}, the existence of absolutely continuous invariant measure (ACIM) $\mu$ for $\tau$ and the exactness of the system $(\tau,…
We use an Ulam-type discretization scheme to provide pointwise approximations for invariant densities of interval maps with a neutral fixed point. We prove that the approximate invariant density converges pointwise to the true density at a…
The Lyapunov exponent spectrum and covariant Lyapunov vectors are studied for a quasi-one-dimensional system of hard disks as a function of density and system size. We characterize the system using the angle distributions between covariant…
We present an efficient and validated method for approximating the stationary measures of random dynamical systems with smooth additive noise. The approach leverages the strong regularizing properties of the associated transfer operator…
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 extend in several ways a recently proposed method to construct one-dimensional chaotic maps with exactly known natural invariant measure [Sogo 1999, 2009]. First, we assume that the given invariant measure depends on a continuous…
We generate new hierarchy of many-parameter family of maps of the interval [0,1] with an invariant measure, by composition of the chaotic maps of reference [1]. Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently…
We present several new easy ways of generating smooth one-dimensional maps displaying robust chaos, i.e., chaos for whole intervals of the parameter. Unlike what happens with previous methods, the Lyapunov exponent of the maps constructed…
We discuss several numerical methods for calculating Lyapunov exponents (a quantitative measure of chaos) in systems of ordinary differential equations. We pay particular attention to constrained systems, and we introduce a variety of…
We use Ulam's method to provide rigorous approximation of diffusion coefficients for uniformly expanding maps. An algorithm is provided and its implementation is illustrated using Lanford's map.
We study the problem of space and time efficient evaluation of a nonparametric estimator that approximates an unknown density. In the regime where consistent estimation is possible, we use a piecewise multivariate polynomial interpolation…
This paper presents a proof that existence of a polynomial Lyapunov function is necessary and sufficient for exponential stability of sufficiently smooth nonlinear ordinary differential equations on bounded sets. The main result states that…
We study random dynamical systems generated by volume-preserving piecewise $C^{1}$ maps. For this class of systems, we establish an invariance principle stating that if all Lyapunov exponents vanish, then there exists a measurable family of…
In this paper, we discuss the Lyapunov exponent definition of chaos and how it can be used to quantify the chaotic behavior of a system. We derive a way to practically calculate the Lyapunov exponent of a one-dimensional system and use it…
In this paper, we study the construction of Lyapunov functions based on first order approximations. In a first part, the study of local exponential stability property of a transverse invariant manifold is considered. This part is mainly a…
Techniques from numerical bifurcation theory are very useful to study transitions between steady fluid flow patterns and the instabilities involved. Here, we provide computational methodology to use parameter continuation in determining…
The statistical properties of finite-time Lyapunov exponents at the Ulam point of the logistic map are investigated. The exact analytical expression for the autocorrelation function of one-step Lyapunov exponents is obtained, allowing the…
We compare three methods for computing invariant Lyapunov exponents (LEs) in general relativity. They involve the geodesic deviation vector technique (M1), the two-nearby-orbits method with projection operations and with coordinate time as…