Abstract
An innovative algorithm to determine the inverse solution of a geodesic with the vertex or Clairaut constant located between two points on a spheroid is presented. This solution to the inverse problem will be useful for solving problems in navigation as well as geodesy. The algorithm to be described derives from a series expansion that replaces integrals for distance and longitude, while avoiding reliance on trigonometric functions. In addition, these series expansions are economical in terms of computational cost. For end points located at each side of a vertex, certain numerical difficulties arise. A finite difference method together with an innovative method of iteration that approximates Newton's method is presented which overcomes these shortcomings encountered for nearly antipodal regions. The method provided here, which does not involve an auxiliary sphere, was aided by the Computer Algebra System (CAS) that can yield arbitrarily truncated series suitable to the users accuracy objectives and which are limited only by machine precisions.
Publisher
Cambridge University Press (CUP)
Subject
Ocean Engineering,Oceanography
Reference26 articles.
1. Algorithms for geodesics
2. The geodesic inverse problem
3. ArcGIS Resources. (2014). Calculating Geodesic Distance Between Points. http://blogs.esri.com/esri/arcgis/2011/07/21/calculating_geodesic. Accessed 13 January 2014.
4. A Comparison of Great Circle, Great Ellipse, and Geodesic Sailing;Tseng;Journal of Marine Science and Technology,2013
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献