aboutsummaryrefslogtreecommitdiff
path: root/redist/dclhelpers.h
diff options
context:
space:
mode:
authorcnlohr <lohr85@gmail.com>2018-03-17 01:13:28 -0400
committercnlohr <lohr85@gmail.com>2018-03-17 01:13:28 -0400
commit8b9a196232661bd6506a41b7ceca015d684086a8 (patch)
treea37e294ebc9c7944bea3c8e0e1f0bfc67fbc1c6d /redist/dclhelpers.h
parent75a176d2ef65de8450b2054065d5c068a19966a6 (diff)
downloadlibsurvive-8b9a196232661bd6506a41b7ceca015d684086a8.tar.gz
libsurvive-8b9a196232661bd6506a41b7ceca015d684086a8.tar.bz2
Update variable ordering...
Diffstat (limited to 'redist/dclhelpers.h')
-rw-r--r--redist/dclhelpers.h26
1 files changed, 13 insertions, 13 deletions
diff --git a/redist/dclhelpers.h b/redist/dclhelpers.h
index fbaa7ec..4ada24a 100644
--- a/redist/dclhelpers.h
+++ b/redist/dclhelpers.h
@@ -11,51 +11,51 @@ void dclPrint( const DCL_FLOAT * A, int n, int m );
/* Returns the identity matrix */
void dclIdentity( DCL_FLOAT * A, int n );
-/* B = Transpose(A)
+/* R = Transpose(A)
A is (n by m)
- B is (m by n) */
-void dclTransp( const DCL_FLOAT * A, DCL_FLOAT * B, int n, int m );
+ R is (m by n) */
+void dclTransp( DCL_FLOAT * R, const DCL_FLOAT * A, int n, int m );
/* Calculate L,U of a matrix A with pivot table; the pivot table is output. */
-void dclLU( const DCL_FLOAT * A, DCL_FLOAT * L, DCL_FLOAT * U, int * Piv, int n );
+void dclLU( DCL_FLOAT * L, DCL_FLOAT * U, const DCL_FLOAT * A, int * Piv, int n );
/* Pivots a matrix to a different matrix
- B = Pivot(A) given table 'Piv'
- A and B are (n by m) */
-void dclPivot( const DCL_FLOAT * A, DCL_FLOAT * B, int * Piv, int n, int m );
+ R = Pivot(A) given table 'Piv'
+ A and R are (n by m) */
+void dclPivot( DCL_FLOAT * R, const DCL_FLOAT * A, int * Piv, int n, int m );
/* Solve LX=B for matrix X and B
L is n by n (lower triangular)
B is n by m */
-void dclLSub( const DCL_FLOAT * L, DCL_FLOAT * X, const DCL_FLOAT * B, int n, int m );
+void dclLSub( DCL_FLOAT * X, const DCL_FLOAT * L, const DCL_FLOAT * B, int n, int m );
/* Solve UX=B for matrix X and B
U is n by n (upper triangular)
B is n by m */
-void dclUSub( const DCL_FLOAT * U, DCL_FLOAT * X, const DCL_FLOAT * B, int n, int m );
+void dclUSub( DCL_FLOAT * X, const DCL_FLOAT * U, const DCL_FLOAT * B, int n, int m );
/* Inverts a matrix X (n by n) using the method of LU decomposition */
-void dclInv( const DCL_FLOAT * A, DCL_FLOAT * Ainv, int n );
+void dclInv( DCL_FLOAT * Ainv, const DCL_FLOAT * A, int n );
/* Matrix Multiply C = A * B
A (n by m)
B (m by p)
C (n by p) */
-void dclMul( const DCL_FLOAT * A, const DCL_FLOAT * B, DCL_FLOAT * C, int n, int m, int p );
+void dclMul( DCL_FLOAT * R, const DCL_FLOAT * A, const DCL_FLOAT * B, int n, int m, int p );
/* Matrix Multiply D = A * B + C
A (n by m)
B (m by p)
C (n by p)
D (n by p) */
-void dclMulAdd( const DCL_FLOAT * A, const DCL_FLOAT * B, const DCL_FLOAT * C, DCL_FLOAT * D, int n, int m, int p );
+void dclMulAdd( DCL_FLOAT * R, const DCL_FLOAT * A, const DCL_FLOAT * B, const DCL_FLOAT * C, int n, int m, int p );
/* Matrix Multiply D = alpha * A * B + beta * C
A (n by m)
B (m by p)
C (n by p)
D (n by p) */
-void dclGMulAdd( const DCL_FLOAT * A, const DCL_FLOAT * B, const DCL_FLOAT * C, DCL_FLOAT * D, DCL_FLOAT alpha, DCL_FLOAT beta, int n, int m, int p );
+void dclGMulAdd( DCL_FLOAT * D, const DCL_FLOAT * A, const DCL_FLOAT * B, const DCL_FLOAT * C, DCL_FLOAT alpha, DCL_FLOAT beta, int n, int m, int p );
#endif