How fast is $ v_{n+1} = \sqrt[3]{ v_n^3 + v_n^\sqrt 7} ? $ What is a good asymptotic for it ?
I know that $ v_{n+1} = \sqrt[3]{ v_n^3 + 1} $ grows like $ v_{n+1} = \sqrt[3]{ v_1^3 + n} $ and I assume $ v_{n+1} = \sqrt[3]{ v_n^3 + v_n^2} $ grows more or less like $v_1 + c n $ for some fixed $c$ because $ v_{n+1} = \sqrt[3]{ v_n^3 + 3 v_n^2 + 3 v_n + 1} = v_n + 1 $ and those expressions are “close”.
But I started to really wonder about
$$ v_{n+1} = \sqrt[3]{ v_n^3 + v_n^A} ?$$
For various values of $A$.
In particular how fast is
$$ v_{n+1} = \sqrt[3]{ v_n^3 + v_n^\sqrt 7} ? $$
I assume no closed form exists.
Im not sure if using Taylor or Laurent series would help. Or maybe matrices ? The problem can be restated with Taylor , Laurent and matrices. But that does not seem to make it easier at first.
I did some numerical tests but I was not convinced of anything.
Ofcourse if one iterates $v + q(v) $ where $q(v) $ goes to 0 as $v$ increases we could estimate $ n $ iterations to give $ v + \sum_i^n q(i)^{-1} q(v)$.
For example when $q(v) = +/- 1/v $ this works relatively well. But not super good. ( for the negative case take v_1 > 2n )