A linearization based non-iterative approach to measure the gaussian noise level for chaotic time series
Gürsan Çoban,
Ali H. Büyüklü and
Atin Das
Chaos, Solitons & Fractals, 2012, vol. 45, issue 3, 266-278
Abstract:
In this work we propose a non-iterative method to determine the noise level of chaotic time series. For this purpose, we use the gaussian noise functional derived by Schreiber in 1993. It is shown that the noise function could be approximated by a stretched exponential decay form. The decay function is then used to construct a linear least squares approach where global solution exists. We have developed a software basis to calculate the noise level which is based on TISEAN algorithms. A practical way to exclude the outlying observations for small length scales has been proposed to prevent estimation bias. The algorithm is tested on well known chaotic systems including Henon, Ikeda map and Lorenz, Rössler, Chua flow data. Although the results of the algorithm obtained from simulated discrete dynamics are not satisfactory, we have shown that it performs well on flow data even for extreme level of noise. The results that are obtained from the real world financial and biomedical time series have been interpreted.
Date: 2012
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/S0960077911002281
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:45:y:2012:i:3:p:266-278
DOI: 10.1016/j.chaos.2011.10.011
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. ().