newRPL  build 1255 released! [updated to 1299]

08092018, 07:34 PM
(This post was last modified: 08092018 07:36 PM by Claudio L..)
Post: #256




RE: newRPL  build 1089 released! [update:build 1099]
(08092018 03:57 PM)rprosperi Wrote: Claudio  Suggest you provide 2 examples, one trivial and one nontrivial, to illustrate the exact syntax of the arguments; this avoids time wasted figuring out what your explanations do/don't mean. I'm not suggesting the wording is poor, simply that for such use, interpretation can vary. For example is the list with variable names like { A B C } or {'A' 'B' 'C'}, etc. Fair enough. Here's the trivial one: get the roots of x^2=4 Code:
It will return: Code:
In this case it converged to the negative. If we want the positive there's 2 options: a) Try a different initial guess range, for example { 0 } { 1 } does the trick. b) Coerce the system with a constraint: change the list of equations to: Code: { 'X^2=4' 'X>0' } A less trivial example: To test the Beale function from here: Code:
The results are this: Code:
Code:
And now we get: Code:
And now the algorithm went the other way (towards the positive side of X), converging to the proper root. EDIT: By the way, you could also force a constraint by adding 'X>4.5' to the list of equations. 

« Next Oldest  Next Newest »

User(s) browsing this thread: 2 Guest(s)