Box-counting algorithm and dimensional analysis of a pulsar

Details Box-counting algorithm and dimensional analysis of a pulsar Box-counting algorithm and dimensional analysis of a pulsar

Apr 1992

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1992jcoph..99..196l&link_type=abstract

Journal of Computational Physics (ISSN 0021-9991), vol. 99, April 1992, p. 196-202.

Statistics

Computation

3

Chaos, Computational Astrophysics, Pulsars, Strange Attractors, Correlation, Lorentz Transformations, Time Series Analysis

Scientific paper

The superiority of the box-counting algorithm to the Grassberger-Procaccia (1983) correlation-integral algorithm, in dealing with an experimental data set, is presently demonstrated in view of the results obtained for three classical cases: the logistic map, the Henon map, and the Lorenz equation. Attention is given to the further illustrative case of pulsar intensity data, which is revealed to possess a least-embedding dimension of 14 and a correlation dimension of approximately 5. Box-counting requires very little computation time.

Affiliated with

Also associated with

No associations

Rating

Box-counting algorithm and dimensional analysis of a pulsar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Box-counting algorithm and dimensional analysis of a pulsar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Box-counting algorithm and dimensional analysis of a pulsar will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1737585