A closed-form of Newton method for solving over-determined pseudo-distance equations

The Newton method has been widely used for solving nonlinear least-squares problem. In geodetic adjustment, one would prefer to use the Gauss–Newton method because of the parallel with linear least-squares problem. However, it is proved in theory as well as in practice that the Gauss–Newton method has slow convergence rate and low success rate. In this paper, the over-determined pseudo-distance equations are solved by nonlinear methods. At first, the convergence of decent methods is discussed after introducing the conditional equation of nonlinear least squares. Then, a compacted form of the Hessian matrix from the second partial derivates of the pseudo-distance equations is given, and a closed-form of Newton method is presented using the compacted Hessian matrix to save the computation and storage required by Newton method. At last, some numerical examples to investigate the convergence and success rate of the proposed method are designed and performed. The performance of the closed-form of Newton method is compared with the Gauss–Newton method as well as the regularization method. The results show that the closed-form of Newton method has good performances even for dealing with ill-posed problems while a great amount of computation is saved.

[1]  Peter Teunissen,et al.  Nonlinearity and Least-Squares. , 1988 .

[2]  Erik W. Grafarend,et al.  GPS Solutions: Closed Forms, Critical and Special Configurations of P4P , 2002, GPS Solutions.

[3]  Niilo Sirola Closed-form algorithms in mobile positioning: Myths and misconceptions , 2010, 2010 7th Workshop on Positioning, Navigation and Communication.

[4]  J. Awange,et al.  Explicit solution of the overdetermined three-dimensional resection problem , 2003 .

[5]  Peter Teunissen,et al.  Nonlinear inversion of geodetic and geophysical data : Diagnosing nonlinearity , 1990 .

[6]  Peter Teunissen,et al.  First and second moments of non-linear least-squares estimators , 1989 .

[7]  Junlin Yan,et al.  Feasibility of Gauss-Newton method for indoor positioning , 2008, 2008 IEEE/ION Position, Location and Navigation Symposium.

[8]  E. Grafarend Linear and nonlinear models : fixed effects, random effects, and mixed models , 2006 .

[9]  G. Golub,et al.  Bounds for the error of linear systems of equations using the theory of moments , 1972 .

[10]  Ping Wei,et al.  A robust TDOA-based location method and its performance analysis , 2009, Science in China Series F: Information Sciences.

[11]  Béla Paláncz,et al.  Algebraic Geodesy and Geoinformatics , 2010 .

[12]  Peter Teunissen,et al.  Nonlinear least squares , 1990 .

[13]  Critical configurations (determinantal loci) for range and range difference satellite networks , 1973 .

[14]  S. Xue,et al.  Gauss–Jacobi combinatorial adjustment and its modification , 2014 .

[15]  Junlin Yan,et al.  A Framework for Low Complexity Least-Squares Localization With High Accuracy , 2010, IEEE Transactions on Signal Processing.

[16]  Xiao-Wen Chang,et al.  Huber’s M-estimation in relative GPS positioning: computational aspects , 2005 .

[17]  Wu Chen,et al.  Dynamic positioning configuration and its first-order optimization , 2014, Journal of Geodesy.

[18]  J. Awange,et al.  Ranging algebraically with more observations than unknowns , 2003 .

[19]  Kaj Madsen,et al.  Methods for Non-Linear Least Squares Problems (2nd ed.) , 2004 .

[20]  E. Grafarend,et al.  The planar trisection problem and the impact of curvature on non-linear least-squares estimation , 1991 .

[21]  E. Grafarend The geometry of nonlinear adjustment-the planar trisection problem- , 1989 .