Determines the solutions of nonlinear systems of equations in n dimensions beginning with a starting point in n dimensions. You must manually select the polymorphic instance to use.


icon

Let F be the n dimension function and let X be a given point in n dimensions.

Furthermore, let

f = 0.5F²

The algorithm is looking for such a vector P that

F(X + dP) ≤ F(X)

for all 0 ≤ d ≤ 1.

In a second step, an appropriate value, d*, is calculated, so that

F(X + d*P)

is considerably smaller than F(X). This process is repeated until F(X) ≈ 0 is reached. What follows is an approximation for F(X) = 0.