Related papers: Robust upper estimates for topological entropy via…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…
We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on $R^{d}_+,$ which gives iterative lower and upper bounds for…
Topological entropy measures the number of distinguishable orbits in a dynamical system, thereby quantifying the complexity of chaotic dynamics. One approach to computing topological entropy in a two-dimensional space is to analyze the…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
For a non-generic, yet dense subset of $C^1$ expanding Markov maps of the interval we prove the existence of uncountably many Lyapunov optimizing measures which are ergodic, fully supported and have positive entropy. These measures are…
In chaotic dynamical systems such as the weather, prediction errors grow faster in some situations than in others. Real-time knowledge about the error growth could enable strategies to adjust the modelling and forecasting infrastructure…
Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…
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 consider fitting a bivariate spline regression model to data using a weighted least-squares cost function, with weights that sum to one to form a discrete probability distribution. By applying the principle of maximum entropy, the weight…
Let $f$ be a $C^2$ diffeomorphism on a compact manifold. Ledrappier and Young introduced entropies along unstable foliations for an ergodic measure $\mu$. We relate those entropies to covering numbers in order to give a new upper bound on…
For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…
In this paper, we improve the known estimates for the invariance entropy of a nonlinear control system. For sets of complete approximate controllability we derive an upper bound in terms of Lyapunov exponents and for uniformly hyperbolic…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
We investigate the theoretical foundations of a recently introduced entropy-based formulation of weighted least squares for the approximation of overdetermined linear systems, motivated by robust data fitting in the presence of sparse gross…
In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…
Two approaches are presented for computing upper bounds on Lyapunov exponents and their sums, and on the Lyapunov dimension, among all trajectories of a dynamical system governed by ordinary differential equations. The first approach…
We develop a powerful and general method to provide rigorous and accurate upper and lower bounds for Lyapunov exponents of stochastic flows. Our approach is based on computer-assisted tools, the adjoint method and established results on the…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
In this work, we present a comprehensive study of the relationship among uniform Lyapunov exponents, the Liouville trace formula, and adapted metrics for cocycles in Hilbert spaces. First, we prove that uniform Lyapunov exponents can be…