What really would interest me is a numerical comparison (graphing) of your solution, of Daniel's solution (development at the fixed point of

for

) and of

Jay's solution (but perhaps it nees still some explanation).

But at least for the first two we have all numerical methods at hand.

It simply needs a volunteer (and in the moment my time becomes rare.) ...

If by my solution you mean

through parabolic iteration of

and by Daniel's you mean

through hyperbolic iteration of

, then yes, I'd be happy to provide some high-quality graphics and numerical tables. I still need to re-read Jay's solution, since it seems dependent on the super-logarithmic constant which I don't understand yet. Also you brought up an interesting point that may prevent comparison of all methods, since some methods work over non-overlapping intervals.

Tetration can be divided into several intervals in terms of what values of

x in

are valid for that definition: the parabolic point

, the hyperbolic interval

, and I suppose would you could call the elliptic? interval

, which is what my definition of the super-logarithm is valid for. These are all closely tied to the interval of convergence of the infinite hyper-power

which was found almost 230 years ago.

My how time has passed...

Andrew Robbins

I've gotten SAGE working and I'm currently writing a tetration package for an arbitrary base greater than eta (though it's most stable for bases in a smaller range, probably b<20 or so, depending on precision). I'm using Andrew's SAGE code above to generate the FMA or whatever you would call it, but the rest of the code is based on my cheta function and change of base formula.

I'm about halfway done.

andydude Wrote:If by my solution you mean through parabolic iteration of

No, I meant the piecewise infinite differentiable definition of slog.

Isnt it defined for arbirtrary bases? (I think you wrote for base greater 1.)

So if you have the slog you have also the "sexp".

And I would compare this with what comes out from Daniel's solution for the hyperbolic case (there is then no problem with the convergence radius of the series).

Quote:and by Daniel's you mean through hyperbolic iteration of

Rather

, i.e. to develop

at the (lower) fixed point

which is given (if I remember correctly) by

and then take hyperbolic iterations

.

bo198214 Wrote:andydude Wrote:If by my solution you mean through parabolic iteration of

No, I meant the piecewise infinite differentiable definition of slog.

Isnt it defined for arbirtrary bases? (I think you wrote for base greater 1.)

No, the slog function is only defined for bases greater than 1. For bases between 0 and 1, the tetration function is not one-to-one, so its inverse is not a function, because there are multiple values. It's much like saying that y=x^2 does not have an inverse function. y=sqrt(x) only covers part of the domain of the original function.

Also, there's a question about whether you consider the slog function to only apply to the inverse of the function of iterated exponentials/logarithms from 1. For b=2, for example, the domain of slog is negative infinity to 2. However, you can perform iterated exponentials/logarithms from any real number as a starting point, so you could also include the graph for x>4 and the corridor between 2 and 4.

jaydfox Wrote:No, the slog function is only defined for bases greater than 1. For bases between 0 and 1, the tetration function is not one-to-one, so its inverse is not a function, because there are multiple values. It's much like saying that y=x^2 does not have an inverse function. y=sqrt(x) only covers part of the domain of the original function.

Surely, by "arbitrary" I meant: also for

.

I was referring to

andydude Wrote:and I suppose would you could call the elliptic? interval , which is what my definition of the super-logarithm is valid for

however in his pdf he defined it for bases

.

(Quite ridiculous how misunderstandings reach its maximum in the communication between Jay and me ...)

Quote:Also, there's a question about whether you consider the slog function to only apply to the inverse of the function of iterated exponentials/logarithms from 1. For b=2, for example, the domain of slog is negative infinity to 2.

Dont understand this,

maps

to

, so the slog is defined on

?

Quote: However, you can perform iterated exponentials/logarithms from any real number as a starting point, so you could also include the graph for x>4 and the corridor between 2 and 4.

If you use the fixed point method however for base

you have to specify which fixed point you use in case you start with

between these fixed points.

I just wanted to clarify that my super-logarithm solution only works for

even though my pdf says

. I think that the reason for this is that

tetration for bases between 1 and

has an upper limit (due to the convergence of

), and thus the super-logarithm has a limited domain over which it is defined. This upper limit of tetration also means that there will be a singularity on the boundary of this domain, which might explain why I have had such poor results as

with experiments with my method.

When I first discovered the super-logarithm solution, the only singularities in the

matrix equation (rather than the series expansion) seemed to be less than 1, this is what led me to the requirement

, which I later learned to be not strict enough. Sorry. Hope this helps.

For an abstraction of my super-logarithm method, see

http://math.eretrandre.org/tetrationforu...181#pid181
Andrew Robbins

andydude Wrote:I just wanted to clarify that my super-logarithm solution only works for even though my pdf says . I think that the reason for this is that tetration for bases between 1 and has an upper limit (due to the convergence of ), and thus the super-logarithm has a limited domain over which it is defined.

Are you sure, what goes wrong for bases

?

I mean it is clear that the domain of the superlog is bounded above by the lower fixed point of

, which I will call

and which is

.

So

is allowed only for

because

.

What goes wrong for those arguments with your superlog?

The iterated exp(x)-1 seems to work nicely. It takes a minute or two to generate all the helper functions for a 35-term power series, but then I'm able to calculate 505 points for the interval [-248/128, 256/128], step size 1/128, in just over 59 seconds. This was sufficient to produce the following graph of

in 1 minute:

[

attachment=6]

By the way, I'm using a radius of 0.005, 35 terms. I could take the number of terms out to 50 pretty easily, and still get increased precision with each new term. As it is, precision seems to be about 65-70 decimal digits.

By the way, sorry for the extremely generic appearance of the graph. This was my first attempt at plotting in SAGE, so I haven't tried changing the tick spacings on the axes, adding gridlines and labels, etc. I also plan to add graphs of the derivatives (approximated with secants).