Earth’s Rotation: A Challenging Problem in Mathematics and Physics

A suitable knowledge of the orientation and motion of the Earth in space is a common need in various fields. That knowledge has been ever necessary to carry out astronomical observations, but with the advent of the space age, it became essential for making observations of satellites and predicting and determining their orbits, and for observing the Earth from space as well. Given the relevant role it plays in Space Geodesy, Earth rotation is considered as one of the three pillars of Geodesy, the other two being geometry and gravity. Besides, research on Earth rotation has fostered advances in many fields, such as Mathematics, Astronomy and Geophysics, for centuries. One remarkable feature of the problem is in the extreme requirements of accuracy that must be fulfilled in the near future, about a millimetre on the tangent plane to the planet surface, roughly speaking. That challenges all of the theories that have been devised and used to-date; the paper makes a short review of some of the most relevant methods, which can be envisaged as milestones in Earth rotation research, emphasizing the Hamiltonian approach developed by the authors. Some contemporary problems are presented, as well as the main lines of future research prospected by the International Astronomical Union/International Association of Geodesy Joint Working Group on Theory of Earth Rotation, created in 2013.

Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem

In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.