Related papers: Good rotations
The goals of this paper are to obtain theoretical models of what happens when a computer calculates the rotation set of a homeomorphism, and to find a good algorithm to perform simulations of this rotation set. To do that we introduce the…
Symplectic mappings are discrete-time analogs of Hamiltonian systems. They appear in many areas of physics, including, for example, accelerators, plasma, and fluids. Integrable mappings, a subclass of symplectic mappings, are equivalent to…
Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…
The behaviour of resonances in the spin-orbit coupling in Celestial Mechanics is investigated. We introduce a Hamiltonian nearly-integrable model describing an approximation of the spin-orbit interaction. A parametric representation of…
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…
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…
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…
Certain measurements in celestial mechanics necessitate having the origin O of a Cartesian coordinate system (CCS) coincide with a point mass. For the two and three body problems we show mathematical inadequacies in Newton's celestial…
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…
The motion of satellite constellations similar to GPS and Galileo is numerically simulated and, then, the region where bifurcation (double positioning) occurs is appropriately represented. In the cases of double positioning, the true…
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…
Numerical Relativity is a mature field with many applications in Astrophysics, Cosmology and even in Fundamental Physics. As such, we are entering a stage in which new sophisticated methods adapted to open problems are being developed. In…
Existing methods for rotation estimation between two spherical ($\mathbb{S}^2$) patterns typically rely on spherical cross-correlation maximization between two spherical function. However, these approaches exhibit computational complexities…
Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…
Exact diagonalization and other numerical studies of quantum spin systems are notoriously limited by the exponential growth of the Hilbert space dimension with system size. A common and well-known practice to reduce this increasing…
Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…
Generating 2-by-2 unitary matrices in floating-precision arithmetic is a delicate task. One way to reduce the accumulation error is to use less floating-point operations to compute each of the entries in the 2-by-2 unitary matrix. This…
The aim of this paper is to endow the well-known family of hypercubic quantization hashing methods with theoretical guarantees. In hypercubic quantization, applying a suitable (random or learned) rotation after dimensionality reduction has…
We study the random rotation number for random circle homeomorphisms. We introduce two new definitions of the random rotation number that can be stated without reference to any choice of lift of the dynamics to the real line, and prove that…
Floating-point arithmetic performance determines the overall performance of important applications, from graphics to AI. Meeting the IEEE-754 specification for floating-point requires that final results of addition, subtraction,…