Ranging algebraically with more observations than unknowns

Details Ranging algebraically with more observations than unknowns Ranging algebraically with more observations than unknowns

Jul 2003

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2003ep%26s...55..387a&link_type=abstract

Earth, Planets and Space, Volume 55, p. 387-394.

Statistics

Applications

Scientific paper

In the recently developed Spatial Reference System that is designed to check and control the accuracy of the three-dimensional coordinate measuring machines and tooling equipment (Metronom US., Inc., Ann Arbor: http://www.metronomus.com), the coordinates of the edges of the instrument are computed from distances of the bars. The use of distances in industrial application is fast gaining momentum just as in Geodesy and in Geophysical applications and thus necessitating efficient algorithms to solve the nonlinear distance equations. Whereas the ranging problem with minimum known stations was considered in our previous contribution in the same Journal, the present contribution extends to the case where one is faced with many distance observations than unknowns (overdetermined case) as is usually the case in practise. Using the Gauss-Jacobi Combinatorial approach, we demonstrate how one can proceed to position without reverting to iterative and linearizing procedures such as Newton's or Least Squares approach.

Affiliated with

Also associated with

No associations

Rating

Ranging algebraically with more observations than unknowns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ranging algebraically with more observations than unknowns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ranging algebraically with more observations than unknowns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1467063