Comparison of two data assimilation algorithms for shallow water flows

13Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

This article presents the comparison of two algorithms for data assimilation of two dimensional shallow water flows. The first algorithm is based on a linearization of the model equations and a quadratic programming (QP) formulation of the problem. The second algorithm uses Ensemble Kalman Filtering (EnKF) applied to the non-linear two dimensional shallow water equations. The two methods are implemented on a scenario in which boundary conditions and Lagrangian measurements are available. The performance of the methods is evaluated using twin experiments with experimentally measured bathymetry data and boundary conditions from a river located in the Sacramento Delta. The sensitivity of the algorithms to the number of drifters, low or high discharge and time sampling frequency is studied. © American Institute of Mathematical Sciences.

Cite

CITATION STYLE

APA

Strub, I. S., Percelay, J., Tossavainen, O. P., & Bayen, A. M. (2009). Comparison of two data assimilation algorithms for shallow water flows. Networks and Heterogeneous Media, 4(2), 409–430. https://doi.org/10.3934/nhm.2009.4.409

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free