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

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 cases Banker algorithm can produce lower profiles than RCM algorithm. With sparse-matrixtech-niques, adjustment programs can not only calculate larger networkes on micro-computers but also speed up calculating and reduce the round-off errors in adjustment results.