最短独立闭合环与附合路线的快速搜索方法  

A quick method to search least independent close loops and annexed lines

作　　者：游为[1] 范东明[1] 付淑娟[1] 

机构地区：[1]西南交通大学土木工程学院,成都610031

出　　处：《测绘科学》2009年第4期139-140,100,共3页Science of Surveying and Mapping

基　　金：地球空间环境与大地测量教育部重点实验室测绘基础研究基金(04-01-02)

摘　　要：提出了一种间接平差误差方程转化为条件平差条件方程的快速且易实现自动化的方法,同时采用矩阵分析理论,通过对条件方程进行特殊的矩阵分块及变换,自动搜索出水准网或GPS网的最短独立闭合环与附合路线,并自动解算出闭合差。上述方法有别于传统的图论理论,不依赖于任何信息文件,算法简单,自动化程度高。A method is addressed, which turns observation equations of parameter adjustment into condition equations of condition adjustment quickly and automatically. Then the paper studies on special separation and transformation of matrix with the theory of matrix. With above method, least independent close loops and annexed lines of leveling network or GPS network can be searched and closed error can be calculated automatically. Above method is different from traditional graph theory. It does not rely on any information files and has automatically simple algorithms.

关 键 词：最短独立闭合环与附合路线 闭合差 水准网 GPS网 

分 类 号：P207[天文地球—测绘科学与技术]