Posts: 1,384
Threads: 90
Joined: Aug 2007
08/06/2009, 10:26 PM
(This post was last modified: 08/06/2009, 10:33 PM by bo198214.)
(08/06/2009, 10:02 PM)jaydfox Wrote: Hmm, that sparked a memory of a longforgotten converstation we had:
http://math.eretrandre.org/tetrationforu...ght=entire
It's amazing how much more sense all of that makes now (and clear from my posts where my misunderstandings at the time were, as well as my gaps in understanding complex analysis). And yes, looking at just the descriptions in that old discussion, it would appear that cheta is nothing new.
Yaya, things are also much clearer for me now. As I already suggested the book of Milnor deals exactly with (the dynamics of) that cases, a must read.
E.g. nonparabolic fixed points have always a neighborhood that is either attractive f'(0)<1 or repellent f'(0)>1. The regular iteration powerseries has nonzero convergence radius.
Parabolic fixed points however have no such neighborhood but alternating attractive and repelling petals (the LeauFatouflower). If the powerseries is of the form
, , one says it is of multiplicity .
E.g. exp(z)1 at 0 or at is of multiplicity 2.
Now the LeauFatouflower has m1 attractive and m1 repellent petals.
In our case e^x1 the one repelling petal covers and the attractive petal covers .
Each petal has an associated (regular) Abel function (and hence regular iteration).
The regular iterations of any petal have the same asymptotic powerseries in the fixed point. But this asymptotic powerseries has mostly convergence radius 0 (nonintegers iterates).
I hope I could make the matter more clear for our forum members.
Quote:The bright side is, this saves me the work of having to rigorously prove various properties, as they apparently have been proven for nearly 20 years. I need only work on getting good numerical approximations (several thousands of bits of accuracy), to use in my changeofbase formula.
Haha dont dare! You have to show that your algorithm indeed reproduces the regular iteration!
And whether the corresponding superfunction for base is holomorphic is also not solved yet, we only know about infinite differentiability by Walker.
If he uses your change of base at all, but to find out is your task now.
Posts: 441
Threads: 31
Joined: Aug 2007
(08/06/2009, 10:26 PM)bo198214 Wrote: Quote:The bright side is, this saves me the work of having to rigorously prove various properties, as they apparently have been proven for nearly 20 years. I need only work on getting good numerical approximations (several thousands of bits of accuracy), to use in my changeofbase formula.
Haha dont dare! You have to show that your algorithm indeed reproduces the regular iteration!
And whether the corresponding superfunction for base is holomorphic is also not solved yet, we only know about infinite differentiability by Walker.
If he uses your change of base at all, but to find out is your task now.
I recall he used something similar to my change of base formula; indeed, when I first read [1], it was a comment at the bottom of page 729 (the page headed "3. Values of Generalized Logarithms"), where it mentioned the h(x) function has a sufficient approximation after at most 5 iterations.
This statement seemed odd, so I worked out what he meant. It was then that I realized that for any two bases of tetration, a and b each real and greater than eta, and a sufficiently large real x, the value is welldefined, and furthermore, relatively easy to calculate to full machine precision with, usually, a very small k (arbitrarily large precision for some math libraries, limited by hardware). (Note: by "sufficiently large real x", I mean that x must be large enough so that it does not become negative with remaining logarithms to be performed, which would lead to nonunique complex results.)
I had already deduced that tetration in base eta was solvable exactly without bizarre matrix inversions or whatever, but this would correspond to "heta", the solution to the fixed point from the negative real direction. In other words, a simple, elegant formula existed. Furthermore, the formula would be provably the unique solution, be infinitely differentiable, etc. Up to that point, everything I'd read about tetration suggested that tetration was impossible to solve uniquely or with infinite differentiabilty, but the literature I had access to was sparse and outdated. So I was excited to be able to solve a base, even if it wasn't e or 2 or 10 or something more useful.
What I needed was a way to get a solution for bases larger than eta, and armed with my change of base formula, I decided to approach the fixed point from the positive real direction, which gave me the cheta function. I actually didn't realize the connection with exp(z)1 at the time, which is kind of a shame because I got the idea from having read Walker's paper! I didn't see the connection at first because I was approaching the problem from the point of view of "tetration", as opposed to thinking in terms of Abel functions and parabolic fixed points and whathaveyou.
[1] Walker, P. (1991). Infinitely differentiable generalized logarithmic and exponential functions. Math. Comput., 57(196), 723–733.
~ Jay Daniel Fox
Posts: 1,384
Threads: 90
Joined: Aug 2007
(08/06/2009, 11:05 PM)jaydfox Wrote: I recall he used something similar to my change of base formula; indeed, when I first read [1], it was a comment at the bottom of page 729 (the page headed "3. Values of Generalized Logarithms"), where it mentioned the h(x) function has a sufficient approximation after at most 5 iterations.
Walker constructs an (infinitely differentiable) auxilliary function
, where .
That satisfies
Then he composes this function with the/one regular Abel function of , .
The resulting function satisfies
i.e. is an Abel function of e^x.
So where is it similar to your change of base?
Posts: 1,384
Threads: 90
Joined: Aug 2007
08/07/2009, 08:15 AM
(This post was last modified: 08/07/2009, 02:18 PM by bo198214.)
For comparison let me reput your formula from an early thread.
I am only focus on the superfunction not so much on the specific constants such that it is . Your double limit can be split into two limits, first:
and then
the superexponential to base b:
for a suitable
indeed satisfies the required equality:
Interestingly this does not depend that much on .
We can choose any function as long as the limit for exists.
Posts: 1,384
Threads: 90
Joined: Aug 2007
08/07/2009, 03:00 PM
(This post was last modified: 08/07/2009, 03:03 PM by bo198214.)
Now let us refocus on Walker's function, he took the Abel function for base so we generalize to arbitrary by:
(though I am not sure whether it still converges for b>e. Jay, Sheldon?)
It satisfies then .
Also we want to have the inverse , where
,
and is a regular superfunction of , i.e. .
Together this yields
so we have a similar case as in the previous post but with .
by modifying we should get tons of variants of .
Posts: 1,384
Threads: 90
Joined: Aug 2007
08/07/2009, 03:10 PM
(This post was last modified: 08/07/2009, 03:11 PM by bo198214.)
Summarizing I would say that your sexp is not the same as Walkers, because
your satisfies:
while Walker's satisfies (at least in the case b=e).
Posts: 441
Threads: 31
Joined: Aug 2007
Posts: 441
Threads: 31
Joined: Aug 2007
(08/07/2009, 07:26 AM)bo198214 Wrote: (08/06/2009, 11:05 PM)jaydfox Wrote: I recall he used something similar to my change of base formula; indeed, when I first read [1], it was a comment at the bottom of page 729 (the page headed "3. Values of Generalized Logarithms"), where it mentioned the h(x) function has a sufficient approximation after at most 5 iterations.
Walker constructs an (infinitely differentiable) auxilliary function
, where .
That satisfies
Then he composes this function with the/one regular Abel function of , .
The resulting function satisfies
i.e. is an Abel function of e^x.
So where is it similar to your change of base?
My change of base formula relies on the following:
.
I had found that it was computationally more accurate to work with the double logarithm of x. Please review this post:
http://math.eretrandre.org/tetrationforu...306#pid306
It's post #36 in that thread, if the link doesn't take you right to it. I remembered last night that I had discussed the double logarithmic approach before, so this morning I searched until I found it.
As you'll see at the bottom of that post, I had previously made the connection between cheta and the iteration of e^x1.
I want to work out the maths a little, so that I post something fairly coherent, but essentially, I believe, after reviewing things a bit, that my cheta with basechange is equivalent to the inverse of Walker's approach (i.e., equivalent to .
~ Jay Daniel Fox
Posts: 754
Threads: 114
Joined: Aug 2007
08/07/2009, 06:03 PM
(This post was last modified: 08/07/2009, 06:05 PM by Gottfried.)
(08/07/2009, 05:14 PM)jaydfox Wrote: My change of base formula relies on the following:
.
just for the record; there was a discussion about this recently in sci.math. See Logarithm of repeated exponential Also an interesting msg of Robert Munafo, who used his "hypercalc" for a approximation with higher iterates.
Gottfried
Gottfried Helms, Kassel
Posts: 1,384
Threads: 90
Joined: Aug 2007
(08/07/2009, 04:18 PM)jaydfox Wrote: Ah, I remember that approach... I stopped pursuing this particular approach to tetration, because its answers varied from those of the cheta + basechange approach and from Andrew's solution (the "intuitive" solution?). (Not saying it's not at least partially relevant here, but just pointing out that this was my first attempt at a solution, and I dropped it in favor of cheta with basechange, which was my second attempt.)
but I think Sheldon posted somewhere that cheta + basechange also differs from Andrew's (intuitive) solution, or was it from Dmitrii's? Its anyway not investigated yet how Dmitrii's differs from Andrew's (they could be equal). I hope we can do some comparisons in the complex plane (because on the real axis differences are mostly too small) in the overview paper. Are you interested to participate? (I still didnt get an answer to that question.)
