Hi.

I thought of a novel approach to aid in the "divination" of what the tetration function for real heights is: the self-tetraroot function. This function is defined so that . It is analogous to the self-root function , only with tetration instead of exponentiation. It gives the base of the tetrational with a given fixed point.

It can be evaluated at the integers using numerical root-finding methods, and when the points are plotted, it reveals a scatter that slowly, but regularly (i.e. no noticeable "bumpiness") decays to a fixed value about 1.444782 as .

This slow regular decay made me wonder if it would be a good candidate for interpolation via the Newton series. Newton series, when applied to tetrationals with bases in , yields the regular iteration.

The Newton series for a function at a point is

where is the falling factorial and is the unit forward difference operator.

Doing this for gives the following graph. Convergence is dog slow -- I needed 300 or so terms and over 100 decimals of accuracy just to get error that I'm confident is less than . This is very bad. Is there some way to accelerate the convergence of Newton series?

As you can see, it sort of looks like the graph of the self-root. I superimposed both graphs:

The maximum is at about or so (maybe if you want to push it as this approximation may be good to 5 places -- may -- it's so dog-slow, where it reaches a value of (maybe ). I presume this is the base where "pentation" goes from convergent to explosive growth, and so is to pentation what is to tetration. Flipping the self-tetroot along and taking the lower branch would then yield a graph of .

For , I get a tetra-self-root of ( rounded from whose last digit may be right or near). Plugging this into the regular iteration to try and compute suggests whatever "fractional iteration" this is creating may agree with it, but this is a dodgy bet with just 4 decimals. Yet if it does agree, then perhaps, since this function shows no "bumps" when the base crosses , maybe the regular iteration really doesn't have a natural boundary after all. But again, 4 decimals, 5 at best, geez... far too little to even bet seriously... If we could compute more, we might be able to get a better idea if it agrees with regular, and if it also agrees with the Cauchy integral (for the bases from to 1.635...), hence helping to "divine" if these are really "good" methods to use and if they are actually analytic continuations of each other (meaning that the STB is not a natural boundary of the regular iteration.).

What do you think of this function? Especially the similarity between the shape of its graph and that of the selfroot. One could almost imagine a continuous spectrum of similar functions in between them -- "fractional-rank hyperoperations", anyone?

I thought of a novel approach to aid in the "divination" of what the tetration function for real heights is: the self-tetraroot function. This function is defined so that . It is analogous to the self-root function , only with tetration instead of exponentiation. It gives the base of the tetrational with a given fixed point.

It can be evaluated at the integers using numerical root-finding methods, and when the points are plotted, it reveals a scatter that slowly, but regularly (i.e. no noticeable "bumpiness") decays to a fixed value about 1.444782 as .

This slow regular decay made me wonder if it would be a good candidate for interpolation via the Newton series. Newton series, when applied to tetrationals with bases in , yields the regular iteration.

The Newton series for a function at a point is

where is the falling factorial and is the unit forward difference operator.

Doing this for gives the following graph. Convergence is dog slow -- I needed 300 or so terms and over 100 decimals of accuracy just to get error that I'm confident is less than . This is very bad. Is there some way to accelerate the convergence of Newton series?

As you can see, it sort of looks like the graph of the self-root. I superimposed both graphs:

The maximum is at about or so (maybe if you want to push it as this approximation may be good to 5 places -- may -- it's so dog-slow, where it reaches a value of (maybe ). I presume this is the base where "pentation" goes from convergent to explosive growth, and so is to pentation what is to tetration. Flipping the self-tetroot along and taking the lower branch would then yield a graph of .

For , I get a tetra-self-root of ( rounded from whose last digit may be right or near). Plugging this into the regular iteration to try and compute suggests whatever "fractional iteration" this is creating may agree with it, but this is a dodgy bet with just 4 decimals. Yet if it does agree, then perhaps, since this function shows no "bumps" when the base crosses , maybe the regular iteration really doesn't have a natural boundary after all. But again, 4 decimals, 5 at best, geez... far too little to even bet seriously... If we could compute more, we might be able to get a better idea if it agrees with regular, and if it also agrees with the Cauchy integral (for the bases from to 1.635...), hence helping to "divine" if these are really "good" methods to use and if they are actually analytic continuations of each other (meaning that the STB is not a natural boundary of the regular iteration.).

What do you think of this function? Especially the similarity between the shape of its graph and that of the selfroot. One could almost imagine a continuous spectrum of similar functions in between them -- "fractional-rank hyperoperations", anyone?