10
$\begingroup$

I have the following recurrence relation: $$T(i) = \sqrt{T(i-1) \left(T(i+1) + k\right)},$$ with $k \geq 0$, a fixed constant.

I know that when $k=0$, we have: $$T(i) = \sqrt{T(i-1) T(i+1)},$$ which solution is $T(i) = e^{ai+b}$ (geometric progression), but I do not know if there is a solution for the general case.

  • If there is no closed-form solution to it, as it seems to be the case, is there an easy way to compute $T(i),\;1 < i < n$ given $T(1) = A$ and $T(n) = B$ ?

  • More generally, is there a systematic, elegant way to (numerically) compute recurrences when the initial conditions are not "contiguous" ?

  • 1
    And a bit of notation: Is "$[\cdots]$" supposed to be the integer part of a number? E.g. $[4.2] = 4, [-4.2] = -4$? Or is it just a bracket?2012-09-04
  • 0
    Just a regular bracket. I edited to avoid confusion.2012-09-04
  • 1
    Asymptotically, it will be given by the same geometric progression (because eventually $T \gg k$). For small times there might be quite some difference. I doubt however that there is a closed form solution.2012-09-04
  • 0
    '...when the initial conditions are not "contiguous"...' I'm not sure if I can connect that description with the problem statement. Didn't you, by chance, mean to write `T(i+1+k)` instead of `T(i+1)+k` , no?2013-01-26
  • 0
    @leonbloy no, I meant the initial conditions ($T(1) = A$ and $T(n) = B$).2013-01-31

1 Answers 1