Search for the point that best matches the intersection of n spheres

Question

I have an array of points with distances. I want to find the point that best satisfies the condition that

for (point_i, distance_i) in pointArray:
  abs(point - point_i) = distance_i

I think this can be solved using some kind of regression or least squares, but I am having problems with the formulation of the problem.

If anyone could help, it would be very helpful

+1

Xzhsh Feb 02 '11 at 20:43

2 answers

" ", .

gps- " ", . "" , , "" .

( linpack), .

+1

brandon 21 . '12 23:03

btilly · Accepted Answer · 2011-02-02T21:10:54+0000

You need to determine the "best" in order to have an answer question.

, , , , - , , . . , , ( (-_i) - ) ². . , , , , , . , (length (point-point_i)/distance-1) ². , . , .

, . - , . , , . , -, . , , .