Related papers: How roundoff errors help to compute the rotation s…
Modern computer architectures support low-precision arithmetic, which present opportunities for the adoption of mixed-precision algorithms to achieve high computational throughput and reduce energy consumption. As a growing number of…
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 examine numerical rounding errors of some deterministic solvers for systems of ordinary differential equations (ODEs). We show that the accumulation of rounding errors results in a solution that is inherently random and we obtain the…
We construct a family $\{\Phi_t\}_{t\in[0,1]}$ of homeomorphisms of the two-torus isotopic to the identity, for which all of the rotation sets $\rho(\Phi_t)$ can be described explicitly. We analyze the bifurcations and typical behavior of…
It is well known that the rotation number of a circle homeomorphism defined by H. Poincar\'e allows to completely understand the dynamics of such a map from the topological point of view. In this paper, we collect some results concerning…
The orientation of a rigid object can be described by a rotation that transforms it into a standard position. For a symmetrical object the rotation is known only up to multiplication by an element of the symmetry group. Such ambiguous…
Classical probabilistic rounding error analysis is particularly well suited to stochastic rounding (SR), and it yields strong results when dealing with floating-point algorithms that rely heavily on summation. For many numerical linear…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
The conventional rounding error analysis provides worst-case bounds with an associated failure probability and ignores the statistical property of the rounding errors. In this paper, we develop a new statistical rounding error analysis for…
Tracking on the rotation group is a key component of many modern systems for estimation of the motion of rigid bodies. To address this problem, here we describe a Bayesian algorithm that relies on directional measurements for tracking on…
We prove that for a torus homeomorphism isotopic to the identity and with a lift whose rotation set is an interval, either every rational point in the rotation set is realized by a periodic orbit, or there exists an annular, essential,…
We revisit the problem of well-defining rotation numbers for discrete random dynamical systems on the circle. We show that, contrasting with deterministic systems, the topological (i.e. based on Poincar\'{e} lifts) approach does depend on…
Numerical integrations in celestial mechanics often involve the repeated computation of a rotation with a constant angle. A direct evaluation of these rotations yields a linear drift of the distance to the origin. This is due to roundoff in…
Stochastic Rounding is a probabilistic rounding mode that is surprisingly effective in large-scale computations and low-precision arithmetic. Its random nature promotes error cancellation rather than error accumulation, resulting in slower…
Automated symmetry detection is still a difficult task in 2021. However, it has applications in computer vision, and it also plays an important part in understanding art. This paper focuses on aiding the latter by comparing different…
This paper develops the theory of abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with abelian symmetry. The reduction of variational Runge-Kutta discretizations is…
In this paper, we study Random Dynamical Systems (RDSs) of homeomorphisms on the circle without a finite orbit. We characterize the topological dynamics of the associated semigroup by identifying the existence of invariant sets which are…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
In this paper, we study non-wandering homeomorphisms of the two torus in the identity homotopy class, whose rotation sets are non-trivial line segments from $(0,0)$ to some totally irrational vector $(\alpha,\beta)$. We show this rotation…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…