Logo by Pauldelbrot - Contribute your own Logo!

END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

it was a great time but no longer maintainable by c.Kleinhuis contact him for any data retrieval,
thanks and see you perhaps in 10 years again

this forum will stay online for reference
News: Visit the official fractalforums.com Youtube Channel
 
*
Welcome, Guest. Please login or register. April 19, 2024, 05:39:55 AM


Login with username, password and session length


The All New FractalForums is now in Public Beta Testing! Visit FractalForums.org and check it out!


Pages: [1]   Go Down
  Print  
Share this topic on DiggShare this topic on FacebookShare this topic on GoogleShare this topic on RedditShare this topic on StumbleUponShare this topic on Twitter
Author Topic: The DAWN of Fractals  (Read 1774 times)
0 Members and 1 Guest are viewing this topic.
Charleswehner
Guest
« on: December 01, 2006, 05:26:28 PM »

We all know that the remarkable images of Fractals arise out of chaotic arithmetic. I decided however, that by hands-on research I might explore the world of less chaotic mathematics to see what might arise.

The original Julia and Mandelbrot sets arose out of Z <- Z * Z in a recursion loop. This leads to Z2, then to Z4, then to Z16, then to Z256 and onward.

I decided to explore the situation when Z <- Z * Z0, where Z0 is the starting position - after zero iterations. This gives rise to the sequence Z0 followed by Z02 followed by Z03 and Z04 and so on.

The first test program is at http://wehner.org/tools/fractals/expo/expo.asm and gives this image:


That is the typical de Moivre circle - not a Fractal image. However, the outer edges are feathered much more gently. Instead of the circle rapidly giving way to a white background, it has a soft gradation of colours around it.

The difference comes about because the Julia superset and Mandelbrot set have a function (how did I type that?) whilst this exponential function is only Zn. If a Fractal function could be built out of this, it would have large areas of soft gradation.

I then added the Mandelbrot vector. There are two ways of doing this. One way is from Z <- (Z+1) * Z0, which was my first modification to the program, at http://wehner.org/tools/fractals/expo/expoa.asm. The second - at http://wehner.org/tools/fractals/expo/expob.asm takes Z <- (Z * Z0) + Z0 . If ever a Fractal system arose out of this, one would use the latter file to replace Z0 with a fixed vector to get a Julia version.

Here is the result at http://wehner.org/tools/fractals/expo/expoab.gif :


The addition of the Mandelbrot vector (the pixel vector Zpixel is Z0) has provided a notch to the right - as in the proper Mandelbrot set. Furthermore, it does not seem to matter whether one adds or subtracts. I tried both.

Inside the notch there is colour. Enlarged 64 times, by means of http://wehner.org/tools/fractals/expo/expoc.asm gives this:


There is nothing Fractal-like there.

And when one adds TWICE Z0 by means of http://wehner.org/tools/fractals/expo/expod.asm the notch is deeper:


And when FOURFOLD Z0 is added, deeper still http://wehner.org/tools/fractals/expo/expoe.asm


And EIGHTFOLD (http://wehner.org/tools/fractals/expo/expof.asm ) gives


These are not Fractals - but one can see the dawning of the Mandelbrot shape. All we have at present is a notch.

The simplest function is a linear one. Here, for example with the identity function Y=X, there is no chaos. The next more complicated for our interests is the exponential - Z <- Z * Z0. After that come the FACTORIALS. These are of the form 1, 1*1, 1*1*2, 1*1*2*3 and so on, whereas exponentials are of the form 1, 1*2, 1*2*2, 1*2*2*2.

In factorials, the last number is rising - it is 1, 2 and 3. In the exponential it is fixed. I demonstrated a base of 2. Yes, that last number is the base.

Because the base of a factorial is always rising, the factorial will always catch up with and overtake an exponential. James Stirling and Leonhard Euler both used this fact in order to find an approximation for the factorials. At infinity, the base is rising to infinity-plus-one and infinity-plus two - so it is not rising at all. For high numbers near infinity, the factorial therefore approximates a high exponential.

However, the Julia-Mandelbrot function gives which is guaranteed ultimately to overtake the factorials. That is because it is exponential in an exponential. The best a factorial can do is to approximate an exponential.

So, although Fractals do not begin in earnest with Z <- Zn, they might begin with Z <- Z! where Z! is the (fractional) factorial of the complex duple X + iY.

Charles

 

Logged
heneganj
Guest
« Reply #1 on: December 03, 2006, 09:23:03 AM »

Charles your posts are lecture like in structure and I'm finding them fascinating!
Logged
Charleswehner
Guest
« Reply #2 on: December 04, 2006, 05:55:34 PM »

Charles your posts are lecture like in structure and I'm finding them fascinating!

Perhaps they are lecture-like because the subject is technical.

I am just reporting what I find as I feel my way back into Fractals.

There is a lot more on the way. Some will be known, but some (hopefully) will be new.

Glad you enjoy them. They are research results - not opinion.

Charles
Logged
Charleswehner
Guest
« Reply #3 on: December 05, 2006, 04:21:47 PM »

I originally described the Julia/Mandelbrot algorithm as throwing a point around in a spin drier.  We have ZZ*Z, which doubles the angle and squares the range from the origin. The de Moivre theorem deals with that. After that comes a shift along a vector (the "tumble" as in a tumble-drier) which I will tackle later.

My first test was to see what would happen if the angle simply grew by a fixed amount at each iteration. I explored that above - and there were no Fractals.

Then I questioned what might happen if the angle had the angle added to it the first time, then twice the angle the second time, then three times the angle the third time. The result would be 1 + 2 + 3 + 4 ..... n . That is SUMMA N.

For a start, I created an image with no tumble. It should be a circle, and it is. That tests the program.


There is a tinge of colour around the edges, but nothing like as much as in the circle I showed previously.

Now I add the tumble as a Mandelbrot vector. It tumbles at each iteration to an extent equal to the range of the pixel from the origin, and parallel with it. The Mandelbrot vector is, after all, the pixel vector.


There are slight tufts appearing. The Fractals are dawning. I decided to choose the tuft on the left for enlargement:


A disappointment. The pattern has a slight curve to it, but there are no exciting shapes.

The program had given one multiplication by the pixel Z, two multiplications, three multiplications and so on. This led to (n*(n+1))/2 multiplications. It is an n-squared exponentiation of Z.

That same program can easily be converted to use the previous result, instead of the pixel Z. So we get Z2 followed by two multiplications of Z2 by Z2 giving Z6, followed by three multiplications of Z6 by Z6 giving Z24, followed by four multiplications of Z24 by Z24 giving Z120.

The numbers 2, 6, 24 and 120 are factorials.


Numbers less than one shrink instantly towards the attractor at the origin. Numbers above 1 fly rapidly away. The picture is in colour, but we perceive only black-and-white because the transition from many iteration to few is so abrupt.


With the Mandelbrot tumble added, the whole set appears. But the bits of black in the air on the left suggest that the pattern is breaking up. I explored the area on the left.


The fierce arithmetic of a factorial exponentiation of Z leads to the points being flung around the complex plane and hitting the traps too soon. The fine, feathery detail has been "singed" off. Where with Julia/Mandelbrot we had "sea-horses", here we only have Ss.

This is what happens to the arithmetic.
Consider ZZ*Z+Z0. We get Z4+2Z4+Z02+Z0, and at each iteration more binomials of this kind as can be discerned from Pascal's triangle. I am interested in just the first term, the Z4.

With linear exponentiation, beginning at 4, we get:
4
8
16
32


With n-squared (specifically summa-n) exponentiation:
4
16
128
2048


With exponential exponentiation (Julia/Mandelbrot):
4
16
256
65536


With factorial exponentiation:

4
64
16777216
1.3292279 times 1036


So Fractals seem to be dawning somewhere near the n-squared region and reach their perfection, high noon, somewhere near the exponential exponentiation of Julia and Mandelbrot. By the time the exponentiation becomes factorial the chaos mathematics is too extreme, and the sun is setting on the Fractals.


It is a pity. I had hoped to have found something new and glorious. Nevertheless, there are other approaches to consider......

Until later.

Charles





Logged
rloldershaw
Navigator
*****
Posts: 63


« Reply #4 on: December 05, 2006, 05:00:04 PM »

Hi Charles,

This type of intuitive/empirical/experimental approach to understanding things is not always guaranteed to result in glorious discoveries.  But it is a lot of fun, and when glorious discoveries *are* made, it is usually the result of this approach.

I have enjoyed following your progress and experimentation.  Long live intuition!

Rob
Logged
Charleswehner
Guest
« Reply #5 on: December 06, 2006, 02:24:32 PM »

I have enjoyed following your progress and experimentation.  Long live intuition!

Rob

MISTAKES can be fun, too:


Charles
Logged
Charleswehner
Guest
« Reply #6 on: December 07, 2006, 04:05:16 PM »

Just for completeness, here are some addresses for the source-code of the above:

http://wehner.org/tools/fractals/summa/summa.asm - also summa2.asm and summa3.asm .

http://wehner.org/tools/fractals/expo/expo.asm - also expoa.asm, expob.asm expoc.asm, expod.asm, expoe.asm, expof.asm, expog.asm and expoh.asm .

http://wehner.org/tools/fractals/fact/fact.asm - also fact2.asm and fact3.asm .

Research reports must show how the results were obtained - so I have completed this section of study.

Charles
Logged
Nahee_Enterprises
World Renowned
Fractal Senior
******
Posts: 2250


use email to contact


nahee_enterprises Nahee.Enterprises NaheeEnterprise
WWW
« Reply #7 on: December 08, 2006, 06:20:33 AM »

Charles Wehner wrote:
>
>    Just for completeness, here are some addresses for the source-code of the above:
>       ............
>    Research reports must show how the results were obtained - so I have completed
>    this section of study.

Thank you for your postings of this area of study and research, and especially in supplying the source code used in these explorations.  It is always interesting to see such detailed progression.
Logged

Pages: [1]   Go Down
  Print  
 
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Exodus at Dawn Mandelbulb3D Gallery Madman 0 541 Last post December 19, 2010, 04:46:27 PM
by Madman
Temple of the Dawn 3d Art / Composition gregimages 0 928 Last post April 12, 2011, 08:36:25 AM
by gregimages
Voyage of the dawn trader Mandelbulb3D Gallery Dermis 0 657 Last post August 23, 2014, 02:38:15 PM
by Dermis
Ready at Dawn Mandelbulb3D Gallery FractalJam 0 1551 Last post March 23, 2015, 03:38:54 AM
by FractalJam
Dawn on Osiris Mandelbulb3D Gallery 1Bryan1 0 633 Last post January 14, 2016, 06:29:46 AM
by 1Bryan1

Powered by MySQL Powered by PHP Powered by SMF 1.1.21 | SMF © 2015, Simple Machines

Valid XHTML 1.0! Valid CSS! Dilber MC Theme by HarzeM
Page created in 0.202 seconds with 24 queries. (Pretty URLs adds 0.014s, 2q)