Click or drag to resize

DHI.Mike1D.Generic.MathAlgorithms Namespace

Various math algorithms.
Classes
  ClassDescription
Public classLevenbergMarquardt2D
A class for finding minimum of a least squared problem on the form
f(x,y) = ||fv(x,y)||
where fv is a 2D function - returns a vector of length 2.

It is using a Levenberg-Marquardt method or a Newton-Raphson method, according to UseLm.

Finding zeros of a nonlinear system of equations, i.e.
fv(x,y) = [0,0]
is a special case of a least square minimization problem, where the minimum is in the zero point and fv(x*,y*) = (0,0).

If the Jacobian is available, it can be provided, otherwise it works by numerically calculating the Jacobian.

Public classNewtonRaphson
A class for finding zeros of a method, using the Newton-Raphson method

If the derivative is available, it can be provided, otherwise it works by numerically calculating the derivative.

Delegates
  DelegateDescription
Public delegateLevenbergMarquardt2DFunction
Signature of function for which zeros is to be found
Public delegateNewtonRaphsonFunction
Signature of function for which zeros is to be found
Public delegateNewtonRaphsonNewValueFilter
Signature of function that based on a new and and old value modifies the new value.

This is invoked whenever a new value is calculated, and makes it possible for the user to add some extra information to improve stability