home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!cs.uoregon.edu!news.uoregon.edu!nntp.uoregon.edu!cie.uoregon.edu!scavo
- From: scavo@cie.uoregon.edu (Tom Scavo)
- Newsgroups: sci.fractals
- Subject: Re: julia sets of c*e^z
- Message-ID: <1992Nov13.044211.8466@nntp.uoregon.edu>
- Date: 13 Nov 92 04:42:11 GMT
- Article-I.D.: nntp.1992Nov13.044211.8466
- References: <1992Nov11.182309.8811@mnemosyne.cs.du.edu> <1dro9cINN8rb@agate.berkeley.edu>
- Sender: news@nntp.uoregon.edu
- Organization: University of Oregon Campus Information Exchange
- Lines: 26
-
- In article <1dro9cINN8rb@agate.berkeley.edu> shirriff@sprite.berkeley.edu (Ken Shirriff) writes:
- >In article <1992Nov11.182309.8811@mnemosyne.cs.du.edu> mccasal@nyx.cs.du.edu (Massimo Casal) writes:
- >>when must i stop the iteration when i calculate the julia set of c*e^z?
- >>when the real part is > value?or when the modulus is >value?
- >
- >The stopping limit for c*e^z is problematic, since an extremely large value
- >of z can get mapped back to something small. The second problem is that
- >your floating point can overflow very quickly. The usual stopping point is
- >real part > large value (note: not abs(real part)), since this implies the next
- >iteration will be extremely large. The disadvantage is that you will stop
- >for some large values where you shouldn't. The visual appearance is that
- >the many thin petals will suddenly clump together into one thick petal, when
- >they should remain as thin petals.
-
- But apparently there is justification for this algorithm. See
-
- Marilyn B. Durkin. The accuracy of computer algorithms in
- dynamical systems. _International J. of Bifurcation and Chaos_
- 1(3), 1991.
-
- for details. Or you might want to contact Lynne directly at
- lynne@math.bu.edu.
-
- --
- Tom Scavo
- scavo@cie.uoregon.edu
-