Hey, everyone.
It's been pissing me off how slow Mike3's MakeGraph program runs. And I've decided to employ a speed up of this program.
Now, traditionally; Mike3's program goes pixel by pixel and assigns a colour point. I am going to add in a subroutine which splines together n by k pixels into a linear solution of the pixel values at the origin of this block. This is much more in tune with standard graphing programs. I'd just like to have these algorithms attached to pari-gp; rather than run pari in a graphing program.
I'm still beta testing this; but my idea works on paper. The general idea is we write a modified version of mike3's program. Where instead of re-evaluating the function at each pixel; we set 5 by 5 or 10 by 5 pixels are assigned this value. Which greatly speeds up convergence.
If we assume func(z) = O(h(n)); then Mike3's program runs like O(n^2h(n)). I believe I can reduce this to O(n log(n) h(n)) without sacrificing too much quality.
I'm going to publish it soon. But it is proving pretty tricky to get everything right--plus I suck with graphics. But theoretically this will diversify mike3's program greatly.
.......................
Wish me luck
It's been pissing me off how slow Mike3's MakeGraph program runs. And I've decided to employ a speed up of this program.
Now, traditionally; Mike3's program goes pixel by pixel and assigns a colour point. I am going to add in a subroutine which splines together n by k pixels into a linear solution of the pixel values at the origin of this block. This is much more in tune with standard graphing programs. I'd just like to have these algorithms attached to pari-gp; rather than run pari in a graphing program.
I'm still beta testing this; but my idea works on paper. The general idea is we write a modified version of mike3's program. Where instead of re-evaluating the function at each pixel; we set 5 by 5 or 10 by 5 pixels are assigned this value. Which greatly speeds up convergence.
If we assume func(z) = O(h(n)); then Mike3's program runs like O(n^2h(n)). I believe I can reduce this to O(n log(n) h(n)) without sacrificing too much quality.
I'm going to publish it soon. But it is proving pretty tricky to get everything right--plus I suck with graphics. But theoretically this will diversify mike3's program greatly.
.......................
Wish me luck