Related papers: Set-oriented numerical computation of rotation set…
We obtain sharp rotation bounds for homeomorphisms $f:\mathbb{C}\to\mathbb{C}$ whose distortion is in $L^p_{loc}$, $p\geq1$, and whose inverse have controlled modulus of continuity. The motivation to study this class of maps comes from…
We propose and discuss a new computational method for the numerical approximation of reachable sets for nonlinear control systems. It is based on the support vector machine algorithm and represents the set approximation as a sublevel set of…
We prove that almost all real numbers (with respect to Lebesgue measure) are approximated by the convergents of their $\beta$-expansions with the exponential order $\beta^{-n}$. Moreover, the Hausdorff dimensions of sets of the real numbers…
The nature and origin of exceptional sets associated with the rotation number of circle maps, Kolmogorov-Arnol'd-Moser theory on the existence of invariant tori and the linearisation of complex diffeomorphisms are explained. The metrical…
We prove a structure theorem for ergodic homological rotation sets of homeomorphisms isotopic to the identity on a closed orientable hyperbolic surface: this set is made of a finite number of pieces that are either one-dimensional or almost…
We study homotopic-to-the-identity torus homeomorphisms, whose rotation set has nonempty interior. We prove that any such map is monotonically semiconjugate to a homeomorphism that preserves the Lebesgue measure, and that has the same…
This work presents a method of efficiently computing inner and outer approximations of forward reachable sets for nonlinear control systems with changed dynamics and diminished control authority, given an a priori computed reachable set for…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
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…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or {\L}ojasiewicz properties. These geometrical notions are usually local by nature, and may…
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach…
The behavior of a family of dissipative dynamical systems representing transformations of two-dimensional torus is studied on a discrete lattice and compared with that of conservative hyperbolic automorphisms of the torus. Applying…
We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the…
The Gromov-Hausdorff distance provides a metric on the set of isometry classes of compact metric spaces. Unfortunately, computing this metric directly is believed to be computationally intractable. Motivated by applications in shape…
In 1991 Llibre and MacKay proved that if $f$ is a 2-torus homeomorphism isotopic to identity and the rotation set of $f$ has a non empty interior then $f$ has positive topological entropy. Here, we give a converselike theorem. We show that…