平面控制网网点优化排序研究

The Research on the Optimal Sequence of Net Points in Horizental Network Adjustments

本文利用法方程系数阵的稀疏性,将Banker算法和RCM算法应用于平面控制网数据处理,实现网点自动优化排序,压缩了法方程系数阵的存贮空间。借助于各类平面网平差模型对Banker 算法和RCM算法进行了比较、分析。采用优化排序算法不仅能扩大微机的解算容量,同时也提高了解算速度,减少了计算过程中的舍入误差,且适用于任意平面网、高程网,GPS网的自动化数据处理。

In this paper, the necessity and realization of sparsematrix-techniques in adjust-ments of horizontal networks are discussed. Some numerical tests indicate that in many casesBanker algorithm can produce lower profiles than RCM algorithm. With sparse-matrixtech-niques, adjustment programs can not only calculate larger networkes on micro-computers butalso speed up calculating and reduce the round-off errors in adjustment results.