The paper presents in a generalized form the problem of the geodetic network adjustment by the Helmert-Pranis Pranievich groups method (groups with junction points included or not).
The adjustment problem, as well as the cofactor matrix derivation for the partial-independent and linkage unknowns, was completely formulated by transformed weight matrix definition and usage.
A complete sequence of the computing stages for the geodetic networks divided into groups without junctions points was given for eficient programming of adjustment processing on computer.
A practical example illustrate the identity of the solutions and the cofactors obtained by the group adjustment proposed to those obtained by the block adjustment.
© 2008-2025 Fundación Dialnet · Todos los derechos reservados