04/28/2023, 02:08 AM
So I'm working on my implementation of extending tetration in Mathematica and I have major convergence problems as soon as I move out of the Shell-Thron region. I can't do something simple like compute the value of \[^3 2\] using my fractional iteration software. Paulsen's software computes it nicely as well as \[^z b \text{ for } b> e^{1/e}.\]
What if I tweaked my algorithms and software to run without using fixed points? Instead is using \[^\infty b\] as a solution for \[b^{^\infty b}=^\infty b\] I could simplify things by evaluating them at \[b^{^n b}= \;^{n+1}b \text{ where } b\in \mathbb{R}.\]
What if I tweaked my algorithms and software to run without using fixed points? Instead is using \[^\infty b\] as a solution for \[b^{^\infty b}=^\infty b\] I could simplify things by evaluating them at \[b^{^n b}= \;^{n+1}b \text{ where } b\in \mathbb{R}.\]
Daniel
