Differences

This shows you the differences between two versions of the page.

--- manual:chapter3:solver [2021/09/24 09:36]
claudio created
+++ manual:chapter3:solver [2021/09/24 09:56] (current)
claudio
@@ Line 1: / Line 1: @@
 ===== Multiple Equation Solver =====
-====== Introduction ======
+==== Introduction ====
 newRPL includes an implementation of the [[https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method|Nelder-Mead Simplex Algorithm]], which is a generic search algorithm for multiple variables.
 The implementation provides a very flexible framework for the user to experiment with root searching for anything from a single linear equation to a system of multiple non-linear equations.
-In order to find a root to multiple equations with multiple variables, newRPL implementation creates a surface with the sum of the squares of the residuals of all the equations provided by the user and tries to find a minimum. Ideally, the minimum will have zero residual for all variables and will therefore be a valid solution. In some cases the algorithm will converge to minimums where some equations might be satisfied and others don't, or they may all have a residual. The residuals are provided as part of the result of the algorithm and the user should **ALWAYS** look at the residuals to see if a true solution was found. It may happen sometimes that the algorithm converges to a local minimum and a better solution exists. This all depends on the initial guess provided by the user.
+In order to find a root to multiple equations with multiple variables, newRPL implementation creates a surface with the sum of the squares of the residuals of all the equations provided by the user, and tries to find a minimum of that function. Ideally, the minimum will have zero residual for all variables and will therefore be a valid solution. In some cases the algorithm will converge to minimums where some equations might be satisfied and others don't, or they may all have a residual. The residuals are provided as part of the result of the algorithm and the user should **ALWAYS** look at the residuals to see if a true solution was found. It may happen sometimes that the algorithm converges to a local minimum and a better solution exists. This all depends on the initial guess provided by the user.
 The Simplex method uses a "simplex" which is a shape defined by a series of "points" to investigate. It can be thought of as a drop of liquid that falls over the surface of the function being investigated. This simplex will change shape and slowly "roll down" towards points of minimal residual differences (hence this is an optimization/minimization algorithm rather than a root seeking algorithm). When the drop reaches a minimum point, the algorithm will provide with the values for all variables and the residual values of each equation.
@@ Line 22: / Line 22: @@
 This command requires all its input arguments as lists, even if there's a single item, except the tolerance which is a real number.
+==== Example: Solving a single equation ====
+Let's assume the user needs to find a root of ''%%'2*X+4=8'%%''. The first step is to provide the list of equations, in this case just one: ''{ '2*X+4=8' }''. Then we need to provide a list of the variables to solve for, in this case only one ''{ 'X' }''. Now it's time to decide where the algorithm will begin exploring. Let's say our guess is that the root is between 0 and 10. First, we need to provide a list of the lower bounds for all variables, in this case it's just one ''{ 0 }'', and then a list of the upper bounds ''{ 10 }''. Finally, we need to provide a tolerance. Let's say 4 decimal figures are good, so we'll use ''1E-4''.
+We are now ready to run the ''MSOLVE'' command. The stack looks now like this:
+<code>
+:                { '2*X+4=8' }
+:                      { 'X' }
+:                        { 0 }
+:                       { 10 }
+:                         1E-4
+……………………………………………………………………………………
+MSOLVE
+</code>
+Which will produce:
+<code>
+:           { 1.999969482422 }
+:          { -0.000061035156 }
+</code>
+The first list returned in level 2 contains the value found for all variables, in this case ''X=2'' was the exact solution. The list in level 1 has the residuals of all equations. The residual is defined as the difference between the left and right sides of the equation. Notice that the residual is within the requested tolerance. Requesting a tighter tolerance would produce a result for ''X'' closer to ''2'' but at the expense of longer running time to find the solution.