Re: Finding the Formula...

Am 17.07.2008 21:47 schrieb mike3:
On Jul 17, 2:06 am, Gottfried Helms <he...@xxxxxxxxxxxxx> wrote:
Mike -

I've not consequently read into your tables, but something
looks similar to what I've calculated recently, and where
I found an iterative algorithm to compute the numbers.

<snip>

This is interesting. I might have a look at it, however what I
was trying to do was figure out a _formula_ for the nth coefficient
of the natural dxp-tetration series (or even better that with
changeable k so other bases can be used), as opposed to just an
algorithm for generating the coefficients. For example, I noticed
how you said it took many many iterations with huge matrices to
obtain a coefficient...

So then why I asked about the h-step mappings with n inputs --
what that means, and what the general expression for those closed-
form formulae (with respect to h) is for any given n... Because it
seems that will provide a formula, at least for natural-base
dxp-tetration (and so also for e^(1/e)-base normal tetration).

Yepp; I don't have a better formula for this yet too - the search
for such a formula just led to that algorithm.

---------

Just a remark: I said, the computable consumtion in this
algorithm is huge; I should better have said, it is increasing
with the index of the coefficients. For the first, say 4
coefficients it is small, then up to 8 one may manage this
with 8 by 28 matrices (guessed) with the order of matrix-
size about n by binomial(n,2) for the n'th coefficient.
I've also another algorithm (by symbolic eigensystem-analysis)
but this is also using increasing size of the matrices.

Hmm - I'd be curious whether a principally simpler formula
can be found, since the complexity of the coefficients
just *is* as high as the diagonalization exhibits.

---------

I think, one needs another framework than that of powerseries
if a simpler set of coefficients for a series is sought.
For instance, just recently Henryk Trappmann presented
a binomial-expansion on the series of values of integer
iterates of the function itself, so say

U°0(x) + U°1(x) + U°2(x) + ... = <something>

then

a0(x) = 1 U°0(x)
a1(x) = -1 U°0(x) + 1 U°1(x)
a2(x) = 1 U°0(x) - 2 U°1(x) + 1 U°2(x)
...
and

U°h(x) = bi(h,0)a0(x) + bi(h,1)a1(x) + bi(h,2)a2(x) + ...

(bi(x,y) is binomial-coefficient)
where if h is fractional this is an infinite series,

I checked this method with some fractional h and found,
that I needed 200 terms of this series to get accuracy
to say, 12 digits.
Interestingly, when I took for instance h=0.5 then this
converged slowly, if I took h=1.5 and then the log of the
result (mimicking the decrease of h by 1) then the accu-
racy increased, and up to h=23.5 I got then accuracy
up to nearly 30 digits.

---

Well - this is still not answering your question; if there
were a better function for the computation of the coefficients
of the powerseries-representation around, I would like to see
it, too.

Gottfried
.

Relevant Pages

  • Re: Finding the Formula...
    ... I found an iterative algorithm to compute the numbers. ... recursive generation scheme. ... It contains the coefficients of the polynomials in u: ... So for index k=20 I need already 8000 iterations with always growing ...
    (sci.math)
  • Re: Finding the Formula...
    ... algorithm for generating the coefficients. ... how you said it took many many iterations with huge matrices to ... If my "hunch" is right and the polynomials are of degree n, ...
    (sci.math)
  • Re: -- Tetration: x - f(x) + f(f(x)) - f(f(f(x))) + ... - ... = 1/2*(exp(x) -
    ... But now - iterations and especially the sum of iterations ... of this functions in the Lambert-representation should be ... coefficients of the function. ... Using 32 coefficients for the function and 60 iterates for the sum ...
    (sci.math)
  • Re: -- Tetration: x - f(x) + f(f(x)) - f(f(f(x))) + ... - ... = 1/2*(exp(x) -
    ... inverse function of fusing lambertW() ... But now - iterations and especially the sum of iterations ... coefficients of the function. ... Using 32 coefficients for the function and 60 iterates for the sum ...
    (sci.math)
  • Inaccuracy of ANSI clock() as ?-RNG
    ... I tried to build a portable ANSI C stopwatch with sub-/millisecond ... accuracy, using the clock-function. ... Inaccuracy is reflected as a varying number of iterations which fit ... "Juuso's inaccurate clock" - algorithm. ...
    (sci.crypt)