On 05/07/2015 08:46 AM, Roger Kaufman wrote:
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.
I was going to test that since I have 64-bit Java on 64-bit Linux, but it looks like it's Windows-only? Anyway, the Java source is available, now just need to add the JDK and try javac-ing to see if it works. Don't know if I need the C/ASM files, too, not a programmer. Among the "Optimizations to speed up calculations" it lists are: * "Tweaked Marian/Silver algorithm to guess areas with monotonic iteration counts" * Extensive use of SSE2/3/AVX * Multicore support (up to 32 threads) * "pixel grouping to fully saturate execution units of modern CPUs (up to 16 pixels with SSE2, up to 32 with AVX-capable CPUs)" -- David W. Jones gnome@hawaii.rr.com authenticity, honesty, community http://dancingtreefrog.com