GPS网平差方程的自动列写及实现  

Automatic establishment and realization of GPS net adjustment equation

作　　者：洪菊[1] 赵凯[1] 李金涛[1] 王胜利[2] 石波[1] 

机构地区：[1]山东科技大学测绘科学与工程学院,山东青岛266590 [2]山东科技大学海洋工程研究院,山东青岛266590

出　　处：《导航定位学报》2016年第2期108-112,共5页Journal of Navigation and Positioning

基　　金：海岛(礁)测绘技术国家测绘地理信息局重点实验室资助项目(2014B02;2015A01)

摘　　要：针对GPS网平差中由于数据过多导致的方程列写困难、运算效率低等问题,提出了GPS网平差方程自动列写及快速实现的方法。根据GPS网平差数据特点,该方法在无约束平差与约束平差具体应用过程中采用压缩存储法存储对称矩阵以节省内存空间,采用Cholesky分解法解算法方程以加快运算效率,达到GPS网平差方程的快速解算的效果。结果表明:使用该方法能够确定GPS网中点在指定参照系下的坐标,达到GB/T18314—2009对约束平差的要求;此方法与常规方法相比可较好节省内存空间,提高运算效率。In view of the difficulty of writing and the low computation efficiency of the equation caused by large amounts of data in GPS network adjustment,a method of the automatic establishment and quick realization of GPS net adjustment equation was presented in this paper.In the light of the characteristics of GPS net adjustment data,in order to save memory space and improve computation efficiency,the compression storage method and the Cholesky decomposition method were taken to store positive definite matrices and resolve normal equations in the specific applications of free adjustment and constraint adjustment.The result showed that the method compared with the conventional one could save memory space and improve computation efficiency greatly on the basis of rightly determining the coordinate of the midpoints of GPS network in the specified reference coordinate system,with matching the accuracy requirements of GB/T18314—2009for constraint adjustment.

关 键 词：GPS网平差 无约束平差 约束平差 自动列写方程式 矩阵压缩存储 Cholesky分解法 

分 类 号：P228[天文地球—大地测量学与测量工程]