Comparing Deterministic and Stochastic Parameter Recovery Algorithms Applied to Chaotic Systems
Abstract
This paper explores the effectiveness of various novel deterministic and traditional stochastic data assimilation (DA) and parameter recovery (PR) algorithms given noisy data from chaotic systems. We use semi-analytic methods to numerically construct synthetic data from the Lorenz '63 and multiscale Lorenz '96 chaotic dynamical systems, adding white noise. Our findings show that, for different noise levels, deterministic PR algorithms paired with deterministic DA algorithms are shown computationally to be overall more accurate and stable than stochastic PR algorithms. Additionally, deterministic PR methods have demonstrated greater speed and efficiency, requiring less computational power than stochastic PR methods. This suggests that future work should consider exploring the full potential of deterministic PR algorithms in the presence of noise.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.