úÎW9R71      !"#$%&'()*+,-./0 Safe-Inferred!123456789:;<=>?@ABCDEFGHIJKLMNOPQ123456789:BCDEFGHIJKLMNOPQ!123456789:;<=>?@ABCDEFGHIJKLMNOPQ ExperimentalWRoel van Dijk <vandijk.roel@gmail.com> Bas van Dijk <v.dijk.bas@gmail.com>None/"Cannot solve a problem with fewer ( measurements than unknowns. In case ) linear constraints are provided, this * error is also returned when the number ' of measurements is smaller than the * number of unknowns minus the number of  equality constraints. &Constraints matrix is not of full row  rank. &The matrix of constraints cannot have  more rows than columns.  A call to malloc failed in the  underlying C levmar library. %At least one lower bound exceeds the  upper one. %A call to a lapack subroutine failed ' in the underlying C levmar library. &Generic error (not one of the others) Reason for terminating. 7Stopped because model function returned invalid values , (i.e. NaN or Inf). This is a user error. Stopped because of small ||e||_2. .Stopped because no further error reduction is $ possible. Restart with increased %. 9Stopped because of singular matrix. Restart from current ' estimated parameters with increased %. 0Stopped because maximum iterations was reached. Stopped because of small Dp. "Stopped because of small gradient J^T e. (Information regarding the minimization. ||e||_2$ at initial parameters. ||e||_2& at estimated parameters.  ||J^T e||_inf at estimated parameters. ||Dp||_2% at estimated parameters. mu/ max[J^T J]_ii ] at estimated parameters. Number of iterations. Reason for terminating.  Number of function evaluations.  Number of jacobian evaluations. !Number of linear systems solved, % i.e. attempts for reducing error. 7Linear constraints consisting of a constraints matrix, k><m and . a right hand constraints vector, of length k where m is the number of  parameters and k is the number of constraints. LEnsure that these vectors have the same length as the number of parameters. Optional lower bounds Optional upper bounds !Optional weights "Optional linear constraints #Minimization options %Scale factor for initial mu. &Stopping thresholds for  ||J^T e||_inf. 'Stopping thresholds for ||Dp||_2. (Stopping thresholds for ||e||_2. )Step used in the difference # approximation to the Jacobian. If  optDelta<0, the Jacobian is approximated ) with central differences which are more ) accurate (but slower!) compared to the * forward differences employed by default. *;The Levenberg-Marquardt algorithm is overloaded to work on R and S. +#The Levenberg-Marquardt algorithm. AReturns a triple of the found parameters, a structure containing > information about the minimization and the covariance matrix  corresponding to LS solution.  Ensure that n >= m. ,The  <http://en.wikipedia.org/wiki/Jacobian_matrix_and_determinantjacobian of the -4 function. Expressed as a function from a vector of Dparameters to a matrix which for each expected sample describes the 'partial derivatives of the parameters.  Ensure that the length m2 of the parameter vector equals the length of the  initial parameter vector in +. 1 Ensure that the output matrix has the dimension n><m where n is the  number of samples and m is the number of parameters. -HA functional relation describing measurements represented as a function =from a vector of parameters to a vector of expected samples.  Ensure that the length m2 of the parameter vector equals the length of the  initial parameter vector in +.  Ensure that the length n2 of the output sample vector equals the length of  the sample vector in +.  Ensure that the length n6 of the output sample vector vector is bigger than or  equal to the length m of the parameter vector. .Sample vector of length n.  Ensure that n >= m where m is the length of the / vector. /Parameter vector of length m.  Ensure that m <= n where n is the length of the . vector. T gen_levmar2 takes the low-level C functions as arguments and Iexecutes one of them depending on the optional jacobian and constraints. Preconditions:   length ys >= length ps  isJust mLowBs &&' length (fromJust mLowBs) == length ps  && isJust mUpBs &&' length (fromJust mUpBs) == length ps  boxConstrained && (all $ zipWith (<'=) (fromJust mLowBs) (fromJust mUpBs)) 0Default minimization options U V is defined as a  where all fields are W.  X merges two  by taking the first non-W value  for each field. <  !"#$%&'()*+Model Optional jacobian Initial parameters of length m Sample vector of length n Maximum iterations Minimization options  Constraints ,-./TModel Optional jacobian Initial parameters Samples Maximum iterations Options  Constraints YZ0[\]^_U`a1  !"#$%&'()*+,-./01/.-,*+#$%&'()0 !"    !"#$%&'()*+,-./TYZ0[\]^_U`ab      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSQRTUVWXYWZ[WX\]^_`abcdeflevmar-1.2.1.2Numeric.LevMarBindings.LevMar.CurryFriendly LevMarErrorTooFewMeasurementsConstraintMatrixNotFullRowRankConstraintMatrixRowsGtColsMemoryAllocationFailureFailedBoxCheck LapackError StopReason InvalidValues SmallNorm2E SmallestErrorSingularMatrix MaxIterationsSmallDp SmallGradientInfo infNorm2initE infNorm2EinfNormInfJacTe infNorm2Dp infMuDivMax infNumIter infStopReasoninfNumFuncEvalsinfNumJacobEvalsinfNumLinSysSolvedLinearConstraints Constraints lowerBounds upperBoundsweightslinearConstraintsOptionsOptsoptScaleInitMuoptStopNormInfJacTeoptStopNorm2Dp optStopNorm2EoptDelta LevMarablelevmarJacobianModelSamplesParams defaultOpts LevMarBLecDer LevMarBLecDif LevMarLecDer LevMarLecDif LevMarBCDer LevMarBCDif LevMarDer LevMarDifBoxConstraints mk_levmar_dermk_levmar_bc_difmk_levmar_bc_dermk_levmar_lec_difmk_levmar_lec_dermk_levmar_blec_difmk_levmar_blec_der slevmar_dif dlevmar_dif slevmar_der dlevmar_derslevmar_bc_difdlevmar_bc_difslevmar_bc_derdlevmar_bc_derslevmar_lec_difdlevmar_lec_difslevmar_lec_derdlevmar_lec_derslevmar_blec_difdlevmar_blec_difslevmar_blec_derdlevmar_blec_derghc-prim GHC.TypesDoubleFloat gen_levmar$fMonoidConstraintsbase Data.Monoidmempty Data.MaybeNothingmappendmaybeWithArrayfastMallocForeignPtrArray optsToList listToInfolevmarCErrorToLevMarErrorconvertLevMarError$fExceptionLevMarError$fLevMarableDouble$fLevMarableFloat