Abstract
The authors consider a simple transport equation in one-dimensional space and the linearized shallow water equations in two-dimensional space, and describe and implement a multilevel finite-volume discretization in the context of the utilization of the incremental unknowns. The numerical stability of the method is proved in both cases.
Project supported by the National Science Foundation (Nos. DMS 0906440, DMS 1206438) and the Research Fund of Indiana University.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
Mathematics Subject Classification
1 Introduction
This article is closely related to and complements the article (see [1]), in which the authors implemented multilevel finite-volume discretizations of the shallow water equations in two-dimensional space, as a model for geophysical flows. The geophysical context is presented in [1] as well as practical issues concerning the implementation. In this article, we recall the motivation, present the algorithm, and discuss the numerical analysis of some variations of the algorithm, and in particular the stability in time.
The shallow water equations are a simplified model of the primitive equations (or PEs for short) of the atmosphere and the oceans. As shown in [20, 24], in rectangular geometry, the PEs can be expanded by using a certain vertical modal decomposition. With such a decomposition, we obtain an infinite system of coupled equations, which resemble the shallow water equations. See [6, 7] for the actual numerical resolution of these coupled systems. However, it appears in these articles that the problems to be solved are very difficult (demanding), and performable numerical methods are needed to tackle more and more realistic problems. We turned to multilevel finite-volume methods in [1], finite-volume methods are desirable for the treatment of complicated geometrical domains such as the oceans, and multilevel methods of the incremental unknown type are useful for the implementation of multilevel methods. Such methods have been introduced in the context of the nonlinear Galerkin method in [18] (see also [19]), finite differences in [23], and spectral methods and turbulence in [8]. As continuation of [1], this article explores the finite-volume implementation of the incremental unknowns.
Considering to simplify a rectangular geometry, we divide the domain into cells of size Δx×Δy, which we regroup at the first level of increment, in cells of size 3Δx×3Δy. The unknowns on the small cells being the original unknowns, we introduce for the coarse cells suitably averaged values of the unknowns. The dynamic strategy, which may take many different forms (see [1, 8]), consists in solving alternatively the system for a number of time steps on the fine mesh grid and then for a number of time steps, the system considered on the coarse mesh during which the increments as defined below, remain frozen. This coarsening can be repeated once more considering cells of size 9Δx×9Δy, and possibly several times as the programming cost is repetitive and thus small, but we restrict ourselves in this article to one coarsening.
We have chosen to present the method for the shallow water (or SW for short) equations for the reasons mentioned above. We consider the SW equations without viscosity, linearized around a constant flow. The well-posedness of these linear hyperbolic equations has been established very recently (see [12]). We choose in this article one of many situations presented in [12], i.e., the fully supercritical case, since the boundary conditions depend on the nature of the flow (subcritical versus supercritical, subsonic versus supersonic). Other implementation of multilevel methods in geophysical fluid dynamics appear in [16]. See also [14, 15] for more developments on the primitive equations. Further developments along the lines of this work will appear in an article in [4].
Furthermore, some related results can be found in [2, 10, 11, 13, 17, 21, 25].
This article is organized as follows. We start in Sect. 2 with a simple model corresponding to a one-dimensional transport equation. We then proceed in Sect. 3 with the shallow water equation presenting first the equations (see Sect. 3.1), then the multilevel finite-volume discretization (see Sect. 3.2) and then the multilevel temporal discretization (see Sect. 3.3). In Sect. 4, we consider another related form of the algorithm. In Sects. 2 and 3, the algorithm on the coarse grid is the same as the algorithm on the fine grid (in space) with just a different spatial mesh. In this section, we consider another algorithm on which we started, where the spatial scheme on the coarse grid is obtained by averaging, in each coarse cell the equations for the corresponding fine cells. The study of the stability of the scheme in this case has not been completed yet. We present the analysis in one-dimensional space, for the simple transport equation (see Sect. 4.1) and for the one-dimensional linearized equation (see Sect. 4.2). The boundary condition is space periodicity and the stability analysis is conducted by the classical von Neumann method.
2 The One-Dimensional Case
We start with the one-dimensional space and consider the problem
for (x,t)∈(0,L)×(0,T), with the boundary condition
and the initial condition
We set \(\mathcal{M}=(0,L)\) and \(H=L^{2}(\mathcal{M})\), and also introduce the operator Au=u x with domain \(D(A)=\{ v\in H^{1}(\mathcal{M}),v(0)=0\}\). Then for f,f′∈L 1(0,T;H), u 0∈D(A), problem (2.1)–(2.3) possesses a unique solution u, such that
Our multilevel spatial discretization is presented in Sect. 2.1, while Sect. 2.2 deals with time and space discretization.
2.1 Multilevel Spatial Discretization
We consider, on the interval (0,L), 3N cells (k i )1≤i≤3N of uniform length Δx with 3NΔx=L. For i=0,…,3N, we set
so that
We also introduce the center of each cell,
The discrete unknowns are denoted by u i (1≤i≤3N), and u i is expected to be some approximation of the mean value of u over k i . Equation (2.1) integrated over the cell k i yields
Here the term \(u(x_{i+\frac{1}{2}},t)\) is approximated by u i (t) using an “upwind” scheme due to the direction of the characteristics for Eq. (2.1). Setting \(f_{i}(t)=\frac{1}{\Delta x}\int_{k_{i}}f(x,t){\rm d}x\), the upwind finite-volume discretization now reads
where we have set
These equations are supplemented with the initial condition
To rewrite the scheme in a more abstract form, we introduce the space V h (h=Δx) of step functions u h , which are constant on the intervals k i , i=0,…,3N with \(u_{h}|_{k_{i}}=u_{i}\) and u 0=0. Here to take into account the boundary condition, we have added the fictitious cell k 0=(−Δx,0). The discrete space V h is equipped with the norm induced by \(L^{2}(\mathcal{M})\), that is,
Next let us introduce the backward difference operator
Then (2.4) can be rewritten as
with \(f_{h}|_{k_{i}}=f_{i}\).
We now introduce a coarser mesh consisting of the intervals K l (1≤l≤N), with length 3Δx obtained asFootnote 1
Let (u i )1≤i≤3N still denote the approximation of u on the fine mesh (k i )1≤i≤3N . Then an approximation of u on the coarse mesh is given by
We introduce the incremental unknowns
for α=0,1,2, ℓ=1,…,N, so that
Remark 2.1
The definition of Z in (2.9) is at our disposal. In this case, Z are the order of Δx. For example, using Taylor’s formula, we obtain
We will discuss elsewhere other definitions of the incremental unknown Z, and in particular those of order Δx 2 considered in [1].
The unknowns on the fine grid are thus written as the sum of the coarse grid unknowns (U l )1≤l≤N and associated increments (Z i )1≤i≤3N .
With this in mind, we consider a coarse grid discretization of the equation similar to (2.4), that is,
with
and
Independent of the equation under consideration and the numerical scheme, let us make the following algebraic observation: for u h ∈V h , u h =(u i )1≤i≤3N , we have
In some sense, because of (2.10), the coarse component U and the increment Z are L 2-orthogonal.
2.2 Euler Implicit Time Discretization and Estimates
We define a time step Δt with N T Δt=T, and set t n =nΔt for 0≤n≤N T . We denote by \(\{ u_{i}^{n}, 1\leq i\leq3N,0\leq n\leq N_{T}\}\) the discrete unknowns. The value \(u_{i}^{n}\) is an expected approximation
Our spatial discretization was presented in the previous section in (2.4)–(2.6), for the fine grid, and (2.11)–(2.14) for the coarse grid. We now discretize this equation in time by using the implicit Euler scheme with the time step \(\frac{\Delta t}{p}\) on the fine mesh and time step Δt on the coarse mesh. More precisely, let p>1 and q>1 be two fixed integers. The multi-step discretization consists in alternating p steps on (2.4) with time step \(\frac{\Delta t}{p}\), from t n to t n+1 and then q steps on (2.11) with time step Δt, the incremental unknowns Z i being frozen at t n+1 from t n+1 to t n+q+1. Then, using equations (2.9), we can go back to the finer mesh for p steps from t n+q+1 to t n+q+2. For simplicity, we suppose that N T is a multiple of q+1, and set \(N_{q}=\frac{N_{T}}{q+1}\).
Suppose that n is a multiple of (q+1), and the \((u_{i}^{n})_{1\leq i \leq3N}\) are known. We introduce the discrete unknowns \(u_{i}^{n+\frac{s}{p}}\) with \(t_{n+\frac{s}{p}}=t_{n}+s\frac{\Delta t}{p}\) for 0≤s≤p and 1≤i≤3N. We successively determine the \(u_{i}^{n+\frac{s}{p}}\) (1≤i≤3N, 1≤s≤p) with p iterations of the following scheme:
for 1≤i≤3N, 0≤s≤p−1, where
It is convenient to introduce the step functions \(u^{n+\frac{s}{p}}_{h}, \ f^{n+\frac{s}{p}}_{h}\) defined for 0≤s≤p by
We also introduce the backward difference operator ∂ h defined by
so that (2.16) can now be rewritten as
Our goal now is to estimate \(|u_{h}^{n+1}|\) in terms of \(|u^{n}_{h}|\). We take the scalar product in \(L^{2}(\mathcal{M})\) of (2.18) with \(2\frac{\Delta t}{p} u_{h}^{n+\frac{s+1}{p}}\). Denoting by (⋅,⋅) the L 2 scalar product and using the well-known relation
we find
We have, for every u h ∈V h ,
Indeed
and (2.20) follows, since u 0=0.
Using (2.20) and Schwarz inequality, (2.19) yields
so that
This yields readily for 1≤s≤p,
Here, in view of definition (2.17), we observe that
By adding these inequalities for d=0,…,p−1, we obtain
Combining this bound with (2.23) provides
Since 1−x≥4−x for \(x\in [0,\frac{1}{2} ]\), we see that, if \(\frac{\Delta t}{p}\leq\frac{1}{2}\),
Here s varies between 1 and p, and therefore the bound for s=p reads
We now define the \(u_{h}^{n+s}\) for 2≤s≤q+1, by applying q-times the implicit Euler scheme to Eq. (2.11) with step Δt, that is,
where
As we said at the beginning of the section, the Z i ’s are frozen between t n+1 and t n+q+1, and therefore for 2≤s≤q+1, 1≤l≤N,
We can invert this system (2.28) to obtain
Classically these equations allow us to uniquely define the terms \(U^{n+s+1}_{\ell}\), when the terms \(U^{n+1}_{\ell}\) are known. Then Eq. (2.29) allow us to compute the \(u^{n+s+1}_{i}\ (i=1, \ldots, 3N,\ s=1,\ldots, q)\).
To derive suitable a priori estimates, we multiply (2.26) by \(6\Delta t\Delta x U^{n+s+1}_{\ell}\) and sum for ℓ=1,…,N. Setting τ=n+s+1, we find
Hence, as for Eqs. (2.21)–(2.25),
We write Eq. (2.31) for τ=n+2,…,n+q+1, multiply the equation for τ=n+s by 4(q+1−s)Δt and add for s=2,…,q+1. We obtain
We add \(|Z^{n+1}_{h}|^{2}\) to both sides and, in view of (2.15) and the second formula of (2.28), we find
Taking into account (2.25), we find that
More generally, we have the stability result
To summarize, we show the following result.
Theorem 2.1
The multilevel scheme defined by Eqs. (2.16) and (2.26) is stable in \(L^{\infty}(0,T;L^{2}(\mathcal{M}))\) in the sense of (2.35).
3 The Linear Shallow Water Equations
We now want to extend the previous results to the more complex case of the shallow water equations linearized around a constant flow \((\tilde{u}_{0}, \tilde{v}_{0}, \tilde{\phi}_{0})\) (see (3.2) below). As shown in [12] the boundary conditions, which can be associated with these equations, depend on the relative values of the velocities (\(\tilde{u}^{2}_{0},\tilde{v}^{2}_{0} > \) (or <) \(g\tilde{\phi}_{0}\)), that is, whether these velocities are sub- or supercritical (sub- or supersonic). We consider here the case, where
3.1 The Equations
We consider, in the domain \(\mathcal{M}= (0,L_{1})\times(0,L_{2})\), the equations
Here (u,v) is the velocity, and ϕ is the potential height. The advecting velocities \(\tilde{u}_{0}\), \(\tilde{v}_{0}\) and the mean geopotential height \(\tilde{\phi}_{0}\) are constants. f=(f u ,f v ,f ϕ ) is the source term. For the subcritical flow under consideration, we supplement (3.2) with the boundary conditions,
and the initial conditions
The system becomes
where Au=(A 1 u,A 2 u,A 3 u) is given by
It may also be convenient to decompose A with respect to its x and y derivatives, that is,
with
We define the scalar product on \(H=(L^{2}(\mathcal{M}))^{3}\) as follows: for u=(u,v,ϕ), u′=(u′,v′,ϕ′), and we set
where (⋅,⋅) denotes the standard scalar product on \(L^{2}(\mathcal{M})\). Then the following positivity result for A holds.
Lemma 3.1
Under the assumption (3.1), for all sufficiently smooth u satisfying (3.3), we have 〈Au,u〉≥0.
Proof
We write
with
Then
Recall that u=0 at x=0. Also the assumption (3.1) yields that
is pointwise positive. Therefore, we infer from (3.8) that 〈A x u,u〉≥0. A similar computation provides 〈A y u,u〉≥0 (since \(\tilde{v}_{0}^{2}>g\tilde{\phi}_{0}\)). In view of (3.7), the proof of Lemma 3.1 is complete. □
Remark 3.1
The fact that the boundary and initial value problem (3.2)–(3.4) is well-posed is a recent result proved in [12]. The proof relies on the semigroup theory and necessitates in particular proving (by approximation) that 〈Au,u〉≥0 for all \(\mathbf{u}\in L^{2}(\mathcal{M})^{3}\), such that \(\mathbf{A}\mathbf{u}\in L^{2}(\mathcal{M})^{3}\), and u satisfies (3.3). The fact that (3.3) makes sense for such u’s results from a trace theorem also proved in [12].
3.2 Multilevel Finite-Volume Spatial Discretization
3.2.1 Finite-Volume Discretization
We decompose \(\mathcal{M} = (0,L_{1})\times(0,L_{2})\) into 3N 1×3N 2 rectangles denoted by \((k_{i,j})_{1\leq i \leq 3N_{1},1\leq j \leq3N_{2}}\) of size Δx×Δy with 3N 1Δx=L 1 and 3N 2Δy=L 2.
For 0≤i≤3N 1 and for 0≤j≤3N 2, let
Then the rectangles (k i,j ) are, for 1≤i≤3N 1,1≤j≤3N 2,
We also define the center (x i ,y j ) of each cell k ij ,
For the boundary conditions, we add fictitious cells on the west and south sides,
and
The finite-volume scheme is found by integrating the equations (3.2) over each control volume \((k_{i,j})_{1\leq i \leq 3N_{1},1\leq j \leq3N_{2}}\). The first equation yields for 1≤i≤3N 1,1≤j≤3N 2,
Let us denote
We approximate the unknown u=(u,v,ϕ) with u h ≃u h (t)∈(V h )3=V h , and use an upwind scheme for the fluxes, since \(\tilde{u}_{0}>0\) and \(\tilde{v}_{0}>0\),
This gives the following semi-discrete equations for 1≤i≤3N 1 and 1≤j≤3N 2:
where f=(f u ,f v ,f ϕ ), \(\mathbf{u^{0}}=(u^{0},v^{0},\phi ^{0})\) and
Let us introduce the finite difference operators
We can now define in an obvious way, based on (3.9) the finite difference operator A h =(A 1h ,A 2h ,A 3h ), operating on V h
and its decomposition \(\mathbf{A}_{h}=\mathbf{A}^{x}_{h} + \mathbf{A}^{y}_{h}\), to be used later on,
Those are the discrete versions of A,A 1,A 2,A 3,A x,A y.
We can now check that A h , the discrete version of A, is positive like A.
Lemma 3.2
For all u h =(u h ,v h ,ϕ h )∈V h , we have
where 〈⋅,⋅〉 is the scalar product on \(L^{2}(\mathcal{M})^{3}\), given by (3.6).
Proof
We write
where
We first remark that
Then we write
Using these two formulas, we obtain
Since \(\tilde{u}_{0}>0\) and \(\tilde{u}_{0}^{2}>g\tilde{\phi}_{0}\), the expressions
and
are positive and the corresponding sums are positive as well.
Finally, using also the analogue of (3.15) for v h , we conclude that \(\langle A^{x}_{h}\mathbf{u}_{h},\mathbf{u}_{h}\rangle\geq 0\). Similarly, it can be checked that \(\langle A^{y}_{h}\mathbf{u}_{h},\mathbf{u}_{h}\rangle\geq0\). Recalling (3.14), this completes the proof of Lemma 3.2. □
In fact, a perusal of the calculations above shows that we have proved the following useful lemma.
Lemma 3.3
For every u h ∈V h ,
where the constant κ 1 depends on \(\tilde{u}_{0},\tilde{v}_{0},\tilde{\phi}_{0},g\) and in particular on the positive numbers \(\tilde{u}^{2}_{0}-g\tilde{\phi}_{0}, \tilde{v}^{2}_{0} - g\tilde{\phi}_{0}\).
3.2.2 Multilevel Finite-Volume Discretization
We introduce the coarse mesh consisting of the rectangles K lm (1≤l≤N 1,1≤m≤N 2),Footnote 2
We also define the fictitious rectangles K 0,m ,K l,0 (l=1,…N 1, m=1,…,N 2), needed for the implementation of the boundary conditions, and they are defined as above with m or l=0.
We introduce the space V 3h defined like V h . If u h ∈V h and \(u_{h}|_{k_{ij}} = u_{i,j} \), we define for l=1,…,N 1, m=1,…,N 2 the averages as
and the incremental unknowns as
which satisfy of course
We note the following algebraic relations (using (3.19)):
Multiplying by ΔxΔy and adding for l=1,…,N 1, m=1,…,N 2, we find
where |⋅| is still the norm in \(L^{2}(\mathcal{M}), U_{h}\) is the step function equal to U lm on K l,m and Z h is the step function equal to Z i,j on k i,j .
3.3 Euler Implicit Time Discretization and Estimates
We proceed to some extent as in the one-dimensional space. We define a time step Δt with N T Δt=T, and set t n =nΔt. We denote by
the discrete unknowns, where \(\mathbf{u}^{n}_{i,j}\) is an expected approximation
The spatial discretization has been presented in Sect. 3.2. We will now discretize the shallow water equations in time by using the implicit Euler scheme, and advance equation (3.9) for p steps in time on the fine mesh with a time step of \(\frac{\Delta t}{p}\), where p (and q below) are two fixed integers larger than 1.
These steps will bring us, e.g., from t n to t n+1. We then perform q steps with a time step Δt bringing us from t n+1 to t n+q+1. For simplicity, we suppose that N T is a multiple of q+1, and we set \(N_{q}=\frac{N_{T}}{q+1}\). The steps performed with the time step Δt will use the coarse mesh. We first consider in Sect. 3.3.1 the p steps performed with mesh \(\frac{\Delta t}{p}\) on the fine grid. Then the q steps on the coarse grid are described in Sect. 3.3.2.
3.3.1 Scheme and Estimates on the Fine Grid
We start from Eqs. (3.9) and write thus for s=1,…,p,
With the definition of A h introduced in (3.11), Eq. (3.22) amount to
Here we have set for simplicity \(n+\frac{s+1}{p}=\tau,\ n+\frac{s}{p} =\tau-\frac{1}{p},\ \mathbf{u}^{\tau}_{h} = (u^{\tau}_{h}, v^{\tau}_{h}, \phi^{\tau}_{h}), \mathbf{f}^{\tau}_{h} = (f_{u,h}^{\tau}, f_{v,h}^{\tau}, f_{\phi, h}^{\tau})\).
Taking the scalar product in V h of each side of (3.23) with \(2\frac{\Delta t}{p}\mathbf{u}^{\tau}\), we see that
Hence thanks to Lemma 3.2 (comparing with (2.19)–(2.25)),
and for \(\frac{\Delta t}{p}\leq\frac{1}{2}\) and s=1,…,p (comparing with (2.25)),
In particular, for s=p,
3.3.2 Scheme and Estimates on the Coarse Grid
We now consider the q a time-steps performed on the coarse grid with a time step Δt.
We discretize Eq. (3.9) in time, starting from time t n+1=(n+1)Δt using the same scheme as for Eq. (3.22) but with a coarse mesh (comparing with (2.26)). We obtain
where \(\tau=n+s +1,\ s =1,\ldots, q,\ \mathbf{U}^{\tau}_{h} =(U^{\tau}_{u,h}, U^{\tau}_{v,h}, U^{\tau}_{\phi,h})\) and U h ∈V 3h has components U i,j on K i,j (i=0,…,N 1, j=0,…,N 2). Finally, \(\mathbf{F}^{\tau}_{h}\) has components \(\mathbf{F}^{\tau}_{i,j}\) on K i,j with
A priori estimates are obtained by taking the scalar product in V 3h of each side of (3.27) with \(6\Delta t\mathbf{U}^{\tau}_{h}\). We find (comparing with (2.31))
and in view of Lemma 3.2 (for A 3h ),
Thus, for \(\Delta t\leq\frac{1}{2}\),
We write Eq. (3.29) for τ=n+s+1, s=1,…,q. We multiply the equation for τ=n+s+1 by 4(q−s)Δt and add these equations for s=1,…,q. We find
During the steps from (n+1)Δt to (n+q+1)Δt, the Z h are frozen. Thus
and we recover the \(\mathbf{u}^{n+s +1}_{h}\) in the form
Then, because of (3.30) and (2.15),
Combining (3.33) with (3.26), we find
We can repeat the procedure for any interval of time (nΔt,(n+q+1)Δt), n=1,…,N q , and arrive at the stability result
valid for m=1,…,N q .
Theorem 3.1
The multilevel scheme defined by Eqs. (3.22) and (3.27) is stable in \(L^{\infty}(0,T;L^{2}(\mathcal{M})^{3})\) in the sense of (3.35).
4 Other Schemes and Other Methods
The coarse grid schemes that we have used in Sects. 2 and 3 amount to using the same schemes on the coarse grid as on the fine grid. Another possibility for the coarse grid is to average on each coarse grid the fine grid equations associated with the corresponding fine grids. These schemes are made explicit below. However, the study of the stability of these new schemes appears difficult, and we will only present the study of stability in the one-dimensional case for the simple transport equation (see Sect. 4.1), and for a one-dimensional shallow water equation (see Sect. 4.2). Furthermore, the boundary condition will be space periodicity, and the stability analysis is made by the von Neumann method (see [22]).
4.1 The One-Dimensional Case
We start with the one-dimensional space, and consider the same problem as (2.1), with f=0,
for (x,t)∈(0,L)×(0,T), and with the space periodicity boundary condition, and the initial condition
On the fine grid, we will perform an approximation by the implicit Euler scheme in time and upwind finite-volume in space, so that the scheme will be very much like the one in (2.16) except that the second formula of (2.16) is replaced by the periodicity condition
We perform p steps with a time step \(\frac{\Delta t}{p}\) and a space mesh \(\Delta x=\frac{L}{3N}\). Then as explained below, we make q steps with a time step Δt and a mesh step 3Δx. Thus we start again with the p steps.
4.1.1 The Fine Grid Scheme with a Small Time Step
The scheme reads
where \(\tau=n+\frac{s}{p}\), s=1,…,p, j=1,…,3N, \(u^{\tau}_{j}\) is meant to be an approximation of \(\frac{1}{\Delta x}\int_{k_{j}}u(x,\tau\Delta t){\rm d}x\) with k j =((j−1)h,jh) and h=Δx; \(u^{\tau}_{0}=u^{\tau}_{3N}\) by periodicity.
We associate with a sequence v j , and its Fourier transform (see [22, p. 38]) is as follows:
Below we will consider periodic sequences v j , \(j\in\mathbb{Z}\), v j+3N =v j , \(h^{*}=\frac{2\pi}{3N}\) and define the discrete Fourier coefficients (see [5, 9, 22])
We then have the discrete Parseval formula
(see the details in [3, 22]). Note that the sequence \(\{ \hat{v}_{m}\}\) is itself periodic with period 3N, and if (σv) j =v j−1, then
Then (4.4) is rewritten as
that is, for the Fourier transforms defined as in (4.6), where \(h^{*}=\frac{2\pi}{3N}\),
Hence the amplification factor for the fine mesh is
We observe that
We conclude that
Recall that \(\tau=n+\frac{s}{p}\), s=1,…,p. Denoting by \(u^{\tau}_{h}\) the piecewise constant function given by \(u_{h}^{\tau}=u^{\tau}_{j}\) on k j , (4.7) and (4.12) yield
In particular, for s=p,
and therefore these steps of the scheme (4.4) on the fine grid are stable for the L 2-norm.
4.1.2 The Coarse Grid Scheme with a “Large” Time Step
Considering first the analogue of (4.4) with a time step Δt and a space mesh Δx, we would write (τ=n+s+1 now, s=1,…,q)
To obtain the scheme with a time step Δt and a space mesh 3Δx, we add (average) Eq. (4.14) corresponding to j=3l,3l−1,3l−2.
Setting
we obtain
for l=1,…,N.
We elaborate on the u=U+Z decomposition (independent of the time step).
The u=U+Z Decomposition
Given the sequence u j , j=1,…,3N (u 0=u 3N ), we define the sequence
and the sequences
α=0,1,2, ℓ=1,…,N. We observe that
Now the multistep algorithm that we consider consists in freezing the Z during the step n+2,…,n+q+1, that is,
so that
for α=0,1,2, τ=n+s+1, s=1,…,q. Hence \(U^{\tau}_{l}-U^{\tau-1}_{l}=u^{\tau}_{3\ell-\alpha} - u^{\tau-1}_{3\ell-\alpha}\) for α=0,1,2, and for those values of τ. With α=0, (4.16) becomes
That is, as in (4.9),
Before we introduce the Fourier transform of (4.21) and the amplification function similar to the g F , we have to elaborate a bit more on the u=U+Z decomposition at the level of the Fourier transforms.
We write (independent of the time step τ), with \(h^{*}=\frac{2\pi}{3N}\) for m=1,…,3N,
We now introduce the partial Fourier sum of the type of (4.6),
We observe that this partial Fourier sum is periodic in m with period 3N, and that Parseval relation similar to (4.7) holds,
We can hence write
Then
and now (4.21) yields by a partial Fourier transform
That is,
corresponding to the amplification factor g C,m with
We can conclude as before that \(|g_{C,m}^{-1}|\geq1\),
and thus the scheme (4.21), (4.26) is “stable”. Also
The important point now is that we know nothing about the stability of the \(u^{\tau}_{3l-1}\), \(u^{\tau}_{3l-2}\), and we have to elaborate more to prove this stability.
In the similar way to (4.24), we write for m=1,…,3N,
The relations
given by the partial discrete Fourier transform for m=1,…,3N,
Using (4.30), we obtain the expression of \(\hat{U}^{n+s+1}_{(l),m}\) for α=0,
There remains to express \(\hat{Z}_{(3l)}^{n+1}\) in terms of the \(\hat{u}^{n+1}_{(3l-\alpha),m}\), α=0,1,2.
We proceed in the physical space, independent of the time step τ, to have
and
Thus for the Fourier transforms, for m=1,…,3N,
This holds in particular at the time step τ=n+1.
Now we look for the expression of the \(\hat{u}^{n+s+1}_{(3l-\alpha),m}\) (α=0,1,2), in terms of the \(\hat{u}^{n+1}_{(3l-\beta),m}\), that of \(\hat{u}_{(3l),m}^{n+s+1}\) has been already found (see (4.30)).
By (4.32)–(4.34), (4.36) and (4.19),
We rewrite (4.30), (4.37)–(4.38) in matrical form,
The passing from u n+1 to u n+s+1 is given in the matrical form by (4.39). The stability of the scheme for passing from u n+1 to u n+s+1 is equivalent to showing that the spectral radius of \(G^{(s)}_{C,m}\) is not larger than 1 for m=1,…,3N. The eigenvalues of \(G_{C,m}^{(s)}\) are not larger than 1. These eigenvalues are 1, 1, \(g^{s}_{C,m}\), and we have seen that |g C,m |≤1.
More precisely, using that the spectral radius of \(G_{C,m}^{(s)}\) is less than 1 and (4.23), we have
and for s=q,
Combining (4.13) and (4.42), we obtain the stability of the scheme.
Theorem 4.1
The multilevel scheme defined by Eqs. (4.4) and (4.16) is stable in \(L^{\infty}(0,\infty;L^{2}(\mathcal{M}))\). More precisely, for all n,
4.2 The Linearized 1D Shallow Water Equation
By restriction to 1 dimension, Eq. (3.2) with f=0 become
We assume the background flow \((\tilde{u}_{0},\tilde{\phi}_{0})\) to be supersonic (supercritical), that is,
The boundary conditions are space periodicity, and the initial conditions are given such that they are similar as (3.4). The time and space meshes are the same as in Sects. 2.1 and 2.2.
4.2.1 The Fine Grid Scheme with a “Small” Time Step
The fine grid mesh scheme reads
where \(\tau=n+\frac{s}{p}\), s=1,…,p, j=1,…,3N, \(u^{\tau}_{0}=u^{\tau}_{3N}\), \(\phi^{\tau}_{0}=\phi^{\tau}_{3N}\) by space periodicity.
We rewrite (4.46) in the form
From this, we deduce for the Fourier transforms, for m=1,…,3N,
that is,
with
The eigenvalues of \(G_{F,m}^{-1}\) are easily computed
with
We have
The condition \(\tilde{u}_{0}>\sqrt{g\tilde{\phi}_{0}}\) implies Λ ±>0, and thus
Hence, setting u=(u,ϕ) (comparing with (4.13)), we have
so that these steps of the small step scheme (4.46) are stable.
4.2.2 The Coarse Grid Scheme with a “Large” Time Step
We define the cell averages
and the incremental unknowns
The analogue of scheme (4.16) reads
for τ=n+s+1, s=1,…,q and l=1,…,N.
Observing as in (4.19) that
for s=1,…,q, j=1,…,3N and thus that
(4.51) yields
Hence, for the partial Fourier transforms for m=1,…,3N (comparing with (4.27)),
with
where \(G_{C,m}^{-1}\) is very similar to \(G_{F,m}^{-1}\), and we prove in the same way that its eigenvalues are larger than or equal to 1 in magnitude.
For the moment, we infer from (4.54) that
Then by (4.55),
We then need to express \(\hat{u}^{n+s+1}_{(3l-\alpha),m}\), \(\hat{\phi}^{n+s+1}_{(3l-\alpha),m}\) in terms of \(\hat{u}^{n+1}_{(3l-\beta),m}\), \(\hat{\phi}^{n+1}_{(3l-\beta),m}\), α=1,2, β=0,1,2. We write as in Eqs. (4.37)–(4.38),
In the end,
with
All the eigenvalues of \(\mathcal{G}_{C,m}^{(s)}\) are less than or equal to 1, which ensures the stability of the scheme (4.51) going from t=(n+1)Δt to t=(n+s+1)Δt.
Then we have
Theorem 4.2
The multilevel scheme defined by Eqs. (4.46) and (4.51) is stable in \(L^{\infty}(0,\infty;L^{2}(\mathcal{M})^{2})\). More precisely, for all n,
Notes
- 1.
Including, strictly speaking, the separation points.
- 2.
Including, strictly speaking, the separation edges.
References
Adamy, K., Bousquet, A., Faure, S., et al.: A multilevel method for finite-volume discretization of the two-dimensional nonlinear shallow-water equations. Ocean Model. 33, 235–256 (2010). doi:10.1016/j.ocemod.2010.02.006
Adamy, K., Pham, D.: A finite-volume implicit Euler scheme for the linearized shallow water equations: stability and convergence. Numer. Funct. Anal. Optim. 27(7–8), 757–783 (2006)
Bellanger, M.: Traitement du Signal. Dunod, Paris (2006)
Bousquet, A., Marion, M., Temam, R.: Finite volume multilevel approximation of the shallow water equations II. (2013, in preparation)
Canuto, C., Hussaini, M.Y., Quarteroni, A., Zhang, T.A.: Spectral Methods, Evolution to Complex Geometries and Applications to Fluid Dynamics, Scientific Computation. Springer, Berlin (2007)
Chen, Q., Shiue, M.C., Temam, R.: The barotropic mode for the primitive equations. J. Sci. Comput. 45, 167–199 (2010). doi:10.1007/s10915-009-9343-8. Special issue in memory of David Gottlieb
Chen, Q., Shiue, M.C., Temam, R., Tribbia, J.: Numerical approximation of the inviscid 3D Primitive equations in a limited domain. Modél. Math. Anal. Numér. 45, 619–646 (2012). doi:10.105/m2an/2011058
Dubois, T., Jauberteau, F., Temam, R.: Dynamic, Multilevel Methods and the Numerical Simulation of Turbulence. Cambridge University Press, Cambridge (1999)
Dautray, R., Lions, J.L.: Mathematical Analysis and Numerical Methods for Science and Technology. Springer, Berlin (1990–1992)
Eymard, R., Gallouet, T., Herbin, R.: Finite volume methods. In: Ciarlet, P.G., Lions, J.L. (eds.) Handbook of Numerical Analysis, vol. VII, pp. 713–1020. North-Holland, Amsterdam (2002)
Gie, G.M., Temam, R.: Cell centered finite-volume methods using Taylor series expansion scheme without fictitious domains. Int. J. Numer. Anal. Model. 7(1), 1–29 (2010)
Huang, A., Temam, R.: The linearized 2D inviscid shallow water equations in a rectangle: boundary conditions and well-posedness. (2013, to appear)
Leveque, R.J.: Finite Volume Methods for Hyperbolic Problems. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2002)
Lions, J.L., Temam, R., Wang, S.: Models of the coupled atmosphere and ocean (CAO I). Comput. Mech. Adv. 1, 5–54 (1993)
Lions, J.L., Temam, R., Wang, S.: Numerical analysis of the coupled models of atmosphere and ocean (CAO II). Comput. Mech. Adv. 1, 55–119 (1993)
Lions, J.L., Temam, R., Wang, S.: Splitting up methods and numerical analysis of some multiscale problems. Comput. Fluid Dyn. J. 5(2), 157–202 (1996). Special issue dedicated to A. Jameson
Marchuk, G.I.: Methods of numerical mathematics, 2nd edn. Applications of Mathematics, vol. 2. Springer, New York (1982). Translated from the Russian by Arthur A. Brown
Marion, M., Temam, R.: Nonlinear Galerkin methods. SIAM J. Numer. Anal. 26, 1139–1157 (1989)
Marion, M., Temam, R.: Navier-Stokes equations, theory and approximation. In: Ciarlet, P.G., Lions, J.L. (eds.) Handbook of Numerical Analysis, vol. VI, pp. 503–689. North-Holland, Amsterdam (1998)
Rousseau, A., Temam, R., Tribbia, J.: The 3D primitive equations in the absence of viscosity: boundary conditions and well-posedness in the linearized case. J. Math. Pures Appl. 89(3), 297–319 (2008). doi:10.1016/j.matpur.2007.12.001
Rousseau, A., Temam, R., Tribbia, J.: Boundary value problems for the inviscid primitive equations in limited domains. In: Temam, R.M., Tribbia, J.J., Ciarlet, P.G. (eds.) Computational Methods for the Atmosphere and the Oceans, Handbook of Numerical Analysis, vol. XIV. Elsevier, Amsterdam (2008)
Strikwerda, J.C.: Finite Difference Schemes and Partial Differential Equations, 2nd edn. SIAM, Philadelphia (2004)
Temam, R.: Inertial manifolds and multigrid methods. SIAM J. Math. Anal. 21, 154–178 (1990)
Temam, R., Tribbia, J.: Open boundary conditions for the primitive and Boussinesq equations. J. Atmos. Sci. 60, 2647–2660 (2003)
Yanenko, N.N.: The Method of Fractional Steps, The Solution of Problems of Mathematical Physics in Several Variables. Springer, New York (1971). Translated from the Russian by T. Cheron. English translation edited by M. Holt
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bousquet, A., Marion, M., Temam, R. (2014). Finite Volume Multilevel Approximation of the Shallow Water Equations. In: Ciarlet, P., Li, T., Maday, Y. (eds) Partial Differential Equations: Theory, Control and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41401-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-41401-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41400-8
Online ISBN: 978-3-642-41401-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)