SRmatrix en
SRmatrix en
Andrs Ruiz
San Sebastin Donostia
43 19N 002W
http://sites.google.com/site/navigationalalgorithms/
2
Index
Abstract
An analytical method for obtain the position by celestial sights using matrix algebra is
described. The simplicity of the process allows the use of a hand held calculator or PDA.
Navigational Algorithms
3
Finding position by stars Take care with the signs of the variables;
the mathematical functions use a different
If we take some sight with a sextant, we criterion to the nautical one:
shall be able to obtain our position by
intersecting the associated circles of
position, COP. -90 B 90 [+N/-S]
0 L 360 [+ W E]
-90 Dec 90 [+N/-S]
0 GHA 360 [+ W E]
Two Observations
If two bodies are shot there are two
solutions or one.
Two solutions: The two COPs
Circles of Equal Altitude have two points of intersection.
Our DR position determines what
the real one is.
For one sight, the vectorial equation of
the circle of equal altitude is: One solution: if the two COPs are
tangents. This theorist case is very
OP GP cos(90 Ho) improbable in navigation
And in Cartesian coordinates we have: There are three unknown parameters, the
Cartesian coordinates of the true position,
cos B cos L hence three equations are needed in order
OP cos B sin L to calculate them: the two COP equations
sin B and the fact that from the observers position
the zenith altitude is 90.
cos Dec cos GHA
The algorithm is described in the
GP cos Dec sin GHA appendix.
sin Dec
90
80
M3 = x1*y2*z3+y1*z2*x3+z1*x2*y3-
70
60
(z1*y2*x3+x1*z2*y3+y1*x2*z3)
50
Mx = y2*z3+y1*z2+y3*z1-
40
30
(y2*z1+y1*z3+y3*z2)
20
10
0
-180 -165 -150 -135 -120 -105 -90 -75 -60 -45 -30 -15 0 15 30 45 60 75 90 105 120 135 150 165 180
-10
-20
-30
My = z2*x3+z1*x2+z3*x1-
-40
-50
(z2*x1+z1*x3+z3*x2)
-60
-70
-80
-90
Mz = x2*y3+x1*y2+x3*y1-
(x2*y1+x1*y3+x3*y2)
2 COP and solution points in an iterative process for
the two intersections
This method works only for one point of
3 Observations intersection. Otherwise a least squares
method must be used to find the most
For three sights the system of equations probable celestial position.
is determined, and is it possible to obtain an
explicit solution:
x1 y1 z1
M 3 x2 y2 z2
x3 y3 z3
Mx 1 y1 z1
xF
M3 Mx 1 y2 z2
My 1 y3 z3
yF
M3 x1 1 z1
Mz My x2 1 z 2
zF
M3 x3 1 z 3
x1 y1 1
M z x2 y2 1
x3 y3 1
Navigational Algorithms
5
A1. Algorithms
Navigational Algorithms
7
A2. Examples
3 Observations
Using the method explained in the 3 Observations section, not the general one.
Input data:
Navigational Algorithms
Sight Reduction with matrices
http://www.geocities.com/andresruizgonzalez
Assumed Position
Be = 43.3167
Le = 2.0000
X 0.72712784
Y = 0.02538372
Z 0.68603263
B = 43.3168721 46.6831279
L = 1.99935875 88.0006412
Iteration
X 0.00553388
Y = 0.73137457
Z 0.68160992
B = 42.9820851
L = 89.5664846
X 0.71873376
Y = 0.03556087
Z 0.69437855
B = 43.977596
L = 2.83251973
X 0.7187278
Y = 0.03555919
Z 0.69438517
B = 43.9781085
L = 2.83240931
A3. Software
An Excel sheet is available for up to 5 observations
A5. References
Watkins. R. and Janiczek. P. M., Sight Reduction with Matrices, NAVIGATION, Journal of
The Institute of Navigation, Vol. 25, No. 4, Winter 1978-79, pp. 447-48
Vector equation of the circle of equal altitude. Andrs Ruiz, Navigational Algorithms.