• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Quickest way to compute the Abel function on the Shell-Thron boundary JmsNxn Long Time Fellow Posts: 624 Threads: 102 Joined: Dec 2010 04/21/2022, 01:52 AM (This post was last modified: 04/21/2022, 05:22 AM by JmsNxn.) I'm currently writing a protocol to evaluate the modified bennet operators: $$\alpha _{\varphi} y = \exp_{y^{1/y}}^{\circ s}\left(\log^{\circ s}_{y^{1/y}}(\alpha) + y + \varphi\right)\\$$ For $$\varphi$$ a complex number--I'm mostly just dealing with real positive values at the moment. The goal is to evaluate the function $$\varphi(\alpha,y,s)$$, such that these operators will satisfy Goodstein's equation: $$\alpha \left(\alpha y\right) = \alpha (y+1)\\$$ But for the moment, I'm just concerning myself with calculating the first function. Everything works great so far, but I'm scratching my head for when $$y^{1/y} = \partial \mathfrak{S}$$-- when it's on the boundary of the Shell-Thron region (equivalently $$|\log(y)| = 1$$). Now I know we can construct a repelling and attracting Abel function about these points--and I know all the theory. But I just realized, I've never actually seen a program that constructs it. I know Sheldon has a program for handling it, but I really don't want to go digging through all the matrix theory. I just want a quick formula. I know if you make a variable change that it becomes pretty elementary. So for the moment, I can construct $$\alpha _{\varphi} y$$, for pretty much the entire complex plane in $$y$$ (excluding branch cuts), excluding where $$y^{1/y} \in \mathfrak{S}$$. This is primarily because I don't know a fast way to get both abel functions... I could program in a way, but I think it's going to be way too slow. This program is already pretty slow as it is (we have to consistently reinitialize to account for varying bases of the exponential). I don't want to slow it down any more. I was wondering if there's anywhere on this forum that has an easy to read program I can adapt for this. ...I just hope I don't have to write too much just to handle the case $$|\log(y)| = 1$$ -_-.... Edit: I thought I'd add that I know how to write in the neutral case but it just nukes the speed of my code. I know how to program in the $$\eta$$ case, but I'm wondering what the current fastest way is. For the moment, I'm just returning $$0$$ anywhere on the boundary, because it just nukes my code and makes everything so fucking slow for these values of $$y$$. « Next Oldest | Next Newest »

 Possibly Related Threads… Thread Author Replies Views Last Post Revisting my accelerated slog solution using Abel matrix inversion jaydfox 22 35,414 05/16/2021, 11:51 AM Last Post: Gottfried An incremental method to compute (Abel) matrix inverses bo198214 3 13,846 07/20/2010, 12:13 PM Last Post: Gottfried Attempting to compute the kslog numerically (i.e., Kneser's construction) jaydfox 11 30,591 10/26/2009, 05:56 PM Last Post: bo198214 Computing Abel function at a given center jaydfox 10 21,421 11/30/2007, 06:44 PM Last Post: andydude

Users browsing this thread: 1 Guest(s)