FindRoot Iterative Solver

FindRoot Iterative Solver - FindRoot Iterative Solver - Messages

#1 Posted: 2/13/2019 10:49:44 PM
Jean Giraud

Jean Giraud

983 likes in 6866 posts.

Group: User

The Smath native FindRoot does not re-seed itself, thus does not re-seeds
within a classical forloop. However, it can be called algo style from external
command line ... more: it will solve auto-range on the length of the
input vectors 'xx, yy'
sol(j,xx,yy) ... int his case solving for 'xx, yy' of length 'j'.
As you open this document, the system is in its very initial state.
1. calculate
2. plug back in the initial vector ... calculate
3. keep going until both sanity vectors reach 0.000000000000
4. No more bananas for the monkey FindRoot
The convergence [number of iterations] can't be predicted as it depends
upon the FindRoot robustness wrt the equalities system.

This type of external looping was designed for a Mathcad 11 application
Same but different is solve(,,,) applied to Pipe Data Smath.
different because in this case solve(,,,,) can be declared
above use ... declared as wild algo. FindRoot does not support decalation.

I may not have completely cracked, but it works.
Enjoy, comments welcomed.

Jean

Project Solve Flashing Copy.sm (203 KiB) downloaded 91 time(s).
1 users liked this post
Radovan Omorjan 2/14/2019 3:45:00 AM
#2 Posted: 2/14/2019 10:19:32 AM
Jean Giraud

Jean Giraud

983 likes in 6866 posts.

Group: User

... refreshed/cleaned for publishing.
The very last collapsed is stuff that does not work SS 61779.
Given for those SS compatible.
Like explained before: plug the [xo, yo] initials in the running [xx, yy]
In 8 manual cyclic iterations, FindRoot has finished if you want so.
If you just want 3 or 4 decimals iterate less.
That solver may be included in a while loop, not well inspired !

Project Solve Flashing Copy.sm (213 KiB) downloaded 88 time(s).
  • New Posts New Posts
  • No New Posts No New Posts