Sampling Chaotic Trajectories Quickly in Parallel

Details Sampling Chaotic Trajectories Quickly in Parallel Sampling Chaotic Trajectories Quickly in Parallel

2002-02-25

arxiv.org/abs/nlin/0202056v1

J. Stat. Phys. 109, 863-873 (2002)

Nonlinear Sciences

Chaotic Dynamics

12 pages, 2 figures

Scientific paper

The parallel computational complexity of the quadratic map is studied. A parallel algorithm is described that generates typical pseudotrajectories of length t in a time that scales as log t and increases slowly in the accuracy demanded of the pseudotrajectory. Long pseudotrajectories are created in parallel by putting together many short pseudotrajectories; Monte Carlo procedures are used to eliminate the discontinuities between these short pseudotrajectories and then suitably randomize the resulting long pseudotrajectory. Numerical simulations are presented that show the scaling properties of the parallel algorithm. The existence of the fast parallel algorithm provides a way to formalize the intuitive notion that chaotic systems do not generate complex histories.

Affiliated with

Also associated with

No associations

Rating

Sampling Chaotic Trajectories Quickly in Parallel 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 Sampling Chaotic Trajectories Quickly in Parallel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling Chaotic Trajectories Quickly in Parallel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358978