Using n (number of iterations) as a variable

[TheRedshiftRider]

A few weeks ago I read the topic about iterating the mandelbrot with random powers, I liked the idea but I thought it was a little too random so I was thinking about a formula with increasing powers using the variable n.

N starts with 1 and adds one when an iteration is calculated.




I tried ot with the mandelbrot formula:



z^n+c


After that I tried some other formulas related to this one and I found some other patterns:




z^n/10+c




z^n/-1+c




z^sqrt(n)+c




z^sqrt(n+10)+c




z^n+c+c




z^n/z+c




z^2+0.1*n + c




(z^10*n+c)/(z^n+c)




(z^100*n+c)/(z^n+c)




Some of them dont really look interesting or complex.
Can the variable n be used to create nice patterns? Are there any other nice fractals that can be created with this variable?

[David Makin]

See Ultra Fractal mmf.ufm:Transformation (Mandelbrot or Julia) this has a choice of base formulas including z^iter+c

Also see mmf.ufm:Transpoly - this is a more sophisticated formula allowing a greater choice of base formulas which are all produced from generative recursion that give a rising degree - implemented as either use as a fixed degree i.e. Iterate Poly of degree n + c or as Poly of degree iter + c i.e. such that the power rises with iteration.

To get smooth iteration colouring on the ones with rising degree per iteration will probably require bailout-time estimation of the degree of divergence (at least if using the standard Vepstas smooth iteration colouring method).

The formulas can be found in the ultrafractal formula database under my name (David Makin) here:

http;//formulas.uitrafractal.com/

And all those in mmf.ufm will obviously work in UF but also should convert perfectly for use in ChaosPro with the UF formula import facility.

[David Makin]

You can also use:

start:
z = pixel

loop:
z=z^pixel +pixel

(for instance)

[kram1032]

If you keep increasing n with the iteration count, I'd think that the final appearance critically depends on which iteration you end on. I might be wrong though. Could you try varying the iteration count by +/-1?

[TheRedshiftRider]

See Ultra Fractal mmf.ufm:Transformation (Mandelbrot or Julia) this has a choice of base formulas including z^iter+c

Also see mmf.ufm:Transpoly - this is a more sophisticated formula allowing a greater choice of base formulas which are all produced from generative recursion that give a rising degree - implemented as either use as a fixed degree i.e. Iterate Poly of degree n + c or as Poly of degree iter + c i.e. such that the power rises with iteration.

To get smooth iteration colouring on the ones with rising degree per iteration will probably require bailout-time estimation of the degree of divergence (at least if using the standard Vepstas smooth iteration colouring method).

The formulas can be found in the ultrafractal formula database under my name (David Makin) here:

http;//formulas.uitrafractal.com/

And all those in mmf.ufm will obviously work in UF but also should convert perfectly for use in ChaosPro with the UF formula import facility.

Thanks, I will have a look at those. I dont use ultra fractal but I do use chaospro so I'll try to import those formulas.

Btw, I didnt use chaospro to make those images, I used a program made by a shy member of fractalforums.

[TheRedshiftRider]

If you keep increasing n with the iteration count, I'd think that the final appearance critically depends on which iteration you end on. I might be wrong though. Could you try varying the iteration count by +/-1?

Its actually the opposite, I tried some things and It actually depends on the number you start with:

If you use the formula 2^n+c and start with 1 and add one every time, the series of formulas that is calculated will be:

z^1+c, z^2+c, z^3+c, z^4+c, z^5+c...

If you start with 2 it will be:

z^2+c, z^3+c, z^4+c, z^5+c, z^6+c...

This will make that they are both much different.


Here are some other examples:




z^(n+10) + c





z^(n-10) + c





z^(n-50) + c






It is also important to change how the variable has impact on the shape, you can make it increase/decrease slower or faster:





z^(10+n*0.01) + c





z^(2+n*0.01) + c





z^(2+n*0.001) + c





z^(2-n*0.014) + c

[youhn]

This follows what seems to be a rule (or even The Definition?) of all chaos theory. Seemingly small choices or moves at the start, dictate the end result much more than what happens next. Holds also for deep zooms in the Mandelbrot set of Burning Ship fractal.

I really like the image at (z^100*n+c)/(z^n+c). 

[TheRedshiftRider]

This follows what seems to be a rule (or even The Definition?) of all chaos theory. Seemingly small choices or moves at the start, dictate the end result much more than what happens next. Holds also for deep zooms in the Mandelbrot set of Burning Ship fractal.

I really like the image at (z^100*n+c)/(z^n+c). 

I just tried some things. But you're right about that.

[kram1032]

Here'd be one which always is quadratic in behavior.



or, as expressed in real/imaginary form:



more generally,

would be

[lkmitch]

z^(2+tanh(iter/100))+c.  The tanh() function is < 1 (for real inputs), so the power starts at 2 and never goes beyond 3.

[TheRedshiftRider]

I also tried it with the burning ship:

[TheRedshiftRider]

I found another one that looks very interesting:




(z*(z^(1+n))-z)*c


The julia-sets of this one look very nice.