An evergreen scientific feature is the ability for scientific works to be reproduced. Since chaotic systems are so hard to understand analytically, numerical simulations assume a key role in their investigation. Such simulations have been considered as reproducible in many works. However, few studies have focused on the effects of the finite precision of computers on the simulation reproducibility of chaotic systems; moreover, code sharing and details on how to reproduce simulation results are not present in many investigations. In this work, a case study of reproducibility is presented in the simulation of a chaotic jerk circuit, using the software LTspice. We also employ the OSF platform to share the project associated with this paper. Tests performed with LTspice XVII on four different computers show the difficulties of simulation reproducibility by this software. We compare these results with experimental data using a normalised root mean square error in order to identify the computer with the highest prediction horizon. We also calculate the entropy of the signals to check differences among computer simulations and the practical experiment. The methodology developed is efficient in identifying the computer with better performance, which allows applying it to other cases in the literature. This investigation is fully described and available on the OSF platform.
Keywords: OSF platform; computational chaos; computer arithmetic; reproducibility.