Jacobi's solution for geodesics on a triaxial ellipsoid
Charles F. F. Karney
TL;DR
This work delivers a robust numerical implementation of Jacobi's classical solution for geodesics on a triaxial ellipsoid, reducing the geodesic problem to the evaluation of a set of one-dimensional integrals via ellipsoidal coordinates. It employs Fourier-series representations and Clenshaw summation to achieve high-precision indefinite integrals and uses Newton-based solvers for the direct problem and Chandrupatla's method for the inverse problem, with careful handling of umbilics and special cases. The main contributions include a scalable, double-precision-capable algorithm that matches or exceeds ODE-based approaches in accuracy while offering consistent performance across geodesic lengths, and a concrete, open implementation in GeographicLib v2.7 tested on Cayley’s ellipsoid and other triaxial models. The results demonstrate high reliability and efficiency for both direct and inverse geodesic problems, making Jacobi’s solution practically viable for geodesy and planetary science applications.
Abstract
On Boxing Day, 1838, Jacobi found a solution to the problem of geodesics on a triaxial ellipsoid, with the course of the geodesic and the distance along it given in terms of one-dimensional integrals. Here, a numerical implementation of this solution is described. This entails accurately evaluating the integrals and solving the resulting coupled system of equations. The inverse problem, finding the shortest path between two points on the ellipsoid, can then be solved using a similar method as for biaxial ellipsoids.
