![]() |
|
Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - Printable Version +- Tetration Forum (https://tetrationforum.org) +-- Forum: Tetration and Related Topics (https://tetrationforum.org/forumdisplay.php?fid=1) +--- Forum: Mathematical and General Discussion (https://tetrationforum.org/forumdisplay.php?fid=3) +--- Thread: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? (/showthread.php?tid=633) Pages:
1
2
|
Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - JmsNxn - 05/19/2011 I ask because I want to observe how logarithmic semi-operators behave for bases less than or equal to \( e^{1/e} \). I haven't a clue where I might going about getting these. I think it was Sheldon who posted coefficients for me before, but they were base 2, and the graphs didn't look pretty; so I just wonder if more erratic bases will give different results. I know that \( log_{e^{1/e}}(x) \) has a fix point at x = e, so I wonder if that might change anything and might shift the hump that appears with base 2. If anybody wonders what I'm talking about it's \( 0 \le q \le 1 \) and \( r:f(x) = f^{\alpha r}(x) = f^{[r]}(x) \): \( x\, \{-q\}\, y = {\small (1-q):}\log_{b}({\small (q-1):}\log_{b}x+ {\small (q-1):}\log_{b}y) \) which behaves as addition \( x\, \{1-q\}\, y = {\small (q-1):}\log_{b}({\small (1-q):}\log_{b}x + {\small (1-q):}\log_{b}y) \) which behaves as multiplication \( x\, \{2-q\}\, y = {\small (q-1):}\log_{b}(y [{\small (1-q):}\log_{b}x]) \) which behaves as exponentiation Thanks for reading this. Any help would be greatly appreciated. RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - Gottfried - 05/20/2011 (05/19/2011, 07:49 PM)JmsNxn Wrote: I ask because I want to observe how logarithmic semi-operators behave for bases less than or equal to \( e^{1/e} \).Hi James, I'd like to help for this neat idea. However, after my comparision of the four interpolation-methods I do no more trust in the relevance of the "regular-tetration"-powerseries as I used them up to now - so I do not know whether you want possibly waste your time with analysis of that powerseries. Unfortunately I still do not have a clue how the Dmitri Kouznetzov Cauchy-integral-method works at all so I also cannot provide powerseries of that presumably better method. But if it is just for the fun of exploration/exercise you can well have my Pari/GP-procedures for this. (in that case please contact me via email) Regards- Gottfried RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - JmsNxn - 05/20/2011 Well I wouldn't be analyzing the Taylor series per se. I'd just like to see a graph of \( f(t) = a\,\{t\}\,b \) for any appropriate constants a and b over \( t\, \epsilon\, [-1, 2] \). My understanding is that the differences between each version of tetration are minute and probably wouldn't affect an approximate graph (It should at least be enough to verify that there are no humps). I'll give you an email then. RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - andydude - 05/20/2011 That is a really interesting question. First of all, that is one of the bases for which the series expansion of (\exp_b^t(x)) in terms of x is relatively simple with "nice" coefficients, but substituting x=1 (which I think you are talking about) gives a function of t which is not strictly a power series, which makes finding that power series more difficult. Anyways, I believe I have done this before, but I don't have access to my notes right, now, so let me get back to you later today... Andrew Robbins RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - Gottfried - 05/21/2011 Just for an impression. With the matrix-logarithm-method based on the exponentials recentered at e; g(h) = f(1-e,h)+e depending on the iteration height h I get the following coefficients for g(h) Code: 1.0Code: g(h)= 1.0 + 0.611... h - 0.2317... h^2 + 0.09178... h^3 + ...gives the the h'th iteration to base ae=exp(exp(-1))~ 1.4446... beginning at x0=1 in the version of the "regular tetration". This is valid for 20 digits accuracy for at least 0<=h<=2, so two unit-intervals of the iteration. The restriction to, say, 20 digits is because I've seen that ae^g(0.5) - g(1.5) ~ 1e-15 and possibly I need a significant extension of my matrices/powerseries to achieve more accuracy. @James: as promised I'll send the Pari/GP-procedures, so you may extend the precision to higher degree yourself, but give me some time to harvest the relevant script procedures from the the jungle of my Pari/GP-script files library... RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - sheldonison - 05/21/2011 (05/19/2011, 07:49 PM)JmsNxn Wrote: I ask because I want to observe how logarithmic semi-operators behave for bases less than or equal to \( e^{1/e} \). I haven't a clue where I might going about getting these. I think it was Sheldon who posted coefficients for me before, but they were base 2, and the graphs didn't look pretty; so I just wonder if more erratic bases will give different results. I know that \( log_{e^{1/e}}(x) \) has a fix point at x = e, so I wonder if that might change anything and might shift the hump that appears with base 2.Hey James, Hey Andy, haven't heard from you in awhile! I've been laying low for awhile, trying to learn more background math so I can talk more intelligently on these forums, and maybe eventually write a paper.... I'll have to take a pass on James's larger problem, but I think I can get you a series for base \( \eta = e^{1/e} \). Jaydfox (Jay Daniels) called the upper superfunction for this base cheta(z). For all real(z), cheta(z) is > e, and increasing, and cheta(z) is entire. Henryk has made numerous other posts on this function, with references to earlier work, which is mathematically equivalent to iterating exp(z)-1. I believe Gottfried may have posted results for the lower superfunction base eta. I'm using Jay's suggestion to normalize cheta(0)=2*e. First off a caveat: I feel like I have some understanding of all of the other bases for tetratation. Even though cheta(z) was the very first super exponential base I explored, there many things I don't understand cheta(z). Unlike all other bases, it has no periodicity or pseudo periodicity. I'm using Newton interpolation algorithm here, that seems to work quite well. Before I knew how to calculate sexp(z) for any other bases, I was very curious about cheta(z), and cheta(z) in the complex plane, and this is the algorithm I used to investigate it. I center the Newton polynomial at cheta(-95) with 25 sample points on either side. So that the Newton_polynomial(0)=cheta(-95). This gives a consistent well behaved polynomial, whose 50th coefficient is 5E-101, with consistent accurate values for values of cheta in the neighborhood of cheta(-95), with an accuracy radius of at least 10 units, in either direction. For the results I'm posting here centered at cheta(0)=2e, I iterate the exponent of that function 95 times, to make a unit circle in the complex plane centered around cheta(0), from which a taylor series can be generated. It appears to work; I've haven't posted it before. Initialized to 67 digits accuracy in pari-gp, the algorithm seems to give results with nearly 50 decimal digits of accuracy. Here is the Taylor Series. a0=2e, printed to 32 digits. Code: 0 5.4365636569180904707205749427053Now, for the inverse function I am also centering the series around z=2*e. So, you need to substitute y=z-2*e, and this is the Taylor series for the inverse function, \( \text{cheta}^{-1}(z-2e) \). - Sheldon Code: 0 -2.8394844317361184366323169886 E-46RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - bo198214 - 05/23/2011 (05/19/2011, 07:49 PM)JmsNxn Wrote: I ask because I want to observe how logarithmic semi-operators behave for bases less than or equal to \( e^{1/e} \). I haven't a clue where I might going about getting these. Hmm, interesting question. The theory is that the regular fractional iterates of \( f(x)=\eta^x \) (\( \eta=e^{1/e} \)) have 0 convergence radius around the development (and fix)point e. From the theory of Écalle it follows that one can compute the regular Abel function \( \alpha \), i.e. the inverse of the superfunction \( \sigma(z)=f^{[z]}(z_0) \), as the following limit: \( \alpha_\theta(z) = \lim_{n\to\infty} F_{\theta}(f^{[-\theta n]}(z)/e-1) + \theta n \) where \( F_\theta(z)=\frac{1}{3}\log(\theta z) - \frac{2}{z} \) for \( \theta z > e \), \( \theta=\pm 1 \). (a value of \( \theta=-1 \) indicates the function which is real on the left side of e and \( \theta=+1 \) indicates the function which is real on the right side of e.) Though this formula is usually designed to compute values of \( \alpha_\theta \) numerically, it can also be used to compute the powerseries of \( \alpha_\theta \), say at \( z=0 \). To compute this we see that we have to calculate the formal powerseries of \( f^{[n]} \) (if we start with the case of \( \theta=-1 \)) and further then apply logarithm and reciprocal to this powerseries. The composition of two powerseries \( (g\circ h)(x)=g(h(x)) \) is possible with rational terms of the coefficients of \( g\circ h \) if h(0)=0. But \( f(0)=\eta^0=1\neq 0 \). Despite we can construct \( f^{[n]} \) with only using compositions of powerseries \( H_n \) which satisfy \( H_n(0)=0 \). This can be done with the following inductive definition: \( H_1(x)=\eta^x - 1 \) and \( H_{n+1}(x) = (\eta[4]n)^{H_n(x)}-1 \) Verify that always: \( f^{[n]}(x)=(\eta[4](n-1))*(H_n(x)+1) \) for example: \( f^{[2]}(x)]=\eta^{\eta^x} = \eta\eta^{\eta^x-1}=\eta*(\eta^{H_1(x)} - 1 + 1) = (\eta[4]1)(H_2(x)+1) \) We see that the constant term of the powerseries of \( f^{[n]} \) is \( \eta[4](n-1) \) and so it converges to \( e \), hence the constant term of \( f^{[n]}(x)/e-1 \) is \( \epsilon=\frac{\eta[4](n-1)}{e}-1 \) and \( \epsilon\neq 0 \) (though \( \epsilon\to 0 \)). Hence we can apply the logarithm powerseries which is \( \log(x+\epsilon)=\log(\epsilon)+\log(1+x/\epsilon) = \sum_{n=1}^\infty \frac{(-1)^{n+1}}{n \epsilon^n} x^{n} \) and also the reciprocal powerseries \( \frac{1}{x+\epsilon} = \frac{1}{\epsilon} \sum_{n=0}^\infty \frac{(-1)^{n}}{\epsilon^n} x^n \). Ok, when one applies all this stuff to the calculation of \( \alpha_\theta \) with \( \theta=-1 \), i.e. the Abel function which is real on \( x<e \), I get the following coefficients for n=1000 iterations: Code: 2.03, 0.602, 0.248, 0.0942, 0.0351, 0.0130, 0.00482, 0.00178, 0.000657, 0.000242, 0.0000893, 0.0000329, 0.0000121, 4.47e-6, 1.64e-6, 6.05e-7, 2.23e-7, 8.20e-8, 3.02e-8, 1.11e-8it seems however that they are accurate only up to 3 digits. The corresponding super-function developed at 2.03 has then the coefficients: Code: 0, 1.66, -1.14, 0.839, -0.656, 0.534, -0.448, 0.385, -0.337, 0.300, -0.270, 0.245, -0.225, 0.207, -0.192, 0.179, -0.168, 0.158, -0.149, 0.141RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - sheldonison - 05/23/2011 (05/23/2011, 07:04 PM)bo198214 Wrote: ....The corresponding super-function developed at 2.03 has then the coefficients:I got my code working for the lower superfunction at \( \eta \), or the sexp. Your results matches the Taylor series I get for \( \text{sexp}_{\eta}(z-1) \), developed at -1, where sexp(-1)=0. Code: a0 = 0RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - bo198214 - 05/23/2011 (05/23/2011, 08:42 PM)sheldonison Wrote: Your results matches the Taylor series I get for \( \text{sexp}_{\eta}(z-1) \), developed at -1, where sexp(-1)=0. Ya but your values are much more accurate as it seems, how do you obtain them? RE: Does anyone have taylor series approximations for tetration and slog base e^(1/e)? - sheldonison - 05/24/2011 (05/23/2011, 09:53 PM)bo198214 Wrote:I'll describe what I did to generate the Taylor series for sexp(z). Its not fancy or anything -- its just what worked for me to investigate base eta, with its parabolic convergence. I use pari-gp, to generate an interpolating polynomial. Only I center the polynomial around sexp(100), where the sexp(z) function is already converging towards e, and is fairly well behaved. Then I generate 25 points on either side of sexp(100), using 67 digits of precision.(05/23/2011, 08:42 PM)sheldonison Wrote: Your results matches the Taylor series I get for \( \text{sexp}_{\eta}(z-1) \), developed at -1, where sexp(-1)=0. Now I have a 50 term polynomial, centered around z=100, which seems to have nice convergence properties. The 50th series term of the interpolating polynomial is ~2E-102. The error terms seem to be around 10^-50 close to z=100, and increases to 10^-33 as the radius increases to 20 units. I haven't done a theoretical interpolation error analysis, but I have graphed sexpeta(z)-eta^sexpeta(z-1). The next step is akin to a discreet version of analytic continuation, where we pick a sample circle. I used a unit circle centered around z=100. I usually pick 200 evenly spaced points around the unit circle, and for each of those points, take the logarithm base eta 100 times. Now we have another unit circle, with 200 sample points, centered around z=0. Use the Cauchy integral to generate a Taylor series from those 200 sample points, and you get a Taylor series, centered around z=0. I have routines that will generate a Taylor series with any number of sample points and sample radius, sort of like a discreet version of analytic continuation. - Sheldon |