Hello guys,

I want to create a while loop which compare two Results and if the difference is too high(more than 0,1), the second result should turn into the first and the second should be calculated again.

But I just create an endless loop or a loop which is calculated just one time. Can someone give me some recommendation?

Thanks a lot.

twaddex


iteration.sm (29 KiB) downloaded 51 time(s).

Get inspired from these three "While/Iterate".
Cheers ... Jean

Solve [Dichotomy_Newton_Secant].sm (35 KiB) downloaded 60 time(s).

ϑ'o(ϑGS)=f(x)
Given f(x) some value, you can solve for (x).
Before solving => always plot.
do=0.4591 is way below the flat region.

iteration.sm (31 KiB) downloaded 51 time(s).

... suite,
The doctored solved from before can be viewed globally
via inversing. Your function is too complicated, it will have no inverse.
It can be inversed recursively and plotted data points or spline smooth.
Such a monster big function w/o abstract ... what do you think ?

... recursive inverser of difficult function. Any help ?

Solve Inverse [Seeded Scanner MODEL].sm (9 KiB) downloaded 54 time(s).