So then, what sort of method could be used to do high levels of iteration? Obviously it won't work when power series are the thing being iterated upon, at least with conventional summation (not sure about "divergent summation" techniques, but things like Euler summation introduce extra parameters, the value of which I'm not sure how to get. A good testbed might be the coefficients given on http://en.citizendium.org/wiki/Tetration...on_at_zero for the Taylor expansion of the tetrational function to the base e at z = 0, recovered via the Cauchy integral.), because one is trying to go toward a series with limited convergence radius (and Bernoulli sum chokes on that due to the growth rate of the coefficients.).
|
Road testing Ansus' continuum product formula
|
|
« Next Oldest | Next Newest »
|
| Possibly Related Threads… | |||||
| Thread | Author | Replies | Views | Last Post | |
| fixed point formula | sheldonison | 6 | 32,434 |
05/23/2015, 04:32 AM Last Post: mike3 |
|
| Numerical algorithm for Fourier continuum sum tetration theory | mike3 | 12 | 50,624 |
09/18/2010, 04:12 AM Last Post: mike3 |
|
Users browsing this thread: 1 Guest(s)

