Author: Seemkooei, Alireza Amiri

Source: Survey Review, Volume 36, Number 286, October 2002 , pp. 627-633(7)

Publisher: Maney Publishing

Abstract:

The conversion from geocentric to geodetic coordinates is among of the most important tasks in computational geodesy. This conversion is often complicated and time consuming. In order to deal with the large quantities of points, it is important to select the fastest possible algorithm without compromising the accuracy. From the numerical standpoint, the available conversion algorithms have to be solved either iteratively, through a linearization, or using an algebraic equation of forth degree. In this paper, five iterative algorithms and one closed form solution for transformation from geocentric to geodetic coordinates are compared for numerical efficiency. It is concluded that the simple iteration method implemented in Bowring's algorithm executes faster than the others. Only one iteration is sufficient to produce coordinates accurate to the comparable level of O.3.10⁻¹⁶ rad, which exceeds the requirements of any practical application.

Document Type: Research Article

DOI: http://dx.doi.org/10.1179/003962602791482966

Publication date: 2002-10-01

More about this publication?

• Editorial Board
• Information for Authors
• Subscribe to this Title
• Information for Advertisers
• Terms & Conditions
• Top articles
• Materials Science & Engineering Spotlight
• Virtual Maney - Materials Science & Engineering
• ingentaconnect is not responsible for the content or availability of external websites

Related content

• In this: publication
• By this: publisher
• By this author: Seemkooei, Alireza Amiri

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers