Sampling chaotic trajectories quickly in parallel

DOI10.1023/A:1020431119088zbMath1031.65144arXivnlin/0202056OpenAlexW1600931926MaRDI QIDQ1850909

Jonathan Machta

Publication date: 15 December 2002

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/nlin/0202056

zbMATH Keywords

computational complexitypath samplingchaotic dynamicsparallel complexityquadratic map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Approximate trajectories (pseudotrajectories, shadowing, etc.) in smooth dynamics (37C50) Numerical chaos (65P20)

Related Items (1)

Natural complexity, computational complexity and depth

This page was built for publication: Sampling chaotic trajectories quickly in parallel