SOLVING THE MULTIPLE LINEAR INTERSECTION ON ELLIPSOID BY NONLINEAR PROGRAMMING METHOD
Solving of multiple linear intersection on ellipsoid by methods of blind search, relaxation, gradient method of descent, Gauss (method of linearized iterations) and Newton is analysed. Modern development of satellite measurements is assumed to solve geodetic structures in system of geodetic coordinates without their reduction on the plane. Application of method of nonlinear programming enables solving geodetic structures, which do not have closed formulas or when deriving of such formulas is difficult. Thus, application of described in the article methods allows, first, solving geodetic structures without considering any certain system of plane rectangular coordinates, second, avoiding complicated formulas and algorithms, which appear when solving geodetic tasks on ellipsoid. Investigations show that the best for solving indicated task is relaxation method, since it does not require input of preliminary coordinates of determined points.