The adjustment of intersecting chains of triangulation using a medium sized computer

Summary A method of adjusting intersecting chains of triangulation by direct elimination, using variation of coordinates, is given which is suitable for a computer of modest storage capacity (about 4000–8000 words). The network is considered to be made up of “nodes” (where two or more chains intersect) and “links” (which connect two nodes). The normal equations for the points in each link are computed, the coefficients of the unknown coordinates of the associated nodes being treated as extra right hand sides. These equations are then solved to express the coordinates of any link station in terms of the associated nodes. The process is repeated for all links. The normal equations for the nodes are then set up and substitution made for all “link” terms. The method is particularly powerful for the adjustment of a few, long, interconnected chains since the reduced normal equation coefficients are then banded about the diagonal, the semi band width being a little greater than the largest number of unknowns in the nodes along a single tie chain. For a computer of 7000 words capacity it is possible to solve for a band width of over 100 unknowns i.e. more than 50 stations.