New answers tagged numerical-algorithms
0
If you use memoization, your algorithm will have $O(n^2)$ running time, instead of $O(2^n)$ running time. See also https://en.wikipedia.org/wiki/Numerical_differentiation#Higher_derivatives.
You might check the value of $dx$ you are using (see https://en.wikipedia.org/wiki/Numerical_differentiation#Step_size); and check whether you are experiencing ...
Top 50 recent answers are included
