- #1
spiceman
- 3
- 0
Dear forum people,
for a nonlinear software I am writing I am having a hard time to transform a
recurrence relation to an explicit function. Maybe someone can help me along the right lines...
The recurrence relation is of the form (an exponential type function)
y[n+1] = y[n] + k * log(1 + (y[n]/k))
Now I know that simple linear recurrence functions like y[n+1] = y[n] + y[n] transform to explicit functions like y = 2^(n-1), but the tricky part is the log(1+...).
I have a feeling that the Lambert W-function could be a solution to the series
log(1+log(1+log(...))), but I am stuck at the moment. Even Mathematica fails on this problem with its function 'Rsolve'. Does anybody have an idea?
BTW, n is positive integer > 0 and y[n] > 0.
Greets and thanks in advance!
for a nonlinear software I am writing I am having a hard time to transform a
recurrence relation to an explicit function. Maybe someone can help me along the right lines...
The recurrence relation is of the form (an exponential type function)
y[n+1] = y[n] + k * log(1 + (y[n]/k))
Now I know that simple linear recurrence functions like y[n+1] = y[n] + y[n] transform to explicit functions like y = 2^(n-1), but the tricky part is the log(1+...).
I have a feeling that the Lambert W-function could be a solution to the series
log(1+log(1+log(...))), but I am stuck at the moment. Even Mathematica fails on this problem with its function 'Rsolve'. Does anybody have an idea?
BTW, n is positive integer > 0 and y[n] > 0.
Greets and thanks in advance!