اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Back and Forth Nudging algorithm for data assimilation problems: theoretical results on transport equations
139
0
0.0
(
0
)
تأليف
Didier Auroux
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm. We show that for non viscous equations (both linear transport and Burgers), the convergence of the algorithm holds under observability conditions. Convergence can also be proven for viscous linear transport equations under some strong hypothesis, but not for viscous Burgers equation. Moreover, the convergence rate is always exponential in time. We also notice that the forward and backward system of equations is well posed when no nudging term is considered.
قيم البحث
اقرأ أيضاً
We develop a physics-informed machine learning approach for large-scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two-dimensional steady-state subsurface flow model of the Hanford
Site given synthetic measurements of said variables. In our approach, we extend the physics-informed conditional Karhunen-Lo{e}ve expansion (PICKLE) method for modeling subsurface flow with unknown flux (Neumann) and varying head (Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large-scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen-Lo{e}ve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as $N_{FV}^{1.15}$) with the number of grid points $N_{FV}$, while that of MAP increases much faster as $N_{FV}^{3.28}$. We demonstrated that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).
In this paper we develop general formulas for the subdifferential of the pointwise supremum of convex functions, which cover and unify both the compact continuous and the non-compact non-continuous settings. From the non-continuous to the continuous
setting, we proceed by a compactification-based approach which leads us to problems having compact index sets and upper semi-continuously indexed mappings, giving rise to new characterizations of the subdifferential of the supremum by means of upper semicontinuous regularized functions and an enlarged compact index set. In the opposite sense, we rewrite the subdifferential of these new regularized functions by using the original data, also leading us to new results on the subdifferential of the supremum. We give two applications in the last section, the first one concerning the nonconvex Fenchel duality, and the second one establishing Fritz-John and KKT conditions in convex semi-infinite programming.
In this paper, we are interested in the estimation of Particle Size Distributions (PSDs) during a batch crystallization process in which particles of two different shapes coexist and evolve simultaneously. The PSDs are estimated thanks to a measureme
nt of an apparent Chord Length Distribution (CLD), a measure that we model for crystals of spheroidal shape. Our main result is to prove the approximate observability of the infinite-dimensional system in any positive time. Under this observability condition, we are able to apply a Back and Forth Nudging (BFN) algorithm to reconstruct the PSD.
This paper considers a nudging-based scheme for data assimilation for the two-dimensional (2D) Navier-Stokes equations (NSE) with periodic boundary conditions and studies the synchronization of the signal produced by this algorithm with the true sign
al, to which the observations correspond, in all higher-order Sobolev topologies. This work complements previous results in the literature where conditions were identified under which synchronization is guaranteed either with respect to only the $H^1$--topology, in the case of general observables, or to the analytic Gevrey topology, in the case of spectral observables. To accommodate the property of synchronization in the stronger topologies, the framework of general interpolant observable operators, originally introduced by Azouani, Olson, and Titi, is expanded to a far richer class of operators. A significant effort is dedicated to the development of this more expanded framework, specifically, their basic approximation properties, the identification of subclasses of such operators relevant to obtaining synchronization, as well as the detailed relation between the structure of these operators and the system regarding the syncrhonization property. One of the main features of this framework is its mesh-free aspect, which allows the observational data itself to dictate the subdivision of the domain. Lastly, estimates for the radius of the absorbing ball of the 2D NSE in all higher-order Sobolev norms are obtained, thus properly generalizing previously known bounds; such estimates are required for establishing the synchronization property of the algorithm in the higher-order topologies.
Observability inequalities on lattice points are established for non-negative solutions of the heat equation with potentials in the whole space. As applications, some controllability results of heat equations are derived by the above-mentioned observability inequalities.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
