Detecting unreliable computer simulations of recursive functions with interval extensions
This paper presents a procedure to detect unreliable computer simulations of recursive functions. The proposed method calculates a lower bound error which is derived from two different pseudo-orbits based on interval extensions. The interval extensions are generated by taking into account the associative property of multiplication, which keeps the same error bound.
We have tested our approach on the logistic map using many different programming languages and simulation packages, including Matlab, Scilab, Octave, Fortran and C. In all cases, the number of iterates is significantly lower than that considered reliable in the existing literature. We have also used the lower bound error on the logistic map and on the polynomial NARMAX for the Rössler equations to estimate the largest Lyapunov exponent, which determines the critical simulation time that guarantees the reliability of the simulation.
E. Nepomuceno, S. Martins, B. Silva, G. Amaral, M. Perc, Detecting unreliable computer simulations of recursive functions with interval extensions, Applied Mathematics and Computation 329 (2018) 408–419