Topological Approach for Data Assimilation

Max M. Chumley, Firas A. Khasawneh
11/12/2024
nlin.CDcs.LGmath.AT

No confident code implementation found for this paper.

Abstract

Many dynamical systems are difficult or impossible to model using high fidelity physics based models. Consequently, researchers are relying more on data driven models to make predictions and forecasts. Based on limited training data, machine learning models often deviate from the true system states over time and need to be continually updated as new measurements are taken using data assimilation. Classical data assimilation algorithms typically require knowledge of the measurement noise statistics which may be unknown. In this paper, we introduce a new data assimilation algorithm with a foundation in topological data analysis. By leveraging the differentiability of functions of persistence, gradient descent optimization is used to minimize topological differences between measurements and forecast predictions by tuning data driven model coefficients without using noise information from the measurements. We describe the method and focus on its capabilities performance using the chaotic Lorenz 63 system as an example and we also show that the method works on a higher dimensional example with the Lorenz 96 system.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chumley2024topological,
  title  = {Topological Approach for Data Assimilation},
  author = {Max M. Chumley and Firas A. Khasawneh},
  year   = {2024},
  eprint = {2411.18627},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.18627v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.18627.svg)](https://codeofpaper.com/paper/2411.18627)

Discussion