levmar-0.2.1: An implementation of the Levenberg-Marquardt algorithmContentsIndex
Search:
$*
:::
caseNat
compose
ComposeN
ConstraintMatrixNotFullRowRank
ConstraintMatrixRowsGtCols
CovarMatrix
1 (Type/Class)
2 (Type/Class)
defaultOpts
FailedBoxCheck
foldr
foldrN
fromList
induction
infMuDivMax
infNorm2Dp
infNorm2E
infNorm2initE
infNormInfJacTe
infNumFuncEvals
infNumIter
infNumJacobEvals
infNumLinSysSolved
Info
1 (Type/Class)
2 (Data Constructor)
infStopReason
InvalidValues
Jacobian
1 (Type/Class)
2 (Type/Class)
3 (Type/Class)
4 (Type/Class)
jacobianOf
1 (Function)
2 (Function)
LapackError
length
levmar
1 (Function)
2 (Function)
3 (Function)
4 (Function)
5 (Function)
6 (Function)
7 (Function)
8 (Function)
LevMarable
LevMarError
1 (Type/Class)
2 (Data Constructor)
LinearConstraints
1 (Type/Class)
2 (Type/Class)
Matrix
MaxIterations
MemoryAllocationFailure
Model
1 (Type/Class)
2 (Type/Class)
3 (Type/Class)
4 (Type/Class)
N
Nat
nat
NFunction
Nil
noLinearConstraints
optDelta
Options
Opts
optScaleInitMu
optStopNorm2Dp
optStopNorm2E
optStopNormInfJacTe
replicate
S
1 (Type/Class)
2 (Data Constructor)
SimpleJacobian
1 (Type/Class)
2 (Type/Class)
SimpleModel
1 (Type/Class)
2 (Type/Class)
SingularMatrix
SizedList
SmallDp
SmallestError
SmallGradient
SmallNorm2E
StopReason
Succ
toList
TooFewMeasurements
unsafeFromList
witnessNat
Z
1 (Type/Class)
2 (Data Constructor)
Zero