Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Fractals from calculations of 2^I, 2^(2^I), 2^(2^(2^I).. a^(a^(...a^I)
Ivars Wrote:while I try to understand increasing height series...

I think, that is not too difficult. Just take a base, where the trajectory converges (for instance b=sqrt(2)) and alternate sum the points of the trajectory. (In pari/gp there is the sumalt()-function).
The problem is then only, if b>e^(1/e). Then the trajectory begins to strongly diverge - but for a certain range of b you may still be able to apply one common summation-method, for instance the Shanks-method.

But while even this method allows bases a little bit greater, the diagonalization method seems to be able to sum that to arbitrary bases...

Best is, you try with convergent example - just add the points of your trajectory in the list-matrix with alternating signs (even Cesaro-sum should be sufficient for this)
Quote:I was similarly(?) to You wandering that perhaps we need infinite product power series to evaluate tetration ( because of its speed)?

Yes, sometimes I was speculating about this. But I doubt it is of any use... Infinite product-series can be evaluated by the additive series of their logarithms. In the context of tetration this means, if we get an improvement at all (by this reformulation) then it is only occuring for height 1. For greater heights we are still lost. So everytime this idea pops up in my head, I just dismiss it...

Gottfried Helms, Kassel

Messages In This Thread
RE: Fractals from calculations of 2^I, 2^(2^I), 2^(2^(2^I).. a^(a^(...a^I) - by Gottfried - 05/26/2008, 09:01 AM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Different Style of Tetration Fractals stephrenny 5 5,125 12/21/2017, 07:49 AM
Last Post: Gottfried
  Tetrate fractals 73939 0 2,944 07/02/2010, 03:18 PM
Last Post: 73939
  Continuous iteration of fractals Daniel 0 2,877 08/30/2007, 09:55 PM
Last Post: Daniel

Users browsing this thread: 1 Guest(s)