From d54fe7c1f704a63824c5bfa0ece65245572e9b27 Mon Sep 17 00:00:00 2001 From: Joseph Hunkeler Date: Wed, 4 Mar 2015 21:21:30 -0500 Subject: Initial commit --- src/slalib/sun67.htx/node177.html | 152 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 152 insertions(+) create mode 100644 src/slalib/sun67.htx/node177.html (limited to 'src/slalib/sun67.htx/node177.html') diff --git a/src/slalib/sun67.htx/node177.html b/src/slalib/sun67.htx/node177.html new file mode 100644 index 0000000..733a9c6 --- /dev/null +++ b/src/slalib/sun67.htx/node177.html @@ -0,0 +1,152 @@ + + + + +SLA_SMAT - Solve Simultaneous Equations + + + + + + + + + + + + +

+ +next + +up + +previous +
+ Next: SLA_SUBET - Remove E-terms +
+Up: SUBPROGRAM SPECIFICATIONS +
+ Previous: SLA_SEP - Angle Between 2 Points on Sphere +

+

+

SLA_SMAT - Solve Simultaneous Equations +   +

+
+
ACTION: +
Matrix inversion and solution of simultaneous equations +(single precision). +

CALL: +
CALL sla_SMAT (N, A, Y, D, JF, IW) +

+

+
GIVEN: +
+
+ + + + + + + + + + + + + +
NInumber of unknowns
AR(N,N)matrix
YR(N)vector
+

+
RETURNED: +
+
+ + + + + + + + + + + + + + + + + + + + + +
AR(N,N)matrix inverse
YR(N)solution
DRdeterminant
JFIsingularity flag: 0=OK
IWI(N)workspace
+

+
NOTES: +
+
1. +
For the set of n simultaneous linear equations in n unknowns: +
A$\cdot$y = x +
+ where: +
    +
  • A is a non-singular $n \times n$ matrix, +
  • y is the vector of n unknowns, and +
  • x is the known vector, +
+ sla_SMAT computes: +
    +
  • the inverse of matrix A, +
  • the determinant of matrix A, and +
  • the vector of n unknowns y. +
+ Argument N is the order n, A (given) is the matrix A, + Y (given) is the vector x and Y (returned) + is the vector y. + The argument A (returned) is the inverse matrix A-1, + and D is det(A). +
2. +
JF is the singularity flag. If the matrix is non-singular, + JF=0 is returned. If the matrix is singular, JF=-1 + and D=0.0 are returned. In the latter case, the contents + of array A on return are undefined. +
3. +
The algorithm is Gaussian elimination with partial pivoting. + This method is very fast; some much slower algorithms can give + better accuracy, but only by a small factor. +
4. +
This routine replaces the obsolete sla_SMATRX. +
+

+ +next + +up + +previous +
+ Next: SLA_SUBET - Remove E-terms +
+Up: SUBPROGRAM SPECIFICATIONS +
+ Previous: SLA_SEP - Angle Between 2 Points on Sphere +

+

+

+SLALIB --- Positional Astronomy Library
Starlink User Note 67
P. T. Wallace
12 October 1999
E-mail:ptw@star.rl.ac.uk
+
+ + -- cgit