• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Reducing beta tetration to an asymptotic series, and a pull back JmsNxn Long Time Fellow Posts: 566 Threads: 94 Joined: Dec 2010 07/20/2021, 05:28 AM (This post was last modified: 07/21/2021, 01:39 AM by JmsNxn.) I thought I'd point out the way I've been programming lately; and the fact that my method of programming doesn't work perfectly. Because pari-gp protocols don't allow exponentials larger than $\exp(1\text{E}6)$; I've had to shortcut my code, as the recursive process hits values much higher than that before becoming perfectly accurate. For that reason I'm beginning to alter my approach. My first way of doing this was by creating a matrix add on, where we calculate the taylor series of $\varphi$. This means we create a small INIT.dat file which stores all the $a_k$, $ \beta_\lambda(s) = \sum_{k=1}^\infty a_k e^{k\lambda s} \,\,\text{for}\,\,\Re(s) < 1\\$ The second breakthrough came by when looking at Tommy's Gaussian method. Which, Tommy's method admits no exponential series like this. But what starts to happen for large values is something magical. I never noticed it before, but it's exactly what I was missing. Recall that, $ \log\beta_\lambda(s+1) = \beta_\lambda(s)-\log(1+e^{-\lambda s})\\$ And that, $ \tau_\lambda^{n}(s) = \log^{\circ n} \beta_\lambda(s+n) - \beta_\lambda(s)\\$ which satisfy the recursion, $ \tau_\lambda^{n+1}(s) = \log(1 + \frac{\tau_\lambda^n(s+1)}{\beta_\lambda(s+1)}) - \log(1+e^{-\lambda s})\\$ Now, for large $s$ the value, $ \log(1 + \frac{\tau_\lambda^n(s+1)}{\beta_\lambda(s+1)}) = \frac{\tau_\lambda^n(s+1)}{\beta_\lambda(s+1)} + \mathcal{O}(\frac{\tau_\lambda^n(s+1)}{\beta_\lambda(s+1)})^2\\$ But even better, this asymptotic works so long as $\beta_\lambda(s+1)$ is large. But $\beta_\lambda$ is an asymptotic solution to tetration; $\beta_\lambda(4)$ is already astronomical. So let's just scrap the $\log(1+x)$ altogether! This gives us the chance to make an asymptotic approximation that always works. $ \tau_\lambda^1(s) = -\log(1+e^{-\lambda s})\\ \tau_\lambda^{n+1}(s) \sim \frac{\tau_\lambda^{n}(s+1)}{\beta_\lambda(s+1)} -\log(1+e^{-\lambda s})\\$ BUT THIS JUST PRODUCES AN ASYMPTOTIC SERIES!!!!!!!!!!!!!!!!!!! So effectively it constructs an asymptotic solution to the $\beta$-method; pulling back with log's is even easier now. We can choose the depth of the asymptotic series. This is very reminiscent of Kouznetsov; but again, this isn't Kneser's solution. I'll derive the asymptotic series here.  This is mostly important for bypassing errors with iterated logarithms; and furthermore; it is meant for high speed calculation of the $\beta$-method far out in the complex plane. Starting with the recursion, $ \rho_\lambda^1(s) = -\log(1+e^{-\lambda s})\\ \rho_\lambda^{n+1}(s) = \frac{\rho_\lambda^{n}(s+1)}{\beta_\lambda(s+1)} -\log(1+e^{-\lambda s})\\$ We get that, $ \rho_\lambda(s) = \lim_{n\to\infty} \rho_\lambda^n(s) = -\sum_{k=0}^\infty \dfrac{\log(1+e^{-\lambda(s+k)})}{\prod_{j=1}^k \beta_\lambda(s+j)}\\$ which satisfies the functional equation, $ \rho_\lambda(s) = \frac{\rho_\lambda(s+1)}{\beta_\lambda(s+1)} -\log(1+e^{-\lambda s})\\$ Which means that, $ \tau_\lambda \sim \rho_\lambda\,\,\text{as}\,\,\Re(s) \to \infty\\$ Which further means, that, $ \text{tet}_\beta(s+x_0) = \beta_\lambda(s) + \tau_\lambda(s) \sim \beta_\lambda(s) + \rho_\lambda(s)\,\,\text{as}\,\,\Re(s) \to \infty\\ \tau_\lambda \sim \rho_\lambda\\$ This is very important because $\rho_\lambda = \tau_\lambda$ upto a hundred digits at about $\Re(s) > 5$; but $\rho$ is so much easier to calculate. Furthermore, I believe this method will work with Tommy's Gaussian choice; where we swap $-\log(1+e^{-\lambda s})$ with $\log(A(s+1))$ where, $ A(s) = \frac{1}{\sqrt{\pi}}\int_{-\infty}^s e^{-x^2}\,dx\\$ And further more; since all of these choices are asymptotic to each other: Tommy's Gaussian method equals the beta method! I'm planning to set this in stone in my next paper. Construct an arbitrarily accurate asymptotic to tetration (a la beta). Regards, James tl;dr $ \tau_\lambda(s) = -\sum_{k=0}^n \frac{\log(1+e^{-\lambda(s+k)})}{\prod_{j=1}^k\beta_\lambda(s+j)} + \mathcal{O}(1/\beta_\lambda(s+n+1))\,\,\text{as}\,\,\Re(s) \to \infty\\$ tommy1729 Ultimate Fellow Posts: 1,491 Threads: 355 Joined: Feb 2009 07/21/2021, 05:48 PM That seems correct and logical (imo). Originally I considered taking the lambertW function for approximations. Not sure if that still relates much. However a tiny remark. division by tet(s) is not necc small , even for Re(s) large ; because tet(s) can be close to 0 ! This (chaos) complicates matters , despite perhaps still true ... not so trivially ... regards tommy1729 JmsNxn Long Time Fellow Posts: 566 Threads: 94 Joined: Dec 2010 07/22/2021, 03:37 AM (This post was last modified: 07/22/2021, 03:37 AM by JmsNxn.) (07/21/2021, 05:48 PM)tommy1729 Wrote: That seems correct and logical (imo). Originally I considered taking the lambertW function for approximations. Not sure if that still relates much. However a tiny remark. division by tet(s) is not necc small , even for Re(s) large ; because tet(s) can be close to 0 ! This (chaos) complicates matters , despite perhaps still true ... not so trivially ... regards tommy1729 You're correct, Tommy. But if $\Im(s) = A$ is fixed, eventually $\beta_\lambda(s) \to \infty$ as $\Re(s) \to \infty$ And they aggregate to the orbit $0,1,e,e^e,e^{e^e}...$. So EVENTUALLY on each line it will be tiny. That's more so what I meant. But if we vary $\Im(s)$ while we vary $\Re(s)$ that's where the trouble happens. Regards « Next Oldest | Next Newest »

 Possibly Related Threads... Thread Author Replies Views Last Post Calculating the residues of $$\beta$$; Laurent series; and Mittag-Leffler JmsNxn 0 129 10/29/2021, 11:44 PM Last Post: JmsNxn Arguments for the beta method not being Kneser's method JmsNxn 54 6,085 10/23/2021, 03:13 AM Last Post: sheldonison I'm back on tetration forum sheldonison 6 844 09/25/2021, 04:13 AM Last Post: JmsNxn Searching for an asymptotic to exp[0.5] tommy1729 200 338,516 09/16/2021, 11:13 PM Last Post: tommy1729 Why the beta-method is non-zero in the upper half plane JmsNxn 0 313 09/01/2021, 01:57 AM Last Post: JmsNxn Using a family of asymptotic tetration functions... JmsNxn 15 3,964 08/06/2021, 01:47 AM Last Post: JmsNxn A Holomorphic Function Asymptotic to Tetration JmsNxn 2 1,101 03/24/2021, 09:58 PM Last Post: JmsNxn An asymptotic expansion for \phi JmsNxn 1 986 02/08/2021, 12:25 AM Last Post: JmsNxn Perhaps a new series for log^0.5(x) Gottfried 3 4,383 03/21/2020, 08:28 AM Last Post: Daniel Merged fixpoints of 2 iterates ? Asymptotic ? [2019] tommy1729 1 3,351 09/10/2019, 11:28 AM Last Post: sheldonison

Users browsing this thread: 1 Guest(s)