Hey JOT, On 5/7/2015 2:00 PM, fractint-request@mailman.xmission.com wrote:
I suspect treachery. Just think about it - the math behind each Mandelbrot pixel. And doing that with a number with hundreds or thousands of decimals. No.
There are "shortcut" methods and algorithm hacks to do it , like "interpolating" between 2 images. I am a purist - do it right or it don't count!
FractInt has some real tight "C" and "ASM" code - and it took me 3 years on several systems to get past E+100.
It is possible. Looking into his discussion area he mentions "Mandel Machine". https://www.youtube.com/channel/UCsRbcv18VcWJVtfAtbKV1Vw/discussion Mandel Machine looks like it is a high precision fractal explorer which I don't see on Paul Lee's list. Looking at the history they mention using 80 bit precision. I have tried running it but it uses 64 bit Java and I have 32 bit. I am debating installing 64 bit as the claim they can co-exist but I want to do more research on that. http://web.t-online.hu/kbotond/mandelmachine/ There are ways to get much higher, even open ended precision. The GMP library can do this and I am sure while they have made it efficient, there has to be payback to performance. https://gmplib.org/ While I have the utmost respect for Fractint, it as a legacy system. For any fractal program writers out there, this question. Can your program exceed the efficiency of Fractint, i.e. draw a fractal faster at the same resolution? If so, what resources did you use to do it?