How to Find An Optimal Number of Maximum Iterations

  • 3 Replies
  • 406 Views

0 Members and 1 Guest are viewing this topic.

Offline Byte11

  • *
  • Fractal Fanatic
  • ***
  • Posts: 39
    • Fractal To Desktop
« on: December 22, 2017, 12:13:52 AM »
I'm looking to find the optimal number of maximum iterations in the most computationally cheap way. I had a method where I would take a point (usually the center) and store it in full precision. Then I would limit the precision of the reference calculation to \( precision = frame + 15 \) with precision in bits (this is assuming magnification is given by 2^frame). Then I'd calculate the reference until the point tended towards 0 or infinity. The number of iterations that took would be the optimal number of iterations. However, this only worked given two things: 1. The point being calculated was relatively complex compared to the rest of the pixels 2. I had more bits of precision in my reference than I was using for my zooming.

This worked well if you take a point from a previous zoom and plug that into the formula. However, if the user is clicking on pixels and I convert those pixels to a new center point to use as a reference for this algorithm, the point is almost always unsuitable.

So I either need a way of finding points that fit the above criteria or another algorithm for finding an optimal number of iterations. For finding a suitable point, I was thinking to either use Misiurewicz points or Newton-Raphsoon zooming, but those are computationally expensive. Does anyone else have a better idea?

Linkback: https://fractalforums.org/fractal-mathematics-and-new-theories/28/how-to-find-an-optimal-number-of-maximum-iterations/621/
Fractal To Desktop - Live Render Fractals To Your Desktop!
http://fractaltodesktop.com/

Offline claude

  • *
  • 3f
  • ******
  • Posts: 1260
    • mathr.co.uk
« Reply #1 on: December 22, 2017, 01:25:13 AM »
in my mandelbrot-perturbator I do iterations in chunks: say 1000 reference iterations, then 1000 pixel iterations, repeat.  That way I mostly don't need to know the ideal maximum iteration count before starting, and can set it ludicrously high as it will stop when all pixels have escaped (the exception is when minibrots are visible, in which case some pixels would never escape - I will eventually extend mandelbrot-perturbator either to do interior checking or to keep doubling the iteration count until the rate of pixels escaping is low, a strategy I learned from Robert Munafo).

Offline Adam Majewski

  • *
  • Fractal Feline
  • **
  • Posts: 191

Offline Byte11

  • *
  • Fractal Fanatic
  • ***
  • Posts: 39
    • Fractal To Desktop
« Reply #3 on: December 24, 2017, 01:26:47 AM »
The algorithm that I described above works well if the selected point is significantly deeper than the points in the viewing area but is still within the bounds of the viewing area. Is there a way to find points within the viewing area that are fairly deep that could be used for this algorithm?


xx
Exploring The Number 3

Started by Tas_mania on Fractal Image Gallery

0 Replies
274 Views
Last post November 29, 2017, 10:40:39 PM
by Tas_mania
xx
algebraic number theory and the Mandelbrot set

Started by claude on Fractal Mathematics And New Theories

0 Replies
156 Views
Last post August 05, 2018, 06:32:41 PM
by claude
xx
Jean-Francois Colonna - Number Theory

Started by Alef on Share a fractal

1 Replies
249 Views
Last post September 21, 2018, 08:34:27 PM
by gerrit
clip
Experiment - Using A Random Number Generator To Choose Fractals

Started by Tas_mania on Mandelbulber

1 Replies
256 Views
Last post January 05, 2019, 07:44:02 AM
by Tas_mania
xx
Lowest / optimal bailout values for the Mandelbrot sets

Started by Dinkydau on Fractal Mathematics And New Theories

10 Replies
636 Views
Last post March 20, 2019, 01:18:50 PM
by Dinkydau