Common-Anscestors Method

Robert P. Munafo, 1993 Dec 21.

%%%not finished yet A method of optimizing the evaluation of Julia Sets, which exploits the fact that if two points Z1 and Z2 have a common iterate

Z1n = Z2m, then all subsequent iterates of these two points will be the same:

Z1n+d = Z2n+d for all 0 <= d <= inf .

The common-anscestors method is one type of orbit-based optimization. See that heading for references to others; see also speed improvements.

It is important to note that this does not apply to Mandelbrot images, because the two points Z1 and Z2 have different parameters C1 and C2 and thus their iterates will diverge. For the Mandelbrot Set, the closest approximation to the Common-Anscestors method is the synchronous-orbit algorithm.


From the Mandelbrot Set Glossary and Encyclopedia, by Robert Munafo.     Mu-ency index

Creative Commons License This work is licensed under a Creative Commons Attribution 2.5 License .
WWW: http://www.mrob.com/
EMail: mrob at mrob com (If you aren't a spambot you can rewrite this yourself)
© 1996-2008 Robert P. Munafo.s.13