Computing the multifractal spectrum from time series: An algorithmic approach

Harikrishnan, K. P. ; Misra, R. ; Ambika, G. ; Amritkar, R. E. (2009) Computing the multifractal spectrum from time series: An algorithmic approach Chaos, 19 (4). 043129_1-043129_9. ISSN 1054-1500

[img]
Preview
PDF - Publisher Version
717Kb

Official URL: http://chaos.aip.org/chaoeh/v19/i4/p043129_s1?isAu...

Related URL: http://dx.doi.org/10.1063/1.3273187

Abstract

We show that the existing methods for computing the f(α) spectrum from a time series can be improved by using a new algorithmic scheme. The scheme relies on the basic idea that the smooth convex profile of a typical f(α) spectrum can be fitted with an analytic function involving a set of four independent parameters. While the standard existing schemes [ P. Grassberger et al., J. Stat. Phys. 51, 135 (1988) ; A. Chhabra and R. V. Jensen, Phys. Rev. Lett. 62, 1327 (1989) ] generally compute only an incomplete f(α) spectrum (usually the top portion), we show that this can be overcome by an algorithmic approach, which is automated to compute the Dq and f(α) spectra from a time series for any embedding dimension. The scheme is first tested with the logistic attractor with known f(α) curve and subsequently applied to higher-dimensional cases. We also show that the scheme can be effectively adapted for analyzing practical time series involving noise, with examples from two widely different real world systems. Moreover, some preliminary results indicating that the set of four independent parameters may be used as diagnostic measures are also included.

Item Type:Article
Source:Copyright of this article belongs to American Institute of Physics.
ID Code:503
Deposited On:21 Sep 2010 15:52
Last Modified:12 May 2011 10:10

Repository Staff Only: item control page