Index: trunk/psLib/src/dataManip/psMinimize.c
===================================================================
--- trunk/psLib/src/dataManip/psMinimize.c	(revision 3000)
+++ trunk/psLib/src/dataManip/psMinimize.c	(revision 3026)
@@ -9,6 +9,6 @@
  *  @author GLG, MHPCC
  *
- *  @version $Revision: 1.99 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2005-01-14 23:27:56 $
+ *  @version $Revision: 1.100 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2005-01-17 22:17:29 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -294,5 +294,5 @@
         This can not be implemented until SDR states what order spline should be
         created.
-     
+
         Should we error if mySPline is not NULL?
     */
@@ -616,5 +616,5 @@
     psS32 p;
     psVector *beta = psVectorAlloc(numParams, PS_TYPE_F64);
-    psVector *perm = psVectorAlloc(numParams, PS_TYPE_F64);
+    psVector *perm = NULL;
 
     psVector *paramDeltasF64 = psVectorAlloc(numParams, PS_TYPE_F64);
@@ -738,5 +738,5 @@
         // XXX: How do we know if these functions were successful?
         //
-        aOut = psMatrixLUD(aOut, perm, A);
+        aOut = psMatrixLUD(aOut, &perm, A);
         paramDeltasF64 = psMatrixLUSolve(paramDeltasF64, aOut, beta, perm);
 
@@ -936,5 +936,4 @@
     coeffs = psVectorAlloc(polyOrder, PS_TYPE_F64);
     X = psVectorAlloc(x->n, PS_TYPE_F64);
-    outPerm = psVectorAlloc(polyOrder, PS_TYPE_F64);
     xSums = psVectorAlloc(1 + 2 * polyOrder, PS_TYPE_F64);
 
@@ -943,5 +942,4 @@
         B->data.F64[i] = 0.0;
         coeffs->data.F64[i] = 0.0;
-        outPerm->data.F64[i] = 0.0;
         for (j = 0; j < polyOrder; j++) {
             A->data.F64[i][j] = 0.0;
@@ -987,5 +985,5 @@
 
     // XXX: How do we know if these routines were successful?
-    ALUD = psMatrixLUD(ALUD, outPerm, A);
+    ALUD = psMatrixLUD(ALUD, &outPerm, A);
     coeffs = psMatrixLUSolve(coeffs, ALUD, B, outPerm);
 
@@ -1139,11 +1137,11 @@
 Algorithm:
  
-XXX completely ad hoc:  
+XXX completely ad hoc:
 start with the user-supplied starting parameter and
 call that b.  Calculate a/c as a fractional amount smaller/larger than b.
 Repeat this process until a local minimum is found.
  
-XXX:  
-new algorithm:  
+XXX:
+new algorithm:
 start at x=0, expand in one direction until the function
 decreases.  Then you have two points in the bracket.  Keep going until it
@@ -1151,8 +1149,8 @@
 direction.
  
-XXX: 
+XXX:
 This is F32 only.
  
-XXX: 
+XXX:
 output bracket vector should be an input as well.
 *****************************************************************************/