Changeset 3026 for trunk/psLib/src/dataManip/psMinimize.c
- Timestamp:
- Jan 17, 2005, 12:17:29 PM (22 years ago)
- File:
-
- 1 edited
-
trunk/psLib/src/dataManip/psMinimize.c (modified) (9 diffs)
Legend:
- Unmodified
- Added
- Removed
-
trunk/psLib/src/dataManip/psMinimize.c
r3000 r3026 9 9 * @author GLG, MHPCC 10 10 * 11 * @version $Revision: 1. 99$ $Name: not supported by cvs2svn $12 * @date $Date: 2005-01-1 4 23:27:56$11 * @version $Revision: 1.100 $ $Name: not supported by cvs2svn $ 12 * @date $Date: 2005-01-17 22:17:29 $ 13 13 * 14 14 * Copyright 2004 Maui High Performance Computing Center, University of Hawaii … … 294 294 This can not be implemented until SDR states what order spline should be 295 295 created. 296 296 297 297 Should we error if mySPline is not NULL? 298 298 */ … … 616 616 psS32 p; 617 617 psVector *beta = psVectorAlloc(numParams, PS_TYPE_F64); 618 psVector *perm = psVectorAlloc(numParams, PS_TYPE_F64);618 psVector *perm = NULL; 619 619 620 620 psVector *paramDeltasF64 = psVectorAlloc(numParams, PS_TYPE_F64); … … 738 738 // XXX: How do we know if these functions were successful? 739 739 // 740 aOut = psMatrixLUD(aOut, perm, A);740 aOut = psMatrixLUD(aOut, &perm, A); 741 741 paramDeltasF64 = psMatrixLUSolve(paramDeltasF64, aOut, beta, perm); 742 742 … … 936 936 coeffs = psVectorAlloc(polyOrder, PS_TYPE_F64); 937 937 X = psVectorAlloc(x->n, PS_TYPE_F64); 938 outPerm = psVectorAlloc(polyOrder, PS_TYPE_F64);939 938 xSums = psVectorAlloc(1 + 2 * polyOrder, PS_TYPE_F64); 940 939 … … 943 942 B->data.F64[i] = 0.0; 944 943 coeffs->data.F64[i] = 0.0; 945 outPerm->data.F64[i] = 0.0;946 944 for (j = 0; j < polyOrder; j++) { 947 945 A->data.F64[i][j] = 0.0; … … 987 985 988 986 // XXX: How do we know if these routines were successful? 989 ALUD = psMatrixLUD(ALUD, outPerm, A);987 ALUD = psMatrixLUD(ALUD, &outPerm, A); 990 988 coeffs = psMatrixLUSolve(coeffs, ALUD, B, outPerm); 991 989 … … 1139 1137 Algorithm: 1140 1138 1141 XXX completely ad hoc: 1139 XXX completely ad hoc: 1142 1140 start with the user-supplied starting parameter and 1143 1141 call that b. Calculate a/c as a fractional amount smaller/larger than b. 1144 1142 Repeat this process until a local minimum is found. 1145 1143 1146 XXX: 1147 new algorithm: 1144 XXX: 1145 new algorithm: 1148 1146 start at x=0, expand in one direction until the function 1149 1147 decreases. Then you have two points in the bracket. Keep going until it … … 1151 1149 direction. 1152 1150 1153 XXX: 1151 XXX: 1154 1152 This is F32 only. 1155 1153 1156 XXX: 1154 XXX: 1157 1155 output bracket vector should be an input as well. 1158 1156 *****************************************************************************/
Note:
See TracChangeset
for help on using the changeset viewer.
