Given a functional equation of form $f(f(x))=T(x)$ is there any good ways to solve it numerically? If not then at least approximate in some small region $x\in(-a;a)$.


E.g. with the equation $f(f(x))=x+x^2$ one could prove that the solution is between $l(x)=|x+0.5|+0.5$ and $h(x)=x+x^2$. However I'm unsure how to proceed further.


I've found a solution for equations like these [on arxiv](https://arxiv.org/pdf/1302.1986.pdf). However it seems to converge very badly (or I'm doing something wrong).



Is it possible to numericaly solve functional equation
Select the one you like ($f^{[1/2]}(x)$ means half-iteration, iterative square root):


$$f^{[1/2]}(x)=\sum\_{m=0}^{\infty} \binom {1/2}m \sum\_{k=0}^m\binom mk(-1)^{m-k}f^{[k]}(x)$$


$$f^{[1/2]}(x)=\lim\_{n\to\infty}\binom {1/2}n\sum\_{k=0}^n\frac{1/2-n}{1/2-k}\binom nk(-1)^{n-k}f^{[k]}(x)$$


$$f^{[1/2]}(x)=\lim\_{n\to\infty}\frac{\sum\_{k=0}^{n} \frac{(-1)^k f^{[k]}(x)}{(1/2-k)k!(n-k)!}}{\sum\_{k=0}^{n} \frac{(-1)^k }{(1/2-k) k!(n-k)!}}$$


