Enhanced box and prism assisted algorithms for computing the correlation dimension
Alfonso Bueno-Orovio and
Víctor M. Pérez-García
Chaos, Solitons & Fractals, 2007, vol. 34, issue 2, 509-518
Abstract:
Box-assisted and prism-assisted algorithms are among the most popular algorithms for the computation of the correlation dimension. However, the box size is usually determined by authors just through rough estimates or even by trial and error. In this paper, an explicit criterion for the selection of the optimal box size in box-assisted algorithms is presented. When used in conjunction with even the simplest box-assisted algorithm, the computation time needed to estimate the correlation integral is drastically reduced. These reductions range from a factor of 10 to factors larger than 1000, depending on the complexity of the attractor and/or the length of the dataset.
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077906002645
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:34:y:2007:i:2:p:509-518
DOI: 10.1016/j.chaos.2006.03.043
Access Statistics for this article
Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros
More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().