Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T23:31:38.574Z Has data issue: false hasContentIssue false

A Global algorithm for geodesics

Published online by Cambridge University Press:  09 April 2009

Lyle Noakes
Affiliation:
Department of Mathematics, The University of Western Australia, Nedlands WA 6907, Australia email: lyle@maths.uwa.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The problem of finding a george joinning given points x0, x1 in a connected complete Riemannian manifold requires much more effort than determining a geodesic from initial data. Boundary value problems of this type are sometimes solved using shooting methods, which work best when good initial guesses are available expectually when x0, x1 are nearby. Galerkin methods have their drawbacks too. The situation is much more difficult with general variational problems, which is why we focus on the Riemannian case.

Our global algorithm is very simple to implement, and works well in practice, with no need for an initial guess. The proof of convergence to elementary and very carefully stated. with a view to possible generalizations latter on we have in mind the much larger class of interesting problems arising in optimal control especially from mechanical engineering.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1998