A Note on the Reproducibility of Chaos Simulation

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 studie...

Full description

Bibliographic Details
Main Authors: Thalita E. Nazaré, Erivelton G. Nepomuceno, Samir A. M. Martins, Denis N. Butusov
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Entropy
Subjects:
Online Access:https://www.mdpi.com/1099-4300/22/9/953
_version_ 1797555227831828480
author Thalita E. Nazaré
Erivelton G. Nepomuceno
Samir A. M. Martins
Denis N. Butusov
author_facet Thalita E. Nazaré
Erivelton G. Nepomuceno
Samir A. M. Martins
Denis N. Butusov
author_sort Thalita E. Nazaré
collection DOAJ
description 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.
first_indexed 2024-03-10T16:44:26Z
format Article
id doaj.art-fb592591b1b540cd90e023d91cff14f4
institution Directory Open Access Journal
issn 1099-4300
language English
last_indexed 2024-03-10T16:44:26Z
publishDate 2020-08-01
publisher MDPI AG
record_format Article
series Entropy
spelling doaj.art-fb592591b1b540cd90e023d91cff14f42023-11-20T11:48:17ZengMDPI AGEntropy1099-43002020-08-0122995310.3390/e22090953A Note on the Reproducibility of Chaos SimulationThalita E. Nazaré0Erivelton G. Nepomuceno1Samir A. M. Martins2Denis N. Butusov3Control and Modelling Group (GCOM), Department of Electrical Engineering, Federal University of São João del-Rei, São João del-Rei, MG 36307-352, BrazilControl and Modelling Group (GCOM), Department of Electrical Engineering, Federal University of São João del-Rei, São João del-Rei, MG 36307-352, BrazilControl and Modelling Group (GCOM), Department of Electrical Engineering, Federal University of São João del-Rei, São João del-Rei, MG 36307-352, BrazilYouth Research Institute, Saint-Petersburg Electrotechnical University “LETI”, 197376 Saint Petersburg, RussiaAn 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.https://www.mdpi.com/1099-4300/22/9/953reproducibilitycomputational chaoscomputer arithmeticOSF platform
spellingShingle Thalita E. Nazaré
Erivelton G. Nepomuceno
Samir A. M. Martins
Denis N. Butusov
A Note on the Reproducibility of Chaos Simulation
Entropy
reproducibility
computational chaos
computer arithmetic
OSF platform
title A Note on the Reproducibility of Chaos Simulation
title_full A Note on the Reproducibility of Chaos Simulation
title_fullStr A Note on the Reproducibility of Chaos Simulation
title_full_unstemmed A Note on the Reproducibility of Chaos Simulation
title_short A Note on the Reproducibility of Chaos Simulation
title_sort note on the reproducibility of chaos simulation
topic reproducibility
computational chaos
computer arithmetic
OSF platform
url https://www.mdpi.com/1099-4300/22/9/953
work_keys_str_mv AT thalitaenazare anoteonthereproducibilityofchaossimulation
AT eriveltongnepomuceno anoteonthereproducibilityofchaossimulation
AT samirammartins anoteonthereproducibilityofchaossimulation
AT denisnbutusov anoteonthereproducibilityofchaossimulation
AT thalitaenazare noteonthereproducibilityofchaossimulation
AT eriveltongnepomuceno noteonthereproducibilityofchaossimulation
AT samirammartins noteonthereproducibilityofchaossimulation
AT denisnbutusov noteonthereproducibilityofchaossimulation