A fast iteration algorithm proposed is applied to solve the latitude of geocentric earth coordination from geocentric Cartesian coordination. Comparing with other well-known algorithms, the simulation results demonstrate that the algorithm is better in computation speed, computation precision and simpler in computation complexity; therefore, it is available for the portable. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Lu, D., Zhao, W. B., & Du, J. Y. (2009). A fast iteration algorithm for solving the geocentric earth latitude coordination based on the geocentric cartesian coordination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5754 LNCS, pp. 880–887). https://doi.org/10.1007/978-3-642-04070-2_93
Mendeley helps you to discover research relevant for your work.