引用本文: 张学廉. 综合大地主题及其实用模型[J]. 武汉大学学报 ( 信息科学版), 1987, 12(1): 59-69.
Zhang Xuelian. The Complex Geodesic Problems and the Practical Models[J]. Geomatics and Information Science of Wuhan University, 1987, 12(1): 59-69.
 Citation: Zhang Xuelian. The Complex Geodesic Problems and the Practical Models[J]. Geomatics and Information Science of Wuhan University, 1987, 12(1): 59-69.

## The Complex Geodesic Problems and the Practical Models

• 摘要: 本文第一次提出"综合大地主题"的命题,并给出了定义。列出十类综合大地主题各自的已知和待求元素,应用嵌套系数法给出它们的实用解算模型。并应用临界点和赤交点的精确位置作为判定条件,使任意二点间的任何类型的大地主题,都能获得确定唯一正确的解。给出的实用模型和嵌套系数法同样在适用范围方面不受距离的局限,可用于1-2万公里的任意距离,都能获得预期的精度。宜于电算,程序短,解算快。若采用PC-1500机,一般解算一题仅需1分钟。

Abstract: The Complex Geodesic Problem(CGP) is firstly named and it has been defined scientifically in this paper.There are 10 types of CGP.All of them have been listed with the known data and the found data.The practical models have been shown by the nested method too.The unique correct solution will be obtained for any distance between two points and any type of CGP,because the accurate positions of the critical point and the equater crossing of a geodesic are used as a determinate condition.The models are suitable well to electronic computers.The programs all are terse and the machine time is shorter.It will take just about one minute to solve any one problem of them.There is no limit on distance between the two points from one to twenty thousand kilometers and the expect accuracy can be obtained as well as the nested method.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈