Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Computing Julia set of exp(z) to really high resolution

0 views
Skip to first unread message

mike3

unread,
Jan 4, 2010, 11:31:37 PM1/4/10
to
Hi.

I was wondering: Is there any way at all to draw the Julia set for the
complex exponential exp(z) to high resolution? Note that if one
affixes a small finite "bailout", the resulting plot is very "bubby",
and doesn't show much structure. The actual Julia set is a collection
of infinitely thin hairs or something, I think. Of course one can't
draw all that on a computer due to the monitor's resolution, but is
there some method to get up to that limit at least? The trouble seems
to be that direct iteration leads to very fast growth. Very fast
growth = overflow. One idea I thought of was using a "power tower" to
represent humongous numbers, but how the heck would you find sin
(2^2^2^2^2^2) or something?! So that doesn't seem to be useful.

Philippe 92

unread,
Jan 5, 2010, 7:51:53 AM1/5/10
to
mike3 a ᅵcrit :

> Hi.
>
> I was wondering: Is there any way at all to draw the Julia set for the
> complex exponential exp(z) to high resolution?

Hi,

May be the "Fractint" program gives you hints about how to do ?
<http://www.fractint.org/>

It allows for tremendous zooming in ...
(and has built in Julia sets BTW)

Regards.

--
Philippe C., mail : chephip, with domain free.fr
site : http://mathafou.free.fr/ (mathematical recreations)


I.N. Galidakis

unread,
Jan 5, 2010, 3:50:55 PM1/5/10
to
mike3 wrote:

Didn't we have this discussion before? Do you remember what I told you?

The "hairs" are a computer artifact of all "Cantor Bouquet" type fractals. They
are infinitely thin, so they accumulate at certain points of the fractal and
form "bubbles" or "fingers". You can only "resolve" them further by increasing
the bailout value.

Increasing the bailout value doesn't solve the resolution problem completely,
however. The hairs will accumulate somewhere else, lower on the fractal, because
in certain areas they are infinitely close to each other and eventually this
will beat your resolution.

Apropos of all the above, you really don't need very high bailout or iteration
values to see the exp fractal. Here are some results with Maple for the
following code:

> EF:=proc(x,y)
> local m,z;
> z:=evalf(x+y*I);
> m:=0;
> to 100 while abs(z)<1e10 do #100 is the iterations, 1e10 is the bailout
> z:=exp(z);
> m:=m+1;
> od;
> m;
> end:

> plot3d(EF, -4..4, -4..4, grid=[300,300], shading=ZHUE,scaling=CONSTRAINED,
style=PATCHNOGRID, orientation=[0,0], axes=BOX);

Maple V rel 4:

(iterations=100, bailout=1e10)
http://misc.virtualcomposer2000.com/expMand100.gif

(iterations=500, bailout=1e10)
http://misc.virtualcomposer2000.com/expMand500.gif

and the same code on Maple 9 with the largest bailout for conventional
arithmetic:

(iterations=100, bailout=1e18)
http://misc.virtualcomposer2000.com/expMandLargeBail.gif

Note how the hairs have receded somewhat more on the last fractal. That's about
the best that can be done using 18 digits of precision. If your program allows
for a larger number of digits, then the hairs will split/recede even further,
but at some point they will still form unresolvable "fingers".
--
Ioannis

Danny73

unread,
Jan 5, 2010, 5:20:37 PM1/5/10
to
> (iterations=500, bailout=1e10)http://misc.virtualcomposer2000.com/expMand500.gif

>
> and the same code on Maple 9 with the largest bailout for conventional
> arithmetic:
>
> (iterations=100, bailout=1e18)http://misc.virtualcomposer2000.com/expMandLargeBail.gif

>
> Note how the hairs have receded somewhat more on the last fractal. That's about
> the best that can be done using 18 digits of precision. If your program allows
> for a larger number of digits, then the hairs will split/recede even further,
> but at some point they will still form unresolvable "fingers".
> --
> Ioannis

Great graphics Ioannis.

What is the final resolution for each side of the 8 length square
of your last graphic?
Is the unresolvable "fingers" because of pixel resolution or
because of digit precision problems of both?

Dan

bvcv...@yahoo.com

unread,
Jan 5, 2010, 5:39:10 PM1/5/10
to
unfortunatley,
due to the wide range of implimentations
of the floatingpointware specification (IEEE-754/-854;
the first is an article in an IEEE magazine),
there is really no such thing as a canonical M-set,
or Julia set; can you say, Psychedelic "Magnification?"

thus:
the usual mathematical term is Universe;
contrary to teh extreme exegesis of the Copenhagenskool,
there is only one (the rest is Solopsism,
per David Deutsch's say-not .-)

> I appreciate your help in this matter.

thus:
strictly untrue; Kepler et al were using the program
of [Cardinal] Nicholas of Cusa; of course, since
you are apparently British, you've probably been indoctrinated
with the secular church of Newton, and/or the Harry Potter PS
curriculum
of the "Venetian Party" of England.

also, I keep on referring to the 2.5-page article
in *Math.Mag.* (MAA.org), that proves of the isometry
of inductive & deductive proofs,
also giving a formula to convert from one to the other.

the Royal Society attack on Leibniz was political;
he was actively being considered to be the PM,
by Queen Anne. (deny that, if you care to .-)

> With Gawd getting in the way it's small wonder the Xtian Romans
> produced no mathematicians of the earlier Greek calibre. :-)- Hide quoted text -

thus:
doctor Einstein's essay seems quite confuzed
about the electromegnetic properties of matter, but
that was a while before our standard textbookoid concepts
were put out from the Texas Schoolbook Suppository.

thus:
he is giving a lot of credit to Lorentz, who may
be more responsible, after all, for the time-space crack-up
than doctor Minkowski; can you say,
Most useless formalism of Century 20.1?
however, the real problem is your persistent use
-- with whomever else from the past & future --
of the the concept of vacuum, as Pascal first thought of it,
which is really, strictly relative or active (as in,
That giant sucking sound, you hear, when you're trying
to read this ****).
> http://www-groups.dcs.st-and.ac.uk/~history/Extras/Einstein_ether.html

--Brit's hate Shakespeare, Why?
http://wlym.com/campaigner/8011.pdf
--Madame Rice is a Riceist, How?
http://larouchepub.com/other/2009/3650rice_racist.html
--The Riemannian Space of the Nucleus, What?
http://www.21stcenturysciencetech.com/Articles_2009/Relativistic_Moon...
--In perpetuity clause in healthcare bill, Where?

I.N. Galidakis

unread,
Jan 5, 2010, 5:57:26 PM1/5/10
to

Thanks :-)

> What is the final resolution for each side of the 8 length square
> of your last graphic?

Theoretically, it should be Length/GridSize = 8/300, as per the Maple command
"plot3d".

> Is the unresolvable "fingers" because of pixel resolution or
> because of digit precision problems of both?

The pixel resolution is fine and is as above (8/300). The "fingers" are because
of digit limitations. The size of the fingers on the last fractal is dependent
on the bailout value of 1e18. If this is set higher, the "fingers" will get
thinner as more points escape, but they will never become infinitely thin.

Think of it as follows: You get a bunch of very thin hairs flowing in the wind.
If you tie them with a knot as with regular hair, eventually you will get a
dense "pony-tail". Those fingers are actually "pony-tails", which at some point
"separate" into their actual components, which in turn separate more, etc.,
depending on the local resolution.

Had the bailout been set to a very large value, one'd see essentially no hairs
at all, as the hairs would become thinner than computer pixels.

> Dan
--
Ioannis

mike3

unread,
Jan 5, 2010, 6:52:21 PM1/5/10
to
On Jan 5, 1:50 pm, "I.N. Galidakis" <morph...@olympus.mons> wrote:
> mike3 wrote:
> > Hi.
>
> > I was wondering: Is there any way at all to draw the Julia set for the
> > complex exponential exp(z) to high resolution? Note that if one
> > affixes a small finite "bailout", the resulting plot is very "bubby",
> > and doesn't show much structure. The actual Julia set is a collection
> > of infinitely thin hairs or something, I think. Of course one can't
> > draw all that on a computer due to the monitor's resolution, but is
> > there some method to get up to that limit at least? The trouble seems
> > to be that direct iteration leads to very fast growth. Very fast
> > growth = overflow. One idea I thought of was using a "power tower" to
> > represent humongous numbers, but how the heck would you find sin
> > (2^2^2^2^2^2) or something?! So that doesn't seem to be useful.
>
> Didn't we have this discussion before? Do you remember what I told you?
>

Uh, I don't really remember, I think there may have something but it
was a long
time ago so I'm not sure.

> The "hairs" are a computer artifact of all "Cantor Bouquet" type fractals. They
> are infinitely thin, so they accumulate at certain points of the fractal and
> form "bubbles" or "fingers". You can only "resolve" them further by increasing
> the bailout value.
>

Isn't that a little backwards? The "hairs" are the true structure, the
"fingers"
are the artifact of the approximation.

> Increasing the bailout value doesn't solve the resolution problem completely,
> however. The hairs will accumulate somewhere else, lower on the fractal, because
> in certain areas they are infinitely close to each other and eventually this
> will beat your resolution.
>

I suppose, however one often is not interested in the far right side
of the
fractal, but the "busy" bit. If the size of the fingers visible there
can be
reduced to 1 pixel, then the graph should be sufficiently "accurate".
Though
I suppose there'd be a whole lot of aliasing going on, but it's an
interesting
experiment.

> Apropos of all the above, you really don't need very high bailout or iteration
> values to see the exp fractal. Here are some results with Maple for the
> following code:
>
> > EF:=proc(x,y)
> > local m,z;
> > z:=evalf(x+y*I);
> > m:=0;
> > to 100 while abs(z)<1e10 do #100 is the iterations, 1e10 is the bailout
> >  z:=exp(z);
> >  m:=m+1;
> > od;
> > m;
> > end:
> > plot3d(EF, -4..4, -4..4, grid=[300,300], shading=ZHUE,scaling=CONSTRAINED,
>
> style=PATCHNOGRID, orientation=[0,0], axes=BOX);
>
> Maple V rel 4:
>
> (iterations=100, bailout=1e10)http://misc.virtualcomposer2000.com/expMand100.gif
>

> (iterations=500, bailout=1e10)http://misc.virtualcomposer2000.com/expMand500.gif


>
> and the same code on Maple 9 with the largest bailout for conventional
> arithmetic:
>

> (iterations=100, bailout=1e18)http://misc.virtualcomposer2000.com/expMandLargeBail.gif


>
> Note how the hairs have receded somewhat more on the last fractal. That's about
> the best that can be done using 18 digits of precision. If your program allows
> for a larger number of digits, then the hairs will split/recede even further,
> but at some point they will still form unresolvable "fingers".

But I thought floating point has a higher dynamic range. I tried this
once using
the computer's in-built double precision math, interpreting overflow
("nan", etc.)
magnitude as bailout, and also magnitude greater than 1e+100, and I
got a plot that
seemed to make sense (it didn't have any weird discontinuities or
anything). So
it seems one can get more detail without needing more precision, just
more dynamic
range.

mike3

unread,
Jan 5, 2010, 7:27:53 PM1/5/10
to
On Jan 5, 4:52 pm, mike3 <mike4...@yahoo.com> wrote:
<snip>

I played around with this some more, and it would seem that such
a thing would likely just look like fuzz ("static") due to all the
aliasing. If, however, it could be shaded in some way as to make
everything look smooth, so the fingers appear to blend together
instead of having sharp boundaries, I guess that would create a
more sensible view.

0 new messages