• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Reducing beta tetration to an asymptotic series, and a pull back JmsNxn Ultimate Fellow Posts: 889 Threads: 110 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\\$ « Next Oldest | Next Newest »

 Messages In This Thread Reducing beta tetration to an asymptotic series, and a pull back - by JmsNxn - 07/20/2021, 05:28 AM RE: Reducing beta tetration to an asymptotic series, and a pull back - by tommy1729 - 07/21/2021, 05:48 PM RE: Reducing beta tetration to an asymptotic series, and a pull back - by JmsNxn - 07/22/2021, 03:37 AM

 Possibly Related Threads… Thread Author Replies Views Last Post Describing the beta method using fractional linear transformations JmsNxn 5 53 10 hours ago Last Post: JmsNxn Tetration Asymptotic Series Catullus 18 880 07/05/2022, 01:29 AM Last Post: JmsNxn Formula for the Taylor Series for Tetration Catullus 8 908 06/12/2022, 07:32 AM Last Post: JmsNxn Searching for an asymptotic to exp[0.5] tommy1729 202 377,500 05/01/2022, 11:36 PM Last Post: tommy1729 The beta method thesis JmsNxn 9 1,273 04/20/2022, 05:32 AM Last Post: Ember Edison Trying to get Kneser from beta; the modular argument JmsNxn 2 527 03/29/2022, 06:34 AM Last Post: JmsNxn tommy beta method tommy1729 0 595 12/09/2021, 11:48 PM Last Post: tommy1729 Calculating the residues of $$\beta$$; Laurent series; and Mittag-Leffler JmsNxn 0 633 10/29/2021, 11:44 PM Last Post: JmsNxn Trying to find a fast converging series of normalization constants; plus a recap JmsNxn 0 591 10/26/2021, 02:12 AM Last Post: JmsNxn Arguments for the beta method not being Kneser's method JmsNxn 54 15,857 10/23/2021, 03:13 AM Last Post: sheldonison

Users browsing this thread: 1 Guest(s)