Abstract

For the primitive equations of large-scale atmosphere and ocean dynamics, we study the problem of determining by means of a variational data assimilation algorithm initial conditions that generate strong solutions which minimize the distance to a given set of time-distributed observations. We suggest a modification of the adjoint algorithm whose novel elements is to use norms in the variational cost functional that reflects the H^1-regularity of strong solutions of the primitive equations. For such a cost functional, we prove the existence of minima and a first-order adjoint condition for strong solutions that provides the basis for computing these minima. We prove the local convergence of a gradient-based descent algorithm to optimal initial conditions using the second-order adjoint primitive equations. The algorithmic modifications due to the H^1-norms are straightforwardly to implement into a variational algorithm that employs the standard L^2-metrics.

Highlights

  • Data assimilation is a computational technique that aims at blending a dynamical model of a physical process with observational data of this process while at the same time preserving the integrity of the model and making optimal use of the observa

  • Results that are similar in spirit to our work can be found in Agoshkov and Ipatova (2007), where a variational algorithm was analyzed that uses observations of sea surface temperature and of sea surface elevation to determining the control variables of heat flux and water flux that occur in the surface boundary conditions of the oceanic primitive equations

  • In our work here, the goal is not to introduce a regularization of the data assimilation problem but to demonstrate that optimal initial conditions for strong solutions of the primitive equations assimilation problem necessitates the use of H1norms

Read more

Summary

56 Page 2 of 53

Journal of Nonlinear Science (2021) 31:56 tional information. It constitutes a fundamental technique for modeling real-world phenomena. In our work here, the goal is not to introduce a regularization of the data assimilation problem but to demonstrate that optimal initial conditions for strong solutions of the primitive equations assimilation problem necessitates the use of H1norms. We refer to this property as strong solvability of the data assimilation problem. The new and fundamental but decisive element in the suggested formulation of the data assimilation algorithm is to use in the cost functional metrics that are tailored to the regularity of the primitive equations. This paper describes for the primitive equations the consequences of such a choice

The Primitive Equations
56 Page 4 of 53
The Data Assimilation Problem
56 Page 6 of 53
Overview of Results
Functional Analytic Setup
56 Page 10 of 53
Linearized Equations and Differentiability
56 Page 12 of 53
Adjoint Primitive Equations and Duality Relation
56 Page 18 of 53
Existence of Local Minima of the Data Assimilation Problem
56 Page 20 of 53
56 Page 22 of 53
56 Page 24 of 53
Adjoint Characterization of Local Minima
56 Page 26 of 53
Convergence of Gradient-Based Descent Algorithm
56 Page 30 of 53
56 Page 34 of 53
56 Page 36 of 53
56 Page 38 of 53
56 Page 40 of 53
56 Page 42 of 53
56 Page 44 of 53
56 Page 46 of 53
56 Page 48 of 53
56 Page 50 of 53
56 Page 52 of 53
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call