A Convergence issue in this Least Squares calculation

ChiPi
Messages
2
Reaction score
0
TL;DR Summary
I am not able to reach convergence if I initialize the starting point with coordinates outside the stations net. The observations are Difference in Time of Arrival.
I'm computing the trajectory of a moving body and my net is composed by 5 stations.
My observations are DTOA: difference in time of Arrival (they have been linearized).
I am trying to use Least Squares with a linear model: Y = Ax + b, where Y are the observed measurements (DTOA), A the design matrix, b is the known terms vector and X is a vector of estimates. The algorithm processes data according to the epoch considered and iterate the process up to a value of 20 times, unless it reaches before a 1mm convergence.

Since it is an iterative process, the system requires an initialization at the starting point with approximated values for the unknowns, and here comes my problem: if I initialize the starting point with coordinates within the polygon formed by the five stations convergence is reached and the solution is successful, but if I initialize the point with coordinates outside the area formed by the stations the convergence is not reached and I’m not able to determine the trajectory.

Does anyone of you have an explanation for this?
 
Physics news on Phys.org
I have a pretty good idea but you should figure this out. Do you have access to the iterative rms error data? Does is say anything to you?
 
hutchphd said:
I have a pretty good idea but you should figure this out. Do you have access to the iterative rms error data? Does is say anything to you?
I don't have access to it but I can add it at the code if it can help in figuring out the problem. What was your idea?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top