Computing Lyapunov constants for random recurrences with smooth coefficients

In recent years, there has been much interest in the growth and decay rates (Lyapunov constants) of solutions to random recurrences such as the random Fibonacci sequence xn+1=±xn±xn−1. Many of these problems involve nonsmooth dynamics (nondifferentiable invariant measures), making computations hard. Here, however, we consider recurrences with smooth random coefficients and smooth invariant measures. By computing discretised invariant measures and applying Richardson extrapolation, we can compute Lyapunov constants to 10 digits of accuracy. In particular, solutions to the recurrence xn+1=xn+cn+1xn−1, where the {cn} are independent standard normal variables, increase exponentially (almost surely) at the asymptotic rate (1.0574735537…)n. Solutions to the related recurrences xn+1=cn+1xn+xn−1 and xn+1=cn+1xn+dn+1xn−1 (where the {dn} are also independent standard normal variables) increase (decrease) at the rates (1.1149200917…)n and (0.9949018837…)n, respectively.