(02/26/2023, 10:02 AM)JmsNxn Wrote: Hey, Gottfried!
That's not the speed up!!!!!!!!!!!!
(...)
Say that func(z) takes 1 second to evaluate. Then to run mike3's program, we need at least 1000x1000 seconds to graph. Where my speed up is 500x500 seconds.
Think of it as a lossy compression algorithm!!!!!
Hi James -
I see;
well I had made some suggestion before, and became critical of that yesterday, noticing finally, that the speedup expected does not occur, just a much smaller effect. So my suggestions came out to have little effect only. (But *that fact* is/was noticeable I think)
Just to check/see this detail - that has been the intention of my second post.
- - - -
Of course: an interpolation-method whose reducing power goes into a quadratic formula (like yours) overpowers any optimization which has a linear reduction of time, no question.
Gottfried Helms, Kassel