[02138] Convergence Analysis of Leapfrog for Geodesics
Session Time & Room : 2E (Aug.22, 17:40-19:20) @E505
Type : Contributed Talk
Abstract : The leapfrog algorithm was proposed in Noakes’98 to find geodesics joining two given points $x_0$ and $x_1$ on a path-connected complete Riemannian manifold. The basic idea is to choose some junctions between $x_0$ and $x_1$ that can be joined by geodesics locally and then adjust these junctions. In this talk, we find the relationship between the leapfrog's convergence rate $\tau_{i,n}$ of $i$-th junction with the maximal root $\lambda_n$ of a polynomial.
