Related papers: Good rotations
In computational 3D geometric problems involving rotations, it is often that people have to convert back and forth between a rotational matrix and a rotation described by an axis and a corresponding angle. For this purpose, Rodrigues'…
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…
Impact craters are the primary geomorphic features on the surfaces of celestial bodies such as the Moon, and their formation has significant implications for the evolutionary history of the celestial body. The study of the impact crater…
Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…
Last two decades, the problem of robotic mapping has made a lot of progress in the research community. However, since the data provided by the sensor still contains noise, how to obtain an accurate map is still an open problem. In this…
We present a formalism well adapted to the numerical study of the encounter of an ordinary main sequence star with a massive black hole. Symmetry considerations, the use of a well adapted moving grid and a well adapted moving frame along…
Accurate numerical solutions of the equations of hydrodynamics play an ever more important role in many fields of astrophysics. In this work, we reinvestigate the accuracy of the moving-mesh code \textsc{Arepo} and show how its convergence…
For problems in astrophysics, planetary science and beyond, numerical simulations are often limited to simulating fewer particles than in the real system. To model collisions, the simulated particles (aka superparticles) need to be inflated…
Many robotics applications require alignment and fusion of observations obtained at multiple views to form a global model of the environment. Multi-way data association methods provide a mechanism to improve alignment accuracy of pairwise…
Operations research practitioners frequently want to model complicated functions that are are difficult to encode in their underlying optimisation framework. A common approach is to solve an approximate model, and to use a simulation to…
To simulate the quantum systems at classical or quantum computers, it is necessary to reduce continuous observables (e.g. coordinate and momentum or energy and time) to discrete ones. In this work we consider the continuous observables…
Logarithmic operators and logarithmic conformal field theories are reviewed. Prominent examples considered here include c=-2 and c=0 logarithmic conformal field theories. c=0 logarithmic conformal field theories are especially interesting…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
We review the developments in modeling gravitational recoil from merging black-hole binaries and introduce a new set of 20 simulations to test our previously proposed empirical formula for the recoil. The configurations are chosen to…
Rotation estimation plays a fundamental role in many computer vision and robot tasks. However, efficiently estimating rotation in large inputs containing numerous outliers (i.e., mismatches) and noise is a recognized challenge. Many robust…
Computational time reversal imaging can be used to locate the position of multiple scatterers in a known background medium. The current methods for computational time reversal imaging are based on the null subspace projection operator,…
We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic…
We present fully general relativistic simulations of the quasi-circular inspiral and merger of charged, non-spinning, binary black holes with charge-to-mass ratio $\lambda \le 0.3$. We discuss the key features that enabled long term and…
The main two algorithms for computing the numerical radius are the level-set method of Mengi and Overton and the cutting-plane method of Uhlig. Via new analyses, we explain why the cutting-plane approach is sometimes much faster or much…