Solve a nonlinear least-squares problem using a modified Levenberg-Marquardt algorithm and a Jacobian.
NonlinLeastSquares.IFunction
that defines the least-squares problem. If f
implements IJacobian
then its Jacobian is used. Otherwise, a finite difference Jacobian is used. A double
array of length n containing the approximate solution.
Exception Type | Condition |
---|---|
TooManyIterationsException | is thrown if the number of iterations exceeds MaximumIterations , MaximumIterations is set to 100 by default |
NonlinLeastSquares Class | Imsl.Math Namespace