Motivated by the presence of a finite number of determining parameters (degrees of freedom) such as modes, nodes and local spatial averages for dissipative dynamical systems, we present here a continuous data assimilation algorithm for three-dimensional viscous hydrodynamic models. However, to validate the convergence of this algorithm our proofs require the existence of uniform global bounds on the gradients of the solutions of the underlying system in terms of certain combinations of the physical parameters (such as kinematic viscosity, the size of the domain and the forcing term). Therefore our proofs cannot be applied to the three-dimensional Navier–Stokes equations; instead we demonstrate the implementation of this algorithm, for instance, in the context of the three-dimensional Navier–Stokes-α equations. This algorithm consists of introducing a nudging process through a general type of approximation interpolation operator (which is constructed from observational measurements) that synchronizes the large spatial scales of the approximate solutions with those of unknown solutions of the Navier–Stokes-α equations corresponding to these measurements. Our main result provides conditions on the finite-dimensional spatial resolution of the collected data, sufficient to guarantee that the approximating solution, which is obtained from this collected data, converges to the unknown reference solution over time. These conditions are given in terms of the physical parameters.
The method of inserting observational measurements obtained from some physical system into the theoretical model of this system, as the latter is being integrated in time, is called continuous data assimilation. It was first proposed in [7] for atmospheric predictions, such as weather forecasting. In general, producing accurate information of the true state of the atmosphere or a fluid at a given time is not possible, because the observational measurements are given with low spatial and/or temporal resolution. Let us be more precise. We assume that we have, available, discrete spatial measurements, continuously in time, of an exact reference solution to a given model, while the solution itself is unknown. This is the case, for instance, with weather prediction, where data is collected at weather stations spread over a discrete spatial grid, nearly continuously in time. One then tries to integrate (or assimilate) the data into said model, which is being continuously integrated in time. In the notation used here, represents the collected measurements at discrete spatial points; our purpose in this work is to present an algorithm to recover the exact solution u, of the three-dimensional Navier–Stokes-α equations, from these measurements.
In order to obtain a good asymptotic approximation of the reference solution , the classical method of continuous data assimilation requires to separate the coarse mesh (low Fourier modes) and the fine mesh (high Fourier modes) parts of the solution, before inserting the measured data into the model. An application of this method of separation for 2D Navier–Stokes equations is given in [20], where the authors computed an approximation of the evolution of the fine part (high Fourier modes) of the solution, using an initial guess of the high Fourier modes of the exact solution. The results in [20] were limited to the 2D Navier–Stokes equations since the rigorous justification of this approach requires the global regularity of solutions to the underlying system, which is a major open problem for the 3D Navier–Stokes equations. However, this same technique was implemented later in [17] to the 3D Navier–Stokes-α model, where global regularity is guaranteed.
In this work we aim to extend the validity of the data assimilation algorithm developed in [1], for the two-dimensional Navier–Stokes equations, to three-dimensional viscous hydrodynamic models. Our proofs, however, require the global regularity, together with the existence of uniform global bounds on the gradients of the solutions, of the underlying system in terms of certain combinations of the physical parameters (such as kinematic viscosity, the size of the domain and the forcing term). Hence, our proofs are not applicable to the three-dimensional Navier–Stokes equations; instead we demonstrate the validity of the algorithm, for instance, in the context of the three-dimensional Navier–Stokes-α equations. One of the advantages of the algorithm presented in [1], and being examined in this work, is that the initial data of the approximate solution can be chosen to be arbitrary. However, the main leverage of this approach, over other continuous data assimilation algorithms, is that the observational measurements are directly inserted into the model in a way that overcomes the difficulties coming from the fact that the discrete observations may not be elements of a suitable space of solutions, for instance. In particular, there is no need to separate the evolution of the coarse mesh scales from the fine mesh scales. Of specific interest to us is to establish sufficient conditions on the spatial resolution of the observational data, and on the relaxation (nudging) parameter , in terms of the physical parameters of the underlying system, that will guarantee the existence of an approximate solution of the reference solution over time.
Suppose that the evolution of u is governed by the three-dimensional Navier–Stokes-α equations (cf. [9]), subject to periodic boundary conditions, on :
on the interval , where the initial data is unknown. Here represents the velocity of the fluid, called the filtered velocity, and ; is a scale parameter with dimension of length. Above, p is a scalar, the pressure, and f is a body force which is assumed, for simplicity, to be time-independent.
Let represent the observational measurements at a spatial resolution of size h, for . The algorithm we use to construct an approximation of from the measured data consists in solving
with , while is chosen to be arbitrary, yet in a suitable space.
This method requires that the observational measurements be given as linear interpolant observables satisfying either and, for some constant ,
or and, for some constant ,
One example of an interpolant operator satisfying (1.2) and two examples of interpolant operators satisfying (1.3) are given in Section 4. Motivated by the fact that dissipative evolution equations posses finitely many determining parameters (degrees of freedom) these examples of interpolant operators include determining modes (see [12,16,20,21]), determining nodes (see [13,14,16]), determining finite volume elements (see [14–16]) and finite-elements method (cf. [4], and references therein).
Recently, similar ideas to the data assimilation algorithms introduced in [20] and [1] have been implemented in [10,11] to show that the long-time dynamics of the two-dimensional Navier–Stokes equations can be imbedded in an infinite-dimensional dynamical system that is induced by an ordinary differential equation in appropriate Banach space, named determining form, which is governed by a globally Lipschitz vector field. In particular, it is shown in [11] that solutions of the determining form converge to one of its steady states, and that there is one-to-one correspondence between these steady states and the trajectories on the global attractor of the Navier–Stokes equations. Moreover, it is worth mentioning that the method of data assimilation studied here can be equally applied for designing signal synchronization algorithms in the spirit of [6] and references therein. Furthermore, we observe that most recently the data assimilation algorithm that was introduced in [1] has been extended in [3] to cover the case where the observational measurements are contaminated with stochastic random errors. The ideas from [1] have, very recently and after the completion of this work, also been applied to the 3D Bénard convection in porous medium using only temperature measurements, see [8], as well as to the 3D Brinkman–Forchheimer-extended Darcy model of porous media, see [19].
In this paper, apply this new data assimilation algorithm [1] to the 3D Navier–Stokes-α model, in the absence of measurement errors. The paper is organized as follows: first, we recall the functional setting of three-dimensional Navier–Stokes-α equations needed to develop our method of continuous data assimilation. Subsequently, we present this method and the results of well-posedness for the new data assimilation equations. Later, in Section 3, we state and prove our main result, in which we give conditions under which the approximate solutions, obtained by this algorithm, converge to the solution of NS-α equations. Finally, in Section 4, we present some examples of interpolant operators.
Preliminaries and results
In this section, we review some basic facts and the functional setting of the three-dimensional Navier–Stokes-α equations that will be used in this paper.
Let be a periodic box, for some fixed. We denote by the set of all vector valued trigonometric polynomials defined in Ω, which are divergence-free and have average zero. Denote also by H and V the closure of in the and , respectively. The spaces H and V are Hilbert spaces with inner products given by
respectively. Denote the norms of H and V by
If , then we set .
We denote the Leray projector, and by the Stokes operator, with domain . In the case of periodic boundary conditions, . The Stokes operator is a self-adjoint positive operator, whose inverse is a compact operator in H. Hence there exists a complete orthonormal set of eigenfunctions , such that and . Let us denote the first eigenvalue, i.e., . We have the following versions of Poincaré inequalities: for all and ,
Following the classical notation for Navier–Stokes equations, for every , we write . The bilinear operator B can be extended continuously from with values in . Similarly, for every , let us denote by . The operator can be extended continuously from with values in , and from with values in . In particular satisfies the following properties (see [9]):
For every , and ,
Also, for every , and , we have
In addition, for every , and ,
The positive constants denoted by , and are scale-invariant. Furthermore, for every ,
and in particular, for every ,
With the above notation, we write the incompressible three-dimensional Navier–Stokes-α (NS-α) in functional form as
with , and initial condition . We assume is time independent so that . Equation (2.6) is globally well-posed, as shown in [9]:
(Global existence and uniqueness for NS-α).
Letand. Then for any, system (2.6) has a unique regular solution that satisfies:
We state now estimates of the solutions u of (2.6) that will be needed later in our analysis. These estimates appear in [9], in the proof of Theorem 1.
Fix. Let G be the Grashoff numberand suppose that u is the solution given by Theorem1. Then there exists a time, which depends on, such that forwe haveMoreover,
We present now the continuous data assimilation algorithm for the incompressible three-dimensional NS-α equations. Let u be a regular solution of (2.6) given by Theorem 1 and let be a finite rank interpolation operator satisfying either (1.2) or (1.3). Our aim is to recover u from observational measurements , that have been measured for times . The approximating solutions w with initial condition , chosen arbitrarily, will be given by the solutions of the system
on the interval . Using the Leray projector, the above system is equivalent to
Furthermore, inequalities (1.2) and (1.3) imply
for all and
for . We will present later specific examples of (see also [1]).
Suppose. Thenand.
If , by the Helmholtz decomposition (see [2]), there exists a unique and such that , with div and . Moreover, we also have , and it follows that . Since , we conclude that . On the other hand,
and consequently,
This also implies that
as desired. □
Using Lemma 1, system (2.10) is equivalent to
on the interval , with .
Next, we show that the data assimilation equations (2.14) are well-posed for both cases of interpolant operators : those satisfying (2.11) and those satisfying (2.12).
Let,andbe given. Suppose thatsatisfies (1.2)(and hence (2.11)) and that, whereis the constant given in (2.11). Let u be the solution of NS-α equations with initial data, ensured by Theorem1. Then the continuous data assimilation algorithm,(2.14), has a regular solution w that satisfiesfor any.
First note that system (2.14) is equivalent to
where . Define
Thanks to (2.11), then for all , we have
Since the Navier–Stokes-α solution satisfies , we conclude that . Moreover, we have
and therefore , i.e., there exists a constant M, that might depend on T, such that , for every .
The purpose now is to establish the global existence of solutions to (2.14). For that, we use the Faedo–Galerkin method. Let span, where . We denote by the orthogonal projection from H onto . Let satisfy the finite-dimensional Faedo–Galerkin system of ordinary differential equations:
with . Since system (2.18) has a quadratic non-linearity, therefore it is locally Lipschitz and as a result it has a unique short time solution. The next step is to prove that the solution is uniformly bounded in time and m; and thereby we shall ensure the global existence in time of for all m.
Denote by the maximal interval of existence for (2.18). Our goal is to show that . Focusing on , and taking the inner product of (2.18) with we have
Using the fact that is self-adjoint and property (2.5), we obtain
By Young’s inequality,
Now we establish uniform estimates in m for the derivatives and . Returning to equation
and we shall estimate in . Note that by (2.2),
Consequently, and thanks to (2.23) and (2.25), we have
To estimate the right-hand side of (2.27), we use the fact that and so . Moreover, we have the two following estimates:
Therefore, we conclude that
for some and .
Using the Aubin–Lions Compactness theorem (see, e.g., [5,18,22]) and the Banach–Alaoglu theorem, we conclude that there exists a subsequence , that we denote with the same label such that
and equivalently,
Using the same steps of Theorem 1 from [9], one can show that the limit functions w and z satisfy (2.16), and therefore (2.10).
We show next the continuous dependence on initial data of the solutions, and as a consequence, the uniqueness of the solution. Let w and be two solutions of (2.10) on the interval , with initial data and , respectively. Denote and . Denoting , we have
Using that , and the fact that (2.9) holds in , we take the action of (2.32) with θ and obtain
In the same way as was done in Theorem 2, we estimate the following terms using Young’s inequality and the condition :
Similarly,
where we used the assumption . Thus, from (2.32)–(2.34),
To estimate the right-hand side of (2.35), we use (2.3), and Young’s inequality to get
Using Poincaré’s inequality, as well as Young’s inequality again, it follows that
so we conclude the following estimate:
Therefore, from above and (2.35) we have
By Grönwall’s inequality on the interval , we obtain
Since , the above inequality implies the continuous dependence of the regular solution on the initial data, and in particular the uniqueness of a regular solution. □
For the case when is satisfying (2.12), we have the following result of well-posedness:
Let,andbe given. Suppose thatsatisfies (1.3)(and hence (2.12)) and h is small enough such that the two conditions below are valid:andwhereis the constant given in (2.12) and. Consider u the solution of NS-α equations with initial data, ensured by Theorem1. Then the continuous data assimilation algorithm equations,(2.14), have a regular solution w that satisfiesfor any.
The proof is similar to the proof of Theorem 2. We start from inequality (2.19) by changing the way of using Young’s inequality:
Therefore, the above implies
From here on, the proof follows similarly the steps of the proof of Theorem 2, from inequality (2.21) on. □
The convergence theorems
We derive now conditions on μ and h in terms of physical parameters, such as G and ν, to guarantee the convergence, as , of the difference to zero, where u is the solution of NS-α equations (ensured by Theorem 1) and w solves (2.14). To do this, we first recall the following generalized Grönwall inequality, that can be found in [15].
(Uniform Grönwall’s inequality).
Letbe fixed, ψ and β be locally integrable real valued functions on, satisfying the following conditions:where. Furthermore, assume thatwhere. Suppose that ξ is an absolutely continuous non-negative function on, such thatalmost everywhere on. Thenexponentially, as.
Our main result states.
Let u be a solution of the incompressible three-dimensional Navier–Stokes-α equations (2.6); and leta linear map satisfying (2.11). Assume that μ is large enough satisfyingwhereis the constant appearing in (2.3). Moreover, assume that h small enough such thatwhereis the constant given on (2.11). Then, the global unique solution w of (2.14), given by Theorem2, satisfies, as, in theand-norms.
Considering u the solution of the Navier–Stokes-α equations and denoting , we have
Note that
Taking the action of (3.3) with δ and using (2.5), we obtain
Also, we have . Estimating the right-hand side terms of (3.4) using Young’s inequality,
Taking in Proposition 1, we have for (where is given in Proposition 1),
Therefore, to guarantee that , it is sufficient to require
which is given by assumption (3.1).
Finally, taking in Lemma 2, we conclude that
i.e., , in and -norms, exponentially in time, as . □
Note that Theorem 4 is valid for any arbitrary initial value of w, and this is the main advantage of this type of assimilation, because it overcomes the difficulty coming from the lack of information on the initial data of the reference solution.
We consider now the case where the interpolant operator satisfies the approximation property (2.12). Then we have the following theorem of convergence:
Let u be the solution of Navier–Stokes-α equations (2.6) andbe a linear interpolant operator satisfying (2.12). Suppose that μ is large enough satisfyingand h small enough such thatwhere. Then, the global unique solution w of (2.14), given by Theorem3, satisfies, as, in theand-norms.
The idea of the proof is the same as in Theorem 4, except for the fact that we need here to estimate and as follows:
By the assumption (3.14) we have and . Therefore, (3.14) implies
Furthermore, by Cauchy–Schwarz and Young inequalities, we have
Thanks to (3.14) we have, as a result, that , and hence
Consequently,
Therefore,
Using (3.8), together with (3.16) and (3.17) we obtain
As a result, it follows that
Using exactly the same calculations as in Theorem 4, we make use of Lemma 2 to conclude that for μ large enough satisfying (3.13) and h is small enough such that (3.14) holds, then
exponentially in time, which is the desired conclusion. □
Examples of interpolant operators
In this section we give some examples of interpolant operators satisfying the approximating identity inequalities (1.2) or (1.3). For two-dimensional cases, similar examples that will be considered here are found in [1].
It is a simple exercise of Fourier analysis to prove that the interpolant given by the projection onto the low Fourier modes with wave numbers k such that :
satisfies
Another example of an interpolant that satisfies the condition (4.1) is that given by volume elements, which is physically important and was studied in [15] in the context of 2D Navier–Stokes equations. We divide the periodic domain in , , where is the cube with edge , and so . Recalling that the local average of u in is defined as , we construct as follows:
where . Here we suppose that the average values of φ on each of the ’s is given. To prove that satisfies (4.1), we generalize the result obtained in [15] for the two-dimensional case : for all ,
where the domain has been divided into N squares with side , . Generalizing, we can prove that, in 3D,
for all . Using (4.3), we prove that
Next, we consider an interpolant operator , which is based on using measurements at a discrete set of nodal points in , and which satisfies
Indeed, similarly to what was done in the previous example of volume elements, to construct such an interpolant using nodal values we divide the domain Ω in N cubes of edge , for and thus , , where denote the jth cube and . We then regard arbitrary points that represent the points where observational measurements of the velocity of the flow are done.
Define this interpolant as
To prove that the interpolant above satisfies (4.4), we make use of the following two lemmas:
Letand x and z be two points of, where the third coordinates of x and z are the same, i.e.,and. Then for every, we have
Similarly, if y and z are two points insuch that the second coordinate of y and z are the same, i.e.,and, thenfor every.
We will show only the first estimate, and the second one is analogous. We begin by considering the square . For any two points in of the form and , with , we have
Since the third coordinate is fixed and the points and are in a plane parallel to the plane, we can apply Lemma 3 for , with d replaced with the maximal distance of the y-coordinate of the points , from the horizontal walls; i.e.,
and therefore
since . Then we have
By symmetry, we have the similar inequality for points of the form and , where :
Thus
and it follows that
Our aim is to obtain estimates in , where instead of . For this, we integrate (4.14) from 0 to l in z-coordinate:
Therefore,
i.e.,
and we have the desired conclusion. □
We are ready to prove that the interpolant constructed using measurements at nodal points satisfies (4.4):
For all, the interpolantdefined in (4.5) satisfieswhere.
Note that
Since , we have
Next, we find an estimate for
Consider for k fixed, but arbitrary. Choose such that z is in the line of the intersection of two planes: the plane which contains the point x and is parallel to -plane and the plane which contains the point and is parallel to the -plane in three-dimensions.
In other words, if x and are such that and , then . Therefore
Now me make use of Lemma 4, applying (4.8) for the difference and (4.9) for the difference :
where h is the edge of the cubes , i.e., . Then we conclude that
Therefore from (4.17) and (4.18), it follows that
Since for all , we obtain
and thus
□
Footnotes
Acknowledgements
E.S.T. is thankful to the kind hospitality of the Universidade Federal do Rio de Janeiro (UFRJ) and Instituto Nacional de Matemática Pura e Aplicada (IMPA) where part of this work was completed. The work of H.J.N.L. is supported in part by CNPq grant #306331/2010-1 and FAPERJ grant #E-26/103.197/2012. The work of E.S.T. is supported in part by the NSF grants DMS-1009950, DMS-1109640 and DMS-1109645, as well as by the CNPq-CsF grant #401615/2012-0, through the program Ciência sem Fronteiras.
References
1.
A.Azouani, E.Olson and E.S.Titi, Continuous data assimilation using general interpolant observables, Journal of Nonlinear Science24(2) (2014), 277–304.
2.
A.L.Bertozzi and A.J.Majda, Vorticity and Incompressible Flow, Vol. 27, Cambridge University Press, 2002.
3.
H.Bessaih, E.Olson and E.S.Titi, Continuous assimilation of data with stochastic noise, Nonlinearity28 (2015), 729–753.
4.
B.Cockburn, D.Jones and E.S.Titi, Estimating the number of asymptotic degrees of freedom for nonlinear dissipative systems, Mathematics of Computation66 (1997), 1073–1087.
5.
P.Constantin and C.Foias, Navier–Stokes Equations, University of Chicago Press, 1988.
6.
K.M.Cuomo, A.V.Oppenheim and S.H.Strogatz, Robustness and signal recovery in a synchronized chaotic system, Internation Journal of Bifurcation and Chaos3(6) (1993), 1629–1638.
7.
R.Daley, Atmospheric Data Analysis, Cambridge Atmospheric and Space Science Series, Cambridge University Press, 1991.
8.
A.Farhat, E.Lunasin and E.S.Titi, Data assimilation algorithm for 3D Bénard convection in porous media employing only temperature measurements, Journal of Mathematical Analysis and Applications, to appear, available at: arXiv:1506.08678.
9.
C.Foias, D.D.Holm and E.S.Titi, The three dimensional viscous Camassa–Holm equations and their relation to the Navier–Stokes equations and turbulence theory, Journal of Dynamics and Differential Equations14(1) (2002), 1–33.
10.
C.Foias, M.Jolly, R.Kravchenko and E.S.Titi, A determining form for the 2D Navier–Stokes equations – the Fourier modes case, Journal of Mathematical Physics53 (2012), 115623.
11.
C.Foias, M.Jolly, R.Kravchenko and E.S.Titi, A unified approach to determining forms for the 2D Navier–Stokes equations – the general interpolants case, Uspekhi Matematicheskikh Nauk69(2) (2014), 177–200, also Russian Mathematical Surveys69(2) (2014), 359–381.
12.
C.Foias and G.Prodi, Sur le comportement global des solutions non-stationnaires des équations de Navier–Stokes en dimension 2, Rend. Sem. Mat. Univ. Padova39 (1967), 1–34.
13.
C.Foias and R.Temam, Determination of the solutions of the Navier–Stokes equations by a set of nodal values, Mathematics of Computation43(167) (1984), 117–133.
14.
C.Foias and E.S.Titi, Determining nodes, finite difference schemes and inertial manifolds, Nonlinearity4(1) (1991), 135–153.
15.
D.A.Jones and E.S.Titi, Determining finite volume elements for the 2D Navier–Stokes equations, Physica D60 (1992), 165–174.
16.
D.A.Jones and E.S.Titi, Upper bounds on the number of determining modes, nodes and volume elements for the Navier–Stokes equations, Indiana University Mathematics Journal42(3) (1993), 875–887.
17.
P.Korn, Data assimilation for the Navier–Stokes-α equations, Physica D238(18) (2009), 1957–1974.
18.
J.L.Lions, Quelque Méthodes de Résolutions des Problèmes aux Limites Non-Linéares, Dunod, Paris, 1969.
19.
P.Markowich, E.S.Titi and S.Trabelsi, Continuous data assimilation for the three-dimensional Brinkman–Forchheimer-extended Darcy model, Nonlinearity, to appear, available at: arXiv:1502.00964.
20.
E.Olson and E.S.Titi, Determining modes for continuous data assimilation in 2D turbulence, Journal of Statistical Physics113(5–6) (2003), 799–840.
21.
E.Olson and E.S.Titi, Determining modes and Grashoff number in 2D turbulence, Theoretical and Computational Fluid Dynamics22(5) (2008), 327–339.
22.
R.Temam, Navier–Stokes Equations: Theory and Numerical Analysis, American Mathematical Society, 1984.