pith. sign in

arxiv: 1707.09264 · v1 · pith:5VJL5SAEnew · submitted 2017-07-28 · 🧮 math.DS · math.NA· nlin.CD

Projected Shadowing-based Data Assimilation

classification 🧮 math.DS math.NAnlin.CD
keywords techniquesassimilationdatamethodcomputationaldependentlorenzsubspace
0
0 comments X
read the original abstract

In this article we develop algorithms for data assimilation based upon a computational time dependent stable/unstable splitting. Our particular method is based upon shadowing refinement and synchronization techniques and is motivated by work on Assimilation in the Unstable Subspace (AUS) and Pseudo-orbit Data Assimilation (PDA). The algorithm utilizes time dependent projections onto the non-stable subspace determined by employing computational techniques for Lyapunov exponents/vectors. The method is extended to parameter estimation without changing the problem dynamics and we address techniques for adapting the method when (as is commonly the case) observations are not available in the full model state space. We use a combination of analysis and numerical experiments (with the Lorenz 63 and Lorenz 96 models) to illustrate the efficacy of the techniques and show that the results compare favorably with other variational techniques.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.