Cargando…

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

Descripción completa

Detalles Bibliográficos
Autores principales: Nazaré, Thalita E., Nepomuceno, Erivelton G., Martins, Samir A. M., Butusov, Denis N.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597239/
https://www.ncbi.nlm.nih.gov/pubmed/33286722
http://dx.doi.org/10.3390/e22090953
_version_ 1783602299110686720
author Nazaré, Thalita E.
Nepomuceno, Erivelton G.
Martins, Samir A. M.
Butusov, Denis N.
author_facet Nazaré, Thalita E.
Nepomuceno, Erivelton G.
Martins, Samir A. M.
Butusov, Denis N.
author_sort Nazaré, Thalita E.
collection PubMed
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.
format Online
Article
Text
id pubmed-7597239
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75972392020-11-09 A Note on the Reproducibility of Chaos Simulation † Nazaré, Thalita E. Nepomuceno, Erivelton G. Martins, Samir A. M. Butusov, Denis N. Entropy (Basel) Article 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. MDPI 2020-08-29 /pmc/articles/PMC7597239/ /pubmed/33286722 http://dx.doi.org/10.3390/e22090953 Text en © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Nazaré, Thalita E.
Nepomuceno, Erivelton G.
Martins, Samir A. M.
Butusov, Denis N.
A Note on the Reproducibility of Chaos Simulation †
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 Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597239/
https://www.ncbi.nlm.nih.gov/pubmed/33286722
http://dx.doi.org/10.3390/e22090953
work_keys_str_mv AT nazarethalitae anoteonthereproducibilityofchaossimulation
AT nepomucenoeriveltong anoteonthereproducibilityofchaossimulation
AT martinssamiram anoteonthereproducibilityofchaossimulation
AT butusovdenisn anoteonthereproducibilityofchaossimulation
AT nazarethalitae noteonthereproducibilityofchaossimulation
AT nepomucenoeriveltong noteonthereproducibilityofchaossimulation
AT martinssamiram noteonthereproducibilityofchaossimulation
AT butusovdenisn noteonthereproducibilityofchaossimulation