In an earlier paper, Mittal (1984) presented a simple but elegant algorithm for distributing random errors in the network adjustment of potential data. In this paper, we reexamine Mittal's algorithm and suggest an improvement.

In Mittal's algorithm, the weightage assigned to the ith line is defined as
(1)
where Δg(l)i is the mistie of the observed data (e.g., gravity) at the intersection l of ith line with any other line, and Ki is the number of intersections.
The weighted average of the observed data at an intersection (i, j) is computed from
(2)
where...
You do not have access to this content, please speak to your institutional administrator if you feel you should have access.