Advances in Numerical AnalysisVolume 2012 (2012), Article ID 162539, 32 pagesdoi:10.1155/2012/162539

Research Article

Convergence Analysis of a Fully Discrete Family of Iterated Deconvolution Methods for Turbulence Modeling with Time Relaxation

R. Ingram,¹ C. C. Manica,² N. Mays,³ and I. Stanculescu⁴

¹Department of Mathematics, University of Pittsburgh, PA 15260, USA²Departmento de Matemática Pura e Aplicada, Universidade Federal do Rio Grande do Sul, Porto Alegre 91509-900, RS, Brazil³Department of Mathematics, Wheeling Jesuit University, WV 26003, USA⁴Farquhar College of Arts and Sciences, Nova Southeastern University, FL 33314, USA

Received 31 May 2012; Accepted 25 July 2012

Academic Editor: William J. Layton

Copyright © 2012 R. Ingram et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We present a general theory for regularization models of the Navier-Stokes equations based on the Leray deconvolution model with a general deconvolution operator designed to fit a few important key properties. We provide examples of this type of operator, such as the (modified) Tikhonov-Lavrentiev and (modified) Iterated Tikhonov-Lavrentiev operators, and study their mathematical properties. An existence theory is derived for the family of models and a rigorous convergence theory is derived for the resulting algorithms. Our theoretical results are supported by numerical testing with the Taylor-Green vortex problem, presented for the special operator cases mentioned above.

1. Approximate Deconvolution for Turbulence Modeling

Numerical simulations of complex flows present many challenges. The Navier-Stokes (NS) equations (NSE), given by the following is an exact model for the flow of a viscous, incompressible fluid, [1]. For turbulent flows (characterized by Reynold’s number ), it is infeasible to properly resolve all significant scales above the Kolmogorov length scale by direct numerical simulation. Thus, numerical simulations are often based on various regularizations of NSE, rather than NSE themselves. Accordingly, regularization methods provide a (computationally) efficient and (algorithmically) simple family of turbulence models. Several of the most commonly applied regularization methods include: where in each case and is an averaged velocity field , is pressure, and is the Bernoulli pressure. More details about these models can be found for instance in [2–5] and references therein. Although these regularization methods achieve high theoretical accuracy and perform well in select practical tests, those models do not provide a fully-developed numerical solution for decoupling the scales in a turbulent flow. In fact, results show that only time relaxation regularization truncates scales sufficiently for practical computations. Indeed, it is shown that time relaxation term for damps unresolved fluctuations over time [5, 6]. Note that the choice of is an active area of research and that solutions are very sensitive to variations in .

Deconvolution-based regularization is also an active area of research obtained, for example, by replacing by in each (1.2)–(1.5) for some deconvolution operator . In [7], Dunca proposed the general Leray-deconvolution problem ( instead of ) as a more accurate extension to Leray’s model [8]. Leray used the Gaussian filter as the smoothing (averaging) filter , denoted above by overbar. In [9], Germano proposed the differential filter (approximate-Gaussian) where is the filter length. The differential filter is easily modeled in the variational framework of the finite element (FE method (FEM)). We provide a brief overview of continuous and discrete operators (Section 3).

The deconvolution-based models have proven themselves to be very promising. However, among the very many known approximate deconvolution operators from image processing, for example, [10], so far only few have been studied for turbulence modeling, for example, the van Cittert and the modified Tikhonov-Lavrentiev deconvolution operators. Their success suggests that it is time to develop a general theory for regularization models of the NSE as a guide to development of models based on other, possibly better, deconvolution operators and refinement of existing ones.

Herein, we present a general theory for regularization models of the NSE based on the Leray deconvolution model with a general deconvolution operator. We prove energetic stability (and hence existence) and convergence of an FE (in space) and Crank-Nicolson (CN) (in time) discretization of the following family of Leray deconvolution regularization models with time relaxation: find and satisfying the following for some appropriate boundary and initial conditions (the fully discrete model is presented in Problem 1 with energetic stability and well posedness proved in Theorem 4.5).

1.1. Improving Accuracy of Approximate Deconvolution Methods

The fundamental difficulties corresponding to regularization methods applied as a viable turbulence model include ensuring that:(i)scales are appropriately truncated (model microscale = filter radius = mesh width)(ii)smooth parts of the solution are accurately approximated ( for smooth )(iii)physical fidelity of flow is preserved.

Due to the nonlinearity in (1.6), different choices of the filter and deconvolution operator yield significant changes in the solution of the corresponding model. Implementation concerns for deconvolution methods, for example, Tikhonov-Lavrentiev regularization given by , include selection of deconvolution parameter . Iterated deconvolution methods reduce approximation sensitivity relative to -selection and, hence, allow a conservatively large -selection for stability with updates (fixed number of iterations) used to recover higher accuracy (Section 3.3). For example we prove, under usual conditions, (Proposition 5.3), so that iterated modified Tikhonov regularization gives geometric convergence with respect to the update number . In either case, Tikhonov-Lavrentiev or iterated Tikhonov-Lavrentiev regularization, we prove, under usual conditions, (Proposition 5.4) where and represent the discrete deconvolution operator and discrete filter, respectively, and is order of FE polynomial space. We propose minimal properties for a general family of deconvolution operators and filters (Section 3.1) satisfying (Assumptions 3.4, 3.5), for example,(i), forces spectrum of in (ii), controls size of (iii) as , (for smooth ), ensures convergence of method(iv) as (for smooth ), ensures convergence of method.

In fact, the updates satisfying inherit the properties assumed for the base operator in Assumptions 3.4, 3.5 (Propositions 3.10, 3.11). These iterates represent defect correction generalization of iterated Tikhonov regularization operator [11]. We prove that the FE-CN approximation of the general deconvolution turbulence model (Problem 1) satisfies (Theorem 4.6) for smooth enough solutions of the NSE (see variational formulation (2.3)–(2.5)). We show that (for any and ) (Proposition 5.3) and (for ) (Proposition 5.4) for modified iterated Tikhonov-Lavrentiev regularization (see Corollary 5.5 for corresponding error estimate). We conclude with a numerical test that verifies the theoretical convergence rate predicted in Theorem 4.6 (Section 5.2).

1.2. Background and Overview

One of the most interesting approaches to generate turbulence models is via approximate deconvolution or approximate/asymptotic inverse of the filtering operator. Examples of such models include: Approximate Deconvolution Models (ADM) and Leray-Tikhonov Deconvolution Models. Layton and Rebholz compiled a comprehensive overview and detailed analysis of ADM [12] (see also references therein). Previous analysis of the ADM with and without the time-relaxation term used van Cittert deconvolution operators [5, 6]; although easily programmed, van Cittert schemes can be computationally expensive [5]. Tikhonov-Lavrentiev regularization is another popular regularization scheme [13]. Determining the appropriate value of to ensure stability while preserving accuracy is challenging, see for example, [14–19]. Alternatively, iterated Tikhonov regularization is well known to decouple stability and accuracy from the selection of regularization parameter , see for example, [11, 20–22]. Iterated Tikhonov regularization is one special case of the general deconvolution operator we propose herein.

2. Function Spaces and Approximations

Let the flow domain for be a regular and bounded polyhedral. We use standard notation for Lebesgue and Sobolev spaces and their norms. Let and be the -norm and inner product, respectively. Let represent the -norm. We write and for the corresponding norm. Let the context determine whether denotes a scalar, vector, or tensor function space. For example let . Then, implies that and implies that . Write equipped with the standard norm. For example,

Denote the pressure and velocity spaces by and , respectively. Moreover, the dual space of is denoted and equipped with the norm

Fix and . In this setting, we consider strong NS solutions: find and satisfying Let . Restricting test functions reduces (2.3)–(2.5) to find satisfying and (2.5). For smooth enough solutions, solving the problem associated with (2.6), (2.5) is equivalent to (2.3)–(2.5).

Control of the nonlinear term is essential for establishing a priori estimates and convergence estimates. We state a selection of inequalities here that will be utilized later:

2.1. Discrete Function Setting

Fix . Let be a family of subdivisions (e.g., triangulation) of satisfying so that and any two closed elements , are either disjoint or share exactly one face, side, or vertex. See Chapter II, Appendix in [23] for more on this subject in context of Stokes problem and [24] for a more general treatment. For example, consists of triangles for or tetrahedra for that are nondegenerate as .

Let and be a conforming velocity-pressure mixed FE space. For example, let and be continuous, piecewise (on each ) polynomial spaces. The discretely divergence-free space is given by Note that in general (e.g., for Taylor-Hood elements). In order to avoid stability issues arising when FE solutions are not exactly divergence free (i.e., when ), we introduce the explicitly skew-symmetric convective term so that Note that when . Moreover, the trilinear from is continuous and skew-symmetric on .

Lemma 2.1. If ,

Proof. The proof of the first inequality can be found in [25]. The second follows from Hölder’s and Poincaré’s inequalities.

For the time discretization, let be a discretization of the time interval for a constant time step . Write and, if , . Define for any . Write . We say that if the associated norm defined above stays finite as .

The discrete Gronwall inequality is essential to the convergence analysis in Section 4.2.

Lemma 2.2. Let and , , , for any integer and satisfy Suppose that for all , and set . Then,

Proof. The proof follows from [26].

2.2. Approximation Theory

Let be a generic constant independent of . Preserving an abstract framework for the FE spaces, we assume that inherit several fundamental approximation properties.

Assumption 2.3. The FE spaces satisfy:

Uniform inf-sup (LBB) condition FE-approximation Inverse-estimate The well-known Taylor-Hood mixed FE is one such example satisfying Assumption 2.3.

Estimates in (2.18)–(2.20) stated below are used in proving error estimates for time-dependent problems: for any , where , , and is required, respectively, for some . Each estimate (2.18)–(2.20) is a result of a Taylor expansion with integral remainder.

These higher-order spatial ( or ) and temporal estimates (2.18)–(2.20) require that the nonlocal compatibility condition addressed by Heywood and Rannacher in [26, 27] (and more recently, for example, by He in [28, 29] and He and Li in [30, 31]) is satisfied. Suppose, for example, that is the solution of the (well-posed) Neumann problem In order to avoid the accompanying factor in the error estimates contained herein, the following compatibility condition is necessarily required (e.g., see [27, Corollary 2.1]): Replacing (2.21) with (2.21)(a), (2.22) defines an overdetermined Neumann-type problem. Condition (2.22) is a nonlocal condition relating and . Condition (2.22) is satisfied for several practical applications including start up from rest with zero force, , . In general, however, condition (2.22) cannot be verified. In this case, it is shown that, for example, .

We finish with an approximation property of the -projection. Indeed, Assumption 2.4 holds for smooth enough .

Assumption 2.4. Fix and let be the unique solution satisfying for all . Then for .

Note that the infimum in (2.23) is over all (see intermediate estimate (1.16) of Theorem II.1.1 in [23] for the corresponding estimate relating the spaces and ).

3. Filters and Deconvolution

We prescribe the essential properties our filter and deconvolution operator in this section.

Definition 3.1. Let be a Hilbert space and . Write if is self-adjoint and for all and call symmetric nonnegative (snn). Write if is self-adjoint and for all and call symmetric positive definite (spd).Let be a linear, bounded, compact operator on representing a generic smoothing filter with filter radius : One example of this operator is the continuous differential filter (Definition 3.2), which is used, together with its discrete counterpart (Definition 3.3), for implementation of our numerical scheme (Section 5.2).

Definition 3.2 (continuous differential filter). Fix . Then is the unique solution of with corresponding weak formulation Set so that , defined by , is well defined.

Definition 3.3 (discrete differential filter). Fix . Then is the unique solution of the following Set so that , defined by , is well defined. Here, is the projection and the discrete Laplace operator satisfying the following It is well known that and are each linear and bounded, is compact, and the spectrum of and (on and , resp.) is contained in and spectrum of and (on and , resp.) is contained in so that For more detailed exposition on these operators, see [13].

3.1. A Family of Deconvolution Operators

We analyze (1.6) for stable, accurate deconvolution of the smoothing filter introduced in Section 3 so that accurately approximates the smooth parts of .

Assumption 3.4 (continuous deconvolution operator). Suppose that is linear, bounded, spd, and commutes with so that for some constant . Moreover, suppose that is parametrized by , so that for smooth enough .Note that the first estimate in (3.6) is required so that the spectral radius satisfies . The second estimate in (3.6) (which controls the -seminorm of ) is required for the convergence analysis in Section 4.2.Assumption 3.5 prescribes properties of the discrete analogue corresponding to the continuous deconvolution operator (Assumptions 3.4).

Assumption 3.5 (discrete deconvolution operator). Let satisfy Assumption 3.4. Let be a discrete analogue of that is linear, bounded, spd. Suppose that is linear, bounded, spd, and commutes with such that for some constant . Moreover, suppose that is parametrized by such that and for all for some .

The estimates in (3.8) are motivated by the continuous case of (3.6). The approximation (3.9) is required for the convergence analysis in Section 4.2 (see Theorem 4.6, Corollary 4.7).

Remark 3.6. If for some continuous map , then commutativity is satisfied . Tikhonov-Lavrentiev (modified) regularization with , given by , is one such example with and , , , see [13].

Remark 3.7. Letting denote the th (ordered) eigenvalue of a given operator, commutativity of and provides and similarly for the discrete operator .

We next derive several important consequences of and under Assumptions 3.4, 3.5 required in the forthcoming analysis.

Lemma 3.8. Suppose that , , , satisfy Assumptions 3.4, 3.5. Then,

Proof. For the continuous operator, Then, (3.10)(a) follows from Assumption 3.4, and (3.10)(b) is derived similarly applying Assumption 3.5 instead.

Lemma 3.9. Suppose that , , , satisfy Assumptions 3.4, 3.5. Then, the spectrum of both and are contained in so that As a consequence,

Proof. Assumptions 3.4, 3.5 guarantee that the spectral radius and . Also, and and commute so that . Similarly, . Therefore, the spectrum of , are each contained in . So, , have spectrum contained in which ensures the non-negativity of both and .

3.2. Iterated Deconvolution

One can show, by eliminating intermediate steps in the definition of the iterated regularization operator in (1.9) with base operator satisfying Assumption 3.4, that Similarly, the discrete iterated regularization operator with discrete base operator satisfying Assumption 3.5, is given by the following We next show that and for inherit several important properties from and , respectively, via Assumption 3.5.

Proposition 3.10. Fix . Then defined by (3.14) satisfies Assumption 3.4. In particular, is linear, bounded, commutes with and satisfies (3.6)(a). Estimate (3.6)(b) is replaced by the following for some constant . Estimate (3.7) is replaced by the following Moreover, and .

Proof. First notice that is linear and bounded since it is a linear combination of linear and bounded operators , for . Moreover, since commutes with , it follows that commutes with and hence with . Next, is a sum of spd and snn operators , . Hence, . Next, notice that Letting denote the th (ordered) eigenvalue of a given operator, we can characterize the spectrum of by summing the resulting finite geometric series (3.18) to get Then under Assumption 3.4, Lemma 3.9 with (3.19) implies that . Hence, satisfies (3.6)(a). Expanding the terms in (3.18) as powers of , we see that (3.18) can be written as a polynomial (with coefficients ) in , so that since can be applied successfully. Therefore (3.16) follows with . Next, start with (3.18) to get Estimate (3.17) follows by noting , , and by Assumption 3.5, .

Proposition 3.11. Fix . Then defined by (3.15) satisfies Assumption 3.5. In particular, is linear, bounded, commutes with and satisfies (3.8)(a). Estimate (3.8)(b) is replaced by the following for some constant . Estimate (3.9) is replaced by the following for any for some . Moreover, for some constant .

Proof. The first two assertions follow similarly as in the previous proof of Proposition 3.10. To prove (3.23), we start by writing and then subtract (3.24) from (3.18) to get where Then taking norms across (3.25), we get Notice that so that . Moreover, via Assumption 3.5. Next, using the binomial theorem and factoring, we get Then, applying , to (3.28) provides Again, via Assumption 3.5. So, we combine these above results to conclude (3.23) with .

3.3. Tikhonov-Lavrentiev Regularization

We provide two examples of discrete deconvolution operators to make the abstract formulation in the previous section more concrete. The Tikhonov-Lavrentiev and modified Tikhonov-Lavrentiev operator (for linear, compact ) is given by the following

Definition 3.12 ((weak) modified Tikhonov-Lavrentiev deconvolution). Fix . Let . For any , let be the unique solution of

Definition 3.13 ((discrete) modified Tikhonov-Lavrentiev deconvolution). Fix . Let and . For any , let be the unique solution of The iterated modified Tikhonov-Lavrentiev operator (for linear, compact ) is obtained from the Tikhonov-Lavrentiev operator with updates via (1.9):

Definition 3.14 (iterated modified Tikhonov-Lavrentiev deconvolution (weak)). Fix and . Let . Define , then for any and , let be the unique solution of

Definition 3.15 (iterated modified Tikhonov-Lavrentiev deconvolution (discrete)). Fix and . Let , and . Define , then for any and , let be the unique solution of

4. Well Posedness of the Fully Discrete Model

We now state the proposed algorithm.

Problem 1 (CNFE for Leray-deconvolution). Let . Then, for each , find satisfying where .

Notice that when so that the problem of finding satisfying

4.1. Well Posedness

We establish existence of at each time step of (4.3) by Leray-Schauder’s fixed-point theorem.

Lemma 4.1. Let for any and , . Suppose that satisfies Assumption 3.5. Then is a continuous and coercive bilinear form and is a linear, continuous functional.

Proof. Linearity for is obvious, and continuity follows from an application of Hölder’s inequality. Continuity for also follows from Hölder’s inequality and Assumption 3.5. Coercivity is proven by application of (3.13).

Lemma 4.2. Let be such that, for any , solves Then is a well-defined, linear, bounded operator.

Proof. Linearity is clear. The results of Lemma 4.1, and the Lax-Milgram theorem prove the rest.

Lemma 4.3. Fix . Let be a solution of Problem 1 and let satisfy, for any , Then is well-defined, bounded, and continuous.

Proof. For each , the map is a bounded, linear functional (apply Hölder’s inequality and (2.11)). Since is a Hilbert space, we conclude that is well defined, by the Riesz-Representation theorem. Moreover, is bounded on and since the underlying function space is finite dimensional, continuity follows.

Lemma 4.4. Fix . Let be defined such that . Then, is a compact operator.

Proof. is a compact operator (continuous on a finite dimensional function space). Thus, is a continuous composition of a compact operator and hence compact itself.

Theorem 4.5 (well posedness). Fix . There exists satisfying Problem 1. Moreover, for all integers , independent of .

Proof. First, assume that is a solution to (4.1), (4.2). Set in (4.1) so that skew-symmetry of the nonlinear term provides Duality of with Young’s inequality implies From (3.13), we have Then applying (4.9), (4.10) to (4.8), combining-like terms and simplifying provides Summing from to , we get the desired bound.Next, let . Showing that has a fixed point will ensure existence of solutions to (4.3). Indeed, if we can show that , then since is given initial data, existence of is immediate. Induction can be applied to prove existence of . To this end, since is compact, it is enough to show (via Leray Schauder) that any solution of the fixed-point problem is uniformly bounded with respect to . Hence, we consider Test with , use skew-symmetry of the trilinear form and properties of given in Assumption 3.5 and (3.13) to get Duality of followed by Young’s inequality implies Since from the a priori estimate (4.7), we apply Hölder’s and Young’s inequalities to get Applying estimates (4.14), (4.15) to (4.13) we get that independent of . By the Leray-Schauder fixed point theorem, given , there exists a solution to the fixed-point theorem . By the induction argument noted above, there exists a solution for each to (4.3). Existence of an associated discrete pressure follows by a classical argument, since the pair satisfies the discrete inf-sup condition (2.15).

4.2. Convergence Analysis

Under usual regularity assumptions, we summarize the main convergence estimate in Theorem 4.6. Suppose that represents deconvolution with -updates.

Theorem 4.6. Suppose that are strong solutions to (2.3), (2.4), (2.5) and that , , , satisfy Assumptions 3.4, 3.5. Suppose further that , , for some , . If then, where is given in (4.52).

Corollary 4.7 (convergence estimate). Under the assumptions of Theorem 4.6, suppose further that satisfy the assumptions for (2.16) for some and , , , , , and . If then

Proof of Theorem 4.6, Corollary 4.7. Suppose that , satisfying (2.3), (2.4) also satisfy , , and so that, for each , The consistency error for the time-discretization and regularization/time-relaxation error are given by, for , where . Write . Using (4.20), rewrite (4.19) in a form conducive to analyzing the error between the continuous and discrete models: Let be the -projection of so that . Decompose the velocity error where . Fix . Note that for any . Subtract (4.21) from (4.3), apply (3.13)(b), and test with to get (Spatial discretization error): Fix . First, apply Hölder’s and Young’s inequalities to get Apply (3.12) and duality estimate on to get We bound the convective terms next. First, and estimate (2.11)(b) give and with (2.11)(a) give Next, rewrite the remaining nonlinear term Once again, and (2.11)(a) give Lastly, estimate (2.11)(a) and inverse inequality (2.17) give Apply estimates and from Assumption 3.5 along with estimates (4.26)–(4.30) to get (Time discretization error): First, apply duality estimate on to get Taylor-expansion about with integral remainder gives Add/subtract and apply (4.33) to get Majorize either directly or with (2.7)(a) to get or with (2.7)(b), (2.7)(c) and Hölder’s inequality (in time) applied to (4.34) to get Then, to prove Corollary 4.7, apply (4.32), (4.36) with Young’s inequality give We apply (4.35) instead of (4.36) to prove Theorem 4.6: (Deconvolution error): Next, add/subtract we write Then duality on and Young’s inequalities give and along with (2.11)(b) give The estimates (4.37), (4.40), (4.41) with identity (4.39) give Then estimates (3.17) and (3.23) give Apply estimates from (4.24), (4.25), (4.31), (4.37), (4.42) to (4.23). Set and absorb all terms including from the right into left-hand-side of (4.23). Sum the resulting inequality on both sides from to to get Estimates (2.23), (2.16)(a) imply These estimates applied to (4.44) give Suppose that the -restriction (4.16) is satisfied. Then the discrete Gronwall Lemma 2.2 applies to (4.46) and gives where Lastly, the triangle inequality and approximation theory estimates (2.23), (2.16) along with (3.23) applied to (4.47) give It remains to bound .

(Theorem 4.6): Suppose that . The triangle inequality and (2.18) gives Apply (4.38), instead of (4.37), to derive in (4.43). Then where (Corollary 4.7): Suppose that , , , and . Write Then apply (2.19), (2.20) to bound given in (4.43):

5. Applications

We show that the iterated (modified) Tikhonov regularization operator satisfied Assumption 3.4, 3.5 in Section 5.1 and verify the theoretical convergence rate predicted by Theorem 4.6, Corollary 4.7 in Section 5.2.

5.1. Iterated (Modified) Tikhonov-Lavrentiev Regularization

We will prove that , (Definitions 3.14, 3.15) with the differential filter satisfies Assumptions 3.4, 3.5. Proposition 3.10 implies that it is enough to show that satisfies Assumption 3.4. Additionally, we provide sharpened estimates for , , . The key is that is a continuous function of the Laplace operator and hence they commute (on ). Moreover, is a continuous function of so that commutes with and (on ).

We first characterize the spectrum of , .

Lemma 5.1. Fix . Define and by The maps and are continuous and and .

Proof. The functions , are clearly continuous with   decreasing and increasing on . Hence, the range of is and range of is .

The next result shows that and satisfy part of Assumptions 3.4, 3.5.

Proposition 5.2. and (on and , resp.) are linear, bounded, spd, and commute with , (resp.). Moreover, Hence in Assumptions 3.4, 3.5.

Proof. It is immediately clear that , are linear. As a consequence, since with spectrum in , then with spectrum contained in so that . Therefore, with spectrum contained in . A similar argument shows that has spectrum in , has spectrum in , and has spectrum in . Thus , and and . Therefore, and are bounded and commute with and , respectively, as discussed above.The second set of inequalities on each line can be proved with an appropriate choice of and in Definitions 3.2 and 3.3. Starting with Definition 3.2, take and choose . Then integration by parts and the Cauchy-Schwartz inequality give the result. The discrete form is proved using Definition 3.3 and choosing and .

It remains to provide estimates for and , and sharpened estimates for and . Indeed, as a direct consequence of Propositions 5.3, 5.4, we have, for each ,

Proposition 5.3. Let . Then, for some ,

Proof. Using (1.9), we have Subtracting (5.5) from the identity gives us Multiplying by , rearranging, simplifying, and using (Definition 3.2) gives Applying recursion, we obtain, for any , Thus, taking norms and applying , we get (5.4).

Proposition 5.4. Let . Then

Proof. Let be the -projection of . Take in (3.34). For , let , where , and . Subtract (3.34) and (3.35) to get Take in (5.11) to get Fix . Apply Hölder’s and Young’s inequalities to (5.12) to get Taking and in (5.13) gives The triangle inequality and estimate (5.14) give Backward induction, estimate (5.15), and (2.23) give It has been shown (Estimate (2.36) in the proof of Lemma 2.7 [25]) that Note that . Then, along with application of (2.16), we prove (5.10).

Corollary 5.5 (convergence estimate). Under the assumptions of Corollary 4.7, suppose further that, for some , that , , , . If for some , then

Proof. Apply estimates for , from (5.3), resulting from Propositions 5.3, 5.4.

5.2. Numerical Testing

This section presents the calculation of a flow with an exact solution to verify the convergence rates of the algorithm. FreeFEM++ [32] was used to run the simulations. The convergence rates are tested against the Taylor-Green vortex problem [13, 33–35]. We use a domain of and take , where The pair is a solution the two-dimensional NSE when and .

We used CN discretization in time and P2-P1 elements in space according to Problem 1. That is, we used continuous piecewise quadratic elements for the velocity and continuous piecewise linear elements for the pressure. We chose the spatial discretization elements and parameters , , and as a illustrative example. We chose , , and , where is the number of mesh divisions per side of . These were chosen so that the result of Corollary 5.5 reduces to

We summarize the results in Tables 1 and 2. Table 1 displays error estimates corresponding to no iterations; that is, in Definition 3.14. For the particular choice of and , the computed errors and tend to the predicted convergence rate . Table 2 displays error estimates corresponding to one update; that is, when in Definition 3.14. Again, for the particular choice of and ,the computed errors and tend to the predicted convergence rate .

Table 1: Error and convergence rates for Leray-deconvolution with for the Taylor-Green vortex with , , and . Note the convergence rate is approaching 1 as predicted by (5.21).

m (=1/h)

Rate

Rate

20
0.038975

1.651230

40
0.024334
0.680
1.468510
0.169

60
0.017751
0.778
1.159840
0.582

80
0.013854
0.862
0.935247
0.748

100
0.011255
0.931
0.774285
0.846

Table 2: Error and convergence rates for Leray-deconvolution with for the Taylor-Green vortex with , , and . Note the convergence rate is approaching 2 as predicted by (5.21).

m (=1/h)

Rate

Rate

20
0.023384

1.070400

40
0.009739
1.264
0.640360
0.741

60
0.004997
1.646
0.357779
1.436

80
0.002899
1.892
0.212560
1.810

100
0.001915
1.858
0.136724
1.977

6. Conclusion

It is infeasible to resolve all persistent and energetically significant scales down to the Kolmogorov microscale of for turbulent flows in complex domains using direct numerical simulations in a given time constraint. Regularization methods are used to find approximations to the solution. The modification of iterated Tikhonov-Lavrentiev to the modified iterated Tikhonov-Lavrentiev deconvolution in Definition 3.14 is a highly accurate method of solving the deconvolution problem in the Leray-deconvolution model, with errors when applied to the differential filter. We use this result to show that under a regularity assumption, the error between the solutions to the NSE and to the Leray deconvolution model with time relaxation using the modified iterated Tikhonov-Lavrentiev deconvolution and discretized with CN in time and FE’s in space are .

We also examined the Taylor-Green vortex problem using Problem 1 with the deconvolution in Definition 3.14. We use this problem because it has an exact analytic solution to the NSE. The regularization parameters and were chosen so that the convergence of the approximate solution to the error would be for and . The convergence rates calculated correspond to those predicted, that is for and for .

References

G. P. Galdi, “An introduction to the Navier-Stokes initial-boundary value problem,” in Fundamental Directions in Mathematical Fluid Mechanics, G. Galdi, J. Heywood, and R. Rannacher, Eds., Advances in Mathematical Fluid Mechanics, pp. 1–70, Birkhäuser, Basle, Switzerland, 2000.

C. Foias, D. D. Holm, and E. S. Titi, “The Navier-Stokes-alpha model of fluid turbulence,” Physica D., vol. 152/153, pp. 505–519, 2001.

W. Layton, C. C. Manica, M. Neda, and L. G. Rebholz, “Numerical analysis and computational testing of a high accuracy Leray-deconvolution model of turbulence,” Numerical Methods for Partial Differential Equations, vol. 24, no. 2, pp. 555–582, 2008.

W. Layton, C. C. Manica, M. Neda, and L. G. Rebholz, “Numerical analysis and computational comparisons of the NS-alpha and NS-omega regularizations,” Computer Methods in Applied Mechanics and Engineering, vol. 199, no. 13–16, pp. 916–931, 2010.

W. Layton and M. Neda, “Truncation of scales by time relaxation,” Journal of Mathematical Analysis and Applications, vol. 325, no. 2, pp. 788–807, 2007.

S. Stolz, N. A. Adams, and L. Kleiser, “The approximate deconvolution model for large-eddy simulation of compressible flows and its application to shock-turbulent-boundary-layer interaction,” Physics of Fluids, vol. 13, no. 10, pp. 2985–3001, 2001.

A. Dunca, Space averaged Navier-Stokes equations in the presence of walls [Ph.D. thesis], University of Pittsburgh, 2004.

J. Leray, “Sur le mouvement d'un liquide visqueux emplissant l'espace,” Acta Mathematica, vol. 63, no. 1, pp. 193–248, 1934.

M. Germano, “Differential filters of elliptic type,” The Physics of Fluids, vol. 29, no. 6, pp. 1757–1758, 1986.

M. Bertero and P. Boccacci, Introduction to Inverse Problems in Imaging, Institute of Physics Publishing, Bristol, UK, 1998.

J. T. King and D. Chillingworth, “Approximation of generalized inverses by iterated regularization,” Numerical Functional Analysis and Optimization, vol. 1, no. 5, pp. 499–513, 1979.

W. Layton and L. Rebholz, “Approximate deconvolution models of turbulence approximate,” in Analysis, Phenomenology and Numerical Analysis, Springer Lecture Notes in Mathematics, Philadelphia, Pa, USA, 2012.

I. Stanculescu and C. C. Manica, “Numerical analysis of Leray-Tikhonov deconvolution models of fluid motion,” Computers and Mathematics with Applications, vol. 60, no. 5, pp. 1440–1456, 2010.

C. Brezinski, M. Redivo-Zaglia, G. Rodriguez, and S. Seatzu, “Extrapolation techniques for ill-conditioned linear systems,” Numerische Mathematik, vol. 81, no. 1, pp. 1–29, 1998.

H. Gfrerer, “An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates,” Mathematics of Computation, vol. 49, no. 180, pp. 507–522, 1987.

U. Hämarik, R. Palm, and T. Raus, “Use of extrapolation in regularization methods,” Journal of Inverse and Ill-Posed Problems, vol. 15, no. 3, pp. 277–294, 2007.

U. Hämarik and U. Tautenhahn, “On the monotone error rule for parameter choice in iterative and continuous regularization methods,” Bachelor of Information Technology, vol. 41, no. 5, pp. 1029–1038, 2001.

M. Hanke and C. W. Groetsch, “Nonstationary iterated Tikhonov regularization,” Journal of Optimization Theory and Applications, vol. 98, no. 1, pp. 37–53, 1998.

A. S. Leonov, “On the accuracy of Tikhonov regularizing algorithms and the quasi-optimal choice of regularization parameter,” Doklady Mathematics, vol. 44, pp. 711–716, 1992.

H. W. Engl, “On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems,” Journal of Approximation Theory, vol. 49, no. 1, pp. 55–63, 1987.

H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems, vol. 375 of Mathematics and its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996.

G. Vainikko and A. Y. Veretennikov, Iterative Procedures in Ill-Posed Problems, Nauka, Moscow, Russia, 1982.

V. Girault and P.-A. Raviart, Finite Element Methods for Navier-Stokes Equations, vol. 5 of Springer Series in Computational Mathematics, Springer, Berlin, Germany, 1986.

S. C. Brenner and L. R. Scott, The Mathematical Theory of Finite Element Methods, vol. 15 of Texts in Applied Mathematics, Springer, New York, NY, USA, 1994.

C. Manica and S. K. Merdan, “Convergence analysis of the finite element method for a fundamental model in turbulence,” Mathematical Models and Methods in Applied Sciences, vol. 22, no. 11, 24 pages, 2012.

J. G. Heywood and R. Rannacher, “Finite-element approximation of the nonstationary Navier-Stokes problem. IV. Error analysis for second-order time discretization,” SIAM Journal on Numerical Analysis, vol. 27, no. 2, pp. 353–384, 1990.

J. G. Heywood and R. Rannacher, “Finite element approximation of the nonstationary Navier-Stokes problem. I. Regularity of solutions and second-order error estimates for spatial discretization,” SIAM Journal on Numerical Analysis, vol. 19, no. 2, pp. 275–311, 1982.

Y. He, “A fully discrete stabilized finite-element method for the time-dependent Navier-Stokes problem,” IMA Journal of Numerical Analysis, vol. 23, no. 4, pp. 665–691, 2003.

Y. He, “The Euler implicit/explicit scheme for the 2D time-dependent Navier-Stokes equations with smooth or non-smooth initial data,” Mathematics of Computation, vol. 77, no. 264, pp. 2097–2124, 2008.

Y. He and J. Li, “A penalty finite element method based on the Euler implicit/explicit scheme for the time-dependent Navier-Stokes equations,” Journal of Computational and Applied Mathematics, vol. 235, no. 3, pp. 708–725, 2010.

Y. He and J. Li, “Numerical implementation of the Crank-Nicolson/Adams-Bashforth scheme for the time-dependent Navier-Stokes equations,” International Journal for Numerical Methods in Fluids, vol. 62, no. 6, pp. 647–659, 2010.

O. Pironneau, F. Hecht, and J. Morice, “FreeFEM++,” http://www.freefem.org

A. J. Chorin, “Numerical solution of the Navier-Stokes equations,” Mathematics of Computation, vol. 22, pp. 745–762, 1968.

V. John and W. J. Layton, “Analysis of numerical errors in large eddy simulation,” SIAM Journal on Numerical Analysis, vol. 40, no. 3, pp. 995–1020, 2002.

D. Tafti, “Comparison of some upwind-biased high-order formulations with a second-order central-difference scheme for time integration of the incompressible Navier-Stokes equations,” Computers & Fluids, vol. 25, no. 7, pp. 647–665, 1996.