• 検索結果がありません。

A MULTILEVEL METHOD OF NONLINEAR GALERKIN TYPE FOR THE NAVIER-STOKES EQUATIONS

N/A
N/A
Protected

Academic year: 2022

シェア "A MULTILEVEL METHOD OF NONLINEAR GALERKIN TYPE FOR THE NAVIER-STOKES EQUATIONS"

Copied!
23
0
0

読み込み中.... (全文を見る)

全文

(1)

TYPE FOR THE NAVIER-STOKES EQUATIONS

SAID EL HAJJI AND KHALID ILIAS Received 21 October 2004

The basic idea of this new method resides in the fact that the major part of the relative information to the solution to calculate is contained in the small modes of a development of Fourier series; the raised modes of which the coefficients associated being small, being negligible to every instant, however, the effect of these modes on a long interval of time is not negligible. The nonlinear Galerkin method proposes economical treatment of these modes that permits, in spite of a simplified calculation, taking into account their interac- tion correctly with the other modes. After the introduction of this method, we elaborate an efficient strategy for its implementation.

1. Introduction

The numerical integration of the Navier-Stokes equations on large intervals of time yields new problems and new challenges with which we will be faced in the coming years.

Indeed, the considerable increase in the computing power during the last years makes it thinkable to solve these equations and similar ones in dynamically nontrivial situa- tions.

In relation with the recent developments in the theory of dynamical systems and its ap- plication to the theoretical survey of the turbulent phenomena (attractors, inertial man- ifolds), new algorithms have been introduced by Foias et al. in [6], as well as Marion and Temam in [12].

These methods of multiresolution, also named nonlinear Galerkin methods, essen- tially apply to the approximation of nonlinear dissipative systems, as the equations of Navier-Stokes. Based on a decomposition of the unknowns, as the velocity field, into small and large eddies, Foias, Manley, and Temam defined new objects: the approximate inertial manifolds [6]. These manifolds define an adiabatic law, modeling the interac- tion of the different structures of the flow, the small structures are in fact expressed as a nonlinear function of large scales. Moreover, these Manifolds enjoy the property that they attract all the orbits exponentially fast in time and that they contain the attractor in a thin neighborhood. They provide a good way to approach the solutions of the Navier-Stokes equations.

Copyright©2005 Hindawi Publishing Corporation Mathematical Problems in Engineering 2005:3 (2005) 341–363 DOI:10.1155/MPE.2005.341

(2)

These approximate inertial manifolds are subsets of the phase space and consist of an approximation form of the small scale equations.

The nonlinear Galerkin method, proposed by Marion and Temam [12], consists of looking for a solution lying on these specific subsets of the phase space.

The first computational tests of this new method were conducted by Jauberteau [10], Jauberteau et al. [11] in the bidimensional case, where the exact solutions of the equations were known, they seem appropriate for long time integration of Navier-Stokes equations.

Numerical simulation of turbulent flows being performed at a small fraction of the computational effort is usually required by traditional methods, see [4].

Our aim in this article is to study the implementation of the nonlinear Galerkin method in the context of pseudospectral discretization for the three-dimensional Navier- Stokes equations. Other aspects of multilevel methods of Galerkin type appear in [5] by Dubois et al.

After describing the method, we report on numerical computations based on this ap- proach. They show an improvement in stability and precision and a significant gain in computing time.

The calculations of Examples 1 and 2 have been, respectively, carried out on the Cray-2 and Titan.

2. The nonlinear Galerkin method

In this part, we consider the incompressible flows of which the velocity fieldu=(u1,u2, u3) in dimension 3 verifies the Navier-Stokes equations:

∂u

∂t νu+ (w×u) +1

2∇|u|2+p=f, (2.1)

∇ ·u=0, (2.2)

u(x,t=0)=u0(x), (2.3)

whereνis the kinematic viscosity,w(x,t)= ∇ ×u(x,t) the vorticity, pthe pressure, and f the external force.

Here,| − |stands for the Euclidean norm inR3.

Moreover, we imposeuandpto be periodic in space. Hence, they can be expanded in Fourier series, namely,

u(x,t)=

k∈Z3

uk(t)eik·x, (2.4)

and similarly for f(x,t) andp(x,t).

We now introduce the orthogonal projectionPdivonto the divergence free space;Pdiv

can be easily expressed as

Pdivφ(x)=

k∈Z3

φk k

|k|2 k·φk

eik·x, (2.5)

whereφ(x)=

k∈Z3φkeik·x.

(3)

Assuming thatuandplie in the proper Hilbert spaces and applyingPdivto the Navier- Stokes equations (2.1) can be put then under the following abstract form:

∂u

∂t νu+B(u,u)=g, (2.6)

whereg=Pdivf andB(u,u) is a bilinear form defined by B(u,u)=Pdiv(w×u)

=

k∈Z3

(w×u)k k

|k|2k·(w×u)k

eik·x. (2.7) The numerical procedures are directly applied to this last form of the Navier-Stokes equa- tions. This formulation is very useful in practice and allows to reduce the memory size of the codes.

Based on the limit conditions, it is natural to approach (2.6) by a pseudospectral Galerkin method [2], based on a development ofuin Fourier series.

We introduce the following decomposition:

uN=yN1+zN1 withN1N, (2.8) where

yN1=PN1uN,

zN1=QN1uN. (2.9)

PN1andQN1are operators of projection onto the space of Fourier.yN1represents the large scales (structures) of the flow,zN1the small scales.

After projection of (2.6) on the spacesPN1andQN1, the variablesyN1andzN1are then solution of the coupled system according to

d yN1

dt νyN1+PN1ByN1+zN1,yN1+zN1

=PN1g, dzN1

dt νzN1+QN1ByN1+zN1,yN1+zN1

=QN1g.

(2.10)

Due to the bilinearity ofB, we can split the nonlinear termB(uN,uN) into BuN,uN

=ByN1+zN1,yN1+zN1

=ByN1,yN1+Bint

yN1,zN1, (2.11) whereB(yN1,yN1) is the nonlinear term associated toyN1, andBint(yN1,zN1)=B(yN1,zN1) +B(zN1,yN1) +B(zN1,zN1) is the coupling term and interaction between small and large structures.

In [6], Foias et al. showed that forNandN1sufficiently large and after one period of transition depending on the data, some quantities functions ofzare negligible in relation

(4)

to the other terms of the equation. On the other hand, since the evolution ofz, compared toy, is quasistatic, we will study the approached system according to

d yN1

dt νyN1+PN1ByN1,yN1

+PN1Bint

yN1,zN1

=PN1g, (2.12)

νzN1+QN1ByN1,yN1

=QN1g. (2.13)

The nonlinear Galerkin method introduced by Marion and Temam [12] and Foias et al. [6] consists of looking for an approximation of the solutionugiven by

uN=yN1+zN1 withN1N (2.14) anduNsatisfied the system (2.12), (2.13).

We recall that the classical (usual) Galerkin method ofuconsists of puttingzN1=0 in (2.12), thereforePN1Bint(yN1,zN1) is neglected.

Equation (2.13) provides a nonlinear interaction law between large and small struc- tures. It is the equation of approximate inertial manifold [6].

The small scales are explicitly (approximately) given in terms of the large scales by zN1=φyN1

=(ν)1QN1ByN1,yN1

QN1g. (2.15)

3. Description of the multilevel method

The small scales and the coupling terms can be fixed in time during few iterations. How- ever, the order of their size can change rigorously during one period of time. So the cutoff N1defining the separation of the small and large scales cannot be fixed in time. We pro- pose a multilevel adaptative procedure valuing the appropriate levels of the refinement in time, by using the theoretical arguments in [6]. The implementation is achieved then by a succession of cycles defined by two levels of the cutoffNi1andNi2as in the classical multigrid methods [1,8].

One chooses a numberN that represents the total number of the modes retained of the solutionuby truncation

uN=

kIN

uk(t)eik·x, (3.1)

whereIN=[1N/2,N/2]3.

Nis valued according to the following criteria:

(i) convergence of the truncated series uN: the energy spectrum having a zone of strong decrease forklarge (viscous zone in turbulence);

(ii) for nonexact solutions, we have to estimate the number of degrees of liberties required for a correct description of the attractor (evaluation via the number of Reynolds).

OnceNis determined, we choose a time stepttaking account of the restriction coming from the numerical stability.

(5)

Knowing the maximal numberN of modes, we define valuesNidetermining coarse grids

N1< N2<···< Ni< Ni+1<···< N (3.2) which are going to allow us to decompose the solutionuNunder the form

uN=yNi+zNi. (3.3)

One must haveNiunder the form 2p×3q×5r,p2,q,rN, to permit the use of the fast Fourier transform (FFT).

The scheme of temporal integration for the nonlinear Galerkin method is based on a multigrid cycle and a quasistatic integration of the most high modes of the approximation uN.

In the beginning of the cycle, we suppose that the approximationuNis known at the timetn1=(n1)t. The computation ofuNat the instanttnis done by the integration of the system (2.6) as for the pseudospectral Galerkin method, that is, without separation of the scales, by a method of quadrature for the linear term and an explicit Runge-Kutta method of order 3 for the nonlinear term.

KnowinguN at the instanttn, we define two coarse levelsNi1(tn) andNi2(tn) by the following tests:i1is determined by the condition

zNi

tn yNi 2

tn

2

<Tol 0 ii1, (3.4)

i2is determined by the condition zNi

tn

yNitn22 <Tol 1 ii2, (3.5)

where Tol 0 and Tol 1 are two constants given and fixed in the beginning of the cycle.| · |2

is the norm inL2.

The test (3.5) assures us that|zNi2|2 is the order of the precision of the numerical scheme of integration in time (t3).

The test (3.4) assures us a predominance ofyNibeforezNifor allii1.Ni1defines the minimal level also on which we can use the quasistatic approximation again for the high modeszand justify the fact to choose the nonlinear terms of interaction with their value to the last instant of integration ofz. The refinement of the levels betweenNi1(tn) and Ni2(tn) is

Ni1< Ni1+1<···< Ni<···< Ni21< Ni2 (3.6) which corresponds to (i2i1+ 1) levels.

(6)

As in the classical multigrid methods, we use the concept of V-cycle to improve the integration of (2.6) on the interval [tn,tn+ Maxinct]. A multigrid cycle is divided on some subcycles (V-cycles) including each a phase of coming down and a phase of ascent.

(i)Phase of coming down.On the interval [tn,tn+ (i2i1)t], the levelNi(t) is de- fined by

Ni(t)=Ni2j, j=0,. . .,i2i1, (3.7) Ni(t) decreases fromNi2(tn) toNi1(tn).

(ii)Phase of ascent. On the interval [tn+ (i2i1)t,tn+ (2(i2i1) + 1)t], the level Ni(t) is defined by

Ni(t)=Ni1+(ji2+i11), j=i2i1+ 1,. . ., 2i2i1

+ 1, (3.8)

Ni(t) increases fromNi1(tn) toNi2(tn).

Then, a V-cycle consists of [2(i2i1) + 1] temporal iterations.

Maxinc is the maximal number of iterations to make a complete cycle (it is a multiple of [2(i2i1) + 1]). Lettbe an intermediate value in time on the interval [tn,tn+ Maxinct], then the current levelNi(t) is given by

Ni(t)=

Ni2r+1, si 1ri2i1,

Ni1+(r(i2i1+1)), sii2i1+ 1r2i2i1

, (3.9)

whereris given by

ttn=

2pi2i1

+rt. (3.10)

Knowing the sizeNiof the coarse level at the instantt, we decomposeuN(t) into uN(t)=yNi(t) +zNi(t), (3.11) whereyNi(t) represents the large scales andzNi(t) the small scales.

The computation of both componentsyNi(t) andzNi(t) are performed as follows.

(i)Computation of zNi(t).

zNi(t)=zNi(tt), (3.12)

zNi(t) is frozen and set to its last value, that is, its temporal variations are ne- glected.

(ii)Computation of yNi(t). In order to evaluate yNi(t), we integrate (2.12) over the interval [tt,t], then we obtain

yk(t)=eν|k|2tyk(tt) +

t

tteν|k|2(tτ)gk(τ)Bk

yNi(τ),yNi(τ)

t

tteν|k|2(tτ)Bint,kyNi(τ),zNi(τ)

(3.13)

for allkINi=[1Ni/2,Ni/2]3.

(7)

The first integral of (3.13) is approached by an explicit Runge-Kutta scheme of order 3.

With this scheme, the interval [tt,t] is divided into 3 subintervals of the form [ti,ti+1] where t0=ttandt3=t. The second integral carrying on the terms of in- teractions is calculated by making a quasistatic approximation on these terms, which is equivalent to approaching this integral by an explicit Euler scheme of order 1 on the subintervals [ti,ti+1],i=0, 1, 2. At the end the cycle, that is, att=tn+ Maxinct,zNi2(t) is revalued by projecting the solution on the approximate inertial manifold of the form

zNi(t)=φyNi(t) (3.14)

for every intermediate level,Ni[Ni1,Ni2], the coupling nonlinear termsBint(yNi,zNi) are frozen on the interval [tn,tn+ Maxinct], revalued then at the end of the cycle.

At the end of the cycle, we evaluate new values of the two levelsNi1andNi2by the tests (3.4) and (3.5) and we start again the procedure.

The interaction between the different scales of the flow is taken then into account of simplified manner. We define 3 dynamical zones on the whole of the excited modes:

(1) a zone entirely included in the zone of dissipation named quasistatic zone (k Ni2) defining the small scales frozen and then relaxed (these small scales and their interactions with the large ones are indeed negligible locally in time but not long- term);

(2) a transition zone (Ni1kNi2) or intermediate zone; use of a multigrid V-cycle strategy between the two levelsNi1andNi2to assure a transition between a sta- tionary approximation (zone (1)) and an integration in time with a time stept (zone (3));

(3) dynamical zone defining the large scales (kNi1) calculated to every time step t by a quadrature method for the exact integration of the linear part, by an explicit Runge-Kutta scheme of order 3 for the nonlinear termB(y,y), and by one quasistationary approximation for the coupling nonlinear termsBint(y,z).

The multigrid methods permit to accelerate the convergence of an iterative method by obtaining the same precision that if one had only used the fine grid. In the same way, the nonlinear Galerkin method permits to accelerate the process of evolution, with the same precision of the classical Galerkin method (usual) toNmodes (Nbeing the number of modes on the fine grid).

4. Numerical results

We compare the two methods: usual Galerkin (UG) and nonlinear Galerkin (NGL) on examples of which we know the exact solution (uex). We can compare then the precision of the two methods and the time CPU consumed by iteration in time.

4.1. Example 1

4.1.1. Simplified description of the example. The goal is to find a periodic solution in space of the equations of Navier-Stokes in dimension 3 having an energy spectrum with an inertial zone of slopek5/3(Kolmogorov) with a predominant peak centered in one mode

(8)

and a viscous zone to fast decrease of the energy. In spite of the fact that this type of solutions is artificial, these solutions present the structures of different sizes. We impose, moreover, that the small structures do not follow the same temporal evolution as the large structures.

Such example can be considered as one approach in three-dimensional turbulence.

We give the equation of Navier-Stokes:

∂u

∂t νu+B(u,u)=f, (4.1)

uis periodic in space in the 3 directions. We can decomposeuin Fourier series:

u(x,t)=

k∈Z3

uk(t)eik·x. (4.2)

For a fixedNN, we define the truncated series uN(x,t)=

kIN

uk(t)eik·x, (4.3)

whereIN=[1N/2,N/2]3is a subspace ofZ3.uN=PNuwherePNis the operator of pro- jection on the subspace spanned by (eik·x)kN/2.uNpossesses energy spectrumE(k,t) having the following form (seeFigure 4.7):

E(k,t)=

l=(k1,k2,k3),k12+k22+k23=k2

u1,l2+u2,l2+u3,l2, k 1,N

2

. (4.4)

With the help ofE(k,t), we determine the coefficients of FourierukofuN. SoPNf is determined by

PNf =duN

dt ν+PNBuN,uN

. (4.5)

The energy spectrum is written as

E(k,t)=c1k5/3, kKN1,KN1<N 2, EkF,t=CF(t)c1k5/3, kFKN1,

E(k,t)=G(k,t), k > KN1,KN1<N 2, G(k,t)=expLog(10)gLog10(k),t,

(4.6)

where

g(x,t)=gx1,t5 3

xx1

eα(t)(xx1) (4.7)

(9)

(withG(KN1,t)=E(KN1,t),gfunction of classC1), x1=Log10KN1

, x2=Log10KN2

, α(t)= 1

x2x1Log 3

5

Log10C2(t)+gx1,t x2x1

, EKN2,t=GKN2,t=C2(t),

(4.8)

C2is one bounded function (C2[c2 min,c2 max]).

In this example,

CF(t)= 1 10

cos(t) sin2t+ 2.5 exp0.5(t5)2 + exp0.25(t7)2+sin27t

5

+ 1,

(4.9)

C2(t) is determined by

F(t)= 15 k=1

exp

cos

10

kk(2.5 + 0.25t)0.3 sin

0.802π 10kkt

+ 10 exp(t5)2,

(4.10)

Fmin=min(F(t)) andFmax=max(F(t));

Dev=c2 maxc2 min

FmaxFmin

, C2(t)=c2 min+ DevF(t)Fmin

,

(4.11)

CF(t) contributes to the evolution of the low modes of the solution.C2(t) contributes to the evolution of the high modes of the solution.

4.1.2. Significance of the parameters.

(i)tdenotes time step (=0.25102).

(ii)νdenotes viscosity (=0.1101).

(iii)Ndenotes the total number of modes used for the spectral discretisation in space (=48), that is, 483unknown.

(iv) Tol 0 denotes parameter intervening in the multigrid strategy to define the min- imal level of the coarse gridsNi1(=0.2106).

(v) Tol 1 denotes parameter intervening in the multigrid strategy to define the max- imal levelNi2of the coarse grids during a cycle (=0.2108).

(10)

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 0.1E08

0.251E08 0.631E08 0.158E07 0.398E07 0.1E06 0.251E06 0.631E06 0.158E05 0.398E05 0.1E04

G(t)

NGL UG

Figure 4.1. Relative error in normL2(uuexL2/uexL2).

(vi) Maxinc denotes parameter fixing the number of temporal iterations of a multi- grid cycle.

(vii)KN1denotes parameter in the energy spectrum defining the solution (=4).

(viii)KN2denotes parameter in the energy spectrum defining the solution (=12).

(ix)c1denotes parameter in the spectrum (=5).

(x)c2 minandc2 maxdenote the bounds of the temporal functionC2(=0.5105and 0.5104).

4.1.3. Commentary on the figures. Figures4.1and4.2compare the precision of the two methods: UG and NGL.Figure 4.1measures the relative error in normL2, that is, globally in the whole domain.Figure 4.2measures the relative error in normL, that is, locally.

As we can note, the precision obtained with NGL remains near the one obtained with UG.Figure 4.3shows that the gain of computing time of NGL in comparison with UG is between 20% and 30%, we can explain this by the fact that we calculate less often the coefficients associated to the elevated modes by using coarse grids on which are only valued the coefficients associated to the small modes.

Figure 4.4represents the evolution of CPU time consumed in seconds for UG and NGL and justify the gain of computing time of NGL in comparison with UG.

The method NGL permits to get a better numerical stability than the method UG; the coefficients associated to the most elevated modes being the smallest. It is in the calcu- lation of these coefficients that the relative errors made are the biggest. Contrary to the method UG, in not valuing the coefficients associated to the raised modes to every step of time, the method NGL permits to avoid the accumulation on every step of time of the errors made in the calculation of these coefficients, improving the stability.

(11)

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 0.1E07

0.2E07 0.398E07 0.794E07 0.158E06 0.316E06 0.631E06 0.126E05 0.251E05 0.501E05 0.1E04

G(t)

NGL GU

Figure 4.2. Relative error in normL(uuexL/uexL).

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 0.1E+ 00

0.14E+ 00 0.18E+ 00 0.22E+ 00 0.26E+ 00 0.3E+ 00 0.34E+ 00 0.38E+ 00 0.42E+ 00 0.46E+ 00 0.5E+ 00

G(t)

Figure 4.3. Gain of computing time for NGL over UG.

Figure 4.5shows the evolution of the lower envelope of the levels of coarse grids (Ni1) with the method NGL, andFigure 4.6represents the time evolution of the ratiozL2/ yL2on this lower envelope. This ratio remains lower than 0.2106which is Tol 0. It jus- tifies the quasistatic approximation of the raised modes and of the terms of interactions.

(12)

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 0.811E+ 02

0.1E+ 04 0.193E+ 04 0.285E+ 04 0.377E+ 04 0.469E+ 04 0.561E+ 04 0.654E+ 04 0.746E+ 04 0.838E+ 04 0.93E+ 04

G(t)

NGL GU

Figure 4.4. Comparison of CPU times (in seconds) by NGL and UG.

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 8

16 24 32 36 40 48

G(t)

NGL

Figure 4.5. Lower envelope of the levels of discretization.

The abrupt oscillations of this ratio correspond to the changes of levels of the lower envelope.

(13)

3.6 4 3.2 2.8 2.4 1.6 2 1.2 0.8 0.4 0

t 0.619E08

0.903E08 0.132E07 0.192E07 0.28E07 0.408E07 0.596E07 0.869E07 0.127E06 0.185E06 0.27E06

G(t)

NGL

Figure 4.6. Time evolution ofzL2/yL2on the lower envelope.

41.6 28.6 19.7 13.6 9.4 6.5 4.4 3.1 2.1 1.5 1

k 0.36E21

0.727E19 0.147E16 0.297E14 0.599E12 0.121E09 0.244E07 0.493E05 0.995E03 0.201E+ 00 0.405E+ 02

E(k)

Figure 4.7. Energy spectrum att=4.00 by NGL.

Figure 4.7represents the energy spectrum of the solution calculated with NGL att=4;

we note that this spectrum is in conformity with the data of the exact solution.

The vorticity plays an important role in the generation of small scales in space driving to the turbulence. Figures4.8and4.9represent the isovorticity lines calculated with NGL

(14)

2PI 0

NGL 0

2PI

Figure 4.8. Isovorticity lines att=0.0 by NGL.

2PI 0

NGL 0

2PI

Figure 4.9. Isovorticity lines att=4.0 by NGL.

att=0 and att=4 on the planz=π, we notice the distortion of the large structures un- der the action of other large structures and of smaller structures. This distortion drives to the shearing of these large deformed structures and to the creation of new smaller struc- tures that finish by disappearing. Large structures are created by the action of external force. The large structures that occupy the corners of the domain are directly supplied by external force.

4.2. Example 2

g(t)= 1 10

cos(4.8t) + cos(3.2πt) + 0.5 exp3 sin(1.6t)+ 3. (4.12)

(15)

10 9 8 7 6 5 4 3 2 1 0

t 0.1E08

0.1E05 0.2E05 0.3E05 0.4E05 0.5E05 0.6E05 0.7E05 0.8E05 0.9E05 0.1E04

G(t)

NGL GU

Figure 4.10. Relative error in normL2(uuexL2/uexL2).

The exact solutionuex=(u1,u2,u3),

u1=g(t) exp(cosy), u2=g(t) exp(cosz), u3=g(t) exp(cosx).

(4.13)

The external force is written as f(x,t)=duex

dt νuex+PNBuex,uex

, (4.14)

the number of modesN=24, that is, 243unknown,ttime step=5.103, and the vis- cosityν=102.

Figures4.10and4.11measure the relative error in normsL2andLfor UG and NGL.

The curves obtained with UG and NGL are practically identical: the precisions obtained by the two methods are practically the same.

Figure 4.12shows the gain of computing time of NGL in comparison with UG which is the order of 30%.

Figure 4.13shows the evolution of CPU time consumed in seconds for UG and NGL.

Figures4.14and4.15represent the time evolution, respectively, of the quantitiesyL2

for UG on different levels and forzL2.

Figures4.16and4.17show the evolution of yandzduring the time in normL2with NGL. We can compare these figures with Figures4.14and4.15, we note that the time evolutions ofyin these figures for UG and NGL are identical (convergence ofuN).

(16)

10 9 8 7 6 5 4 3 2 1 0

t 0.1E08

0.1E05 0.2E05 0.3E05 0.4E05 0.5E05 0.6E05 0.7E05 0.8E05 0.9E05 0.1E04

G(t)

NGL GU

Figure 4.11. Relative error in normL(uuexL/uexL).

10 9 8 7 6 5 4 3 2 1 0

t 0.1

0.17 0.24 0.31 0.38 0.45 0.52 0.59 0.66 0.73 0.8

G(t)

Figure 4.12. Gain of computing time for NGL over UG.

For the evolution ofz, for N1=12 and 16, UG and NGL are practically identical whereas for the level 20, the difference betweenzNGLandzUGremains lower to the preci- sion of the time scheme.

(17)

10 9 8 7 6 5 4 3 2 1 0

t 395.874

5763.125 11130.376 16497.627 21864.877 27232.127 32599.379 37966.633 43333.883 48701.133 54068.383

G(t)

NGL GU

Figure 4.13. Comparison of CPU times (in seconds) by NGL and UG.

10 9 8 7 6 5 4 3 2 1 0

t 0.109E+ 01

0.538E+ 01 0.119E+ 02 0.183E+ 02 0.248E+ 02 0.313E+ 02 0.378E+ 02 0.443E+ 02 0.507E+ 02 0.572E+ 02 0.637E+ 02

G(t)

N1=12, GU N1=16, GU N1=20, GU

Figure 4.14. Time evolution ofyN1L2forN1=12, 16, and 20 by UG.

(18)

10 9 8 7 6 5 4 3 2 1 0

t 0.726E09

0.327E08 0.147E07 0.664E07 0.299E06 0.135E05 0.607E05 0.274E04 0.123E03 0.556E03 0.25E02

G(t)

N1=12, GU N1=16, GU N1=20, GU

Figure 4.15. Time evolution ofzN1L2forN1=12, 16, and 20 by UG.

10 9 8 7 6 5 4 3 2 1 0

t 0.109E+ 01

0.538E+ 01 0.119E+ 02 0.183E+ 02 0.248E+ 02 0.313E+ 02 0.378E+ 02 0.443E+ 02 0.507E+ 02 0.572E+ 02 0.637E+ 02

G(t)

N1=12, NGL N1=16, NGL N1=20, NGL

Figure 4.16. Time evolution ofyN1L2forN1=12, 16, and 20 by NGL.

(19)

10 9 8 7 6 5 4 3 2 1 0

t 0.873E09

0.386E08 0.17E07 0.752E07 0.332E06 0.147E05 0.648E05 0.286E04 0.126E03 0.558E03 0.246E02

G(t)

N1=12, NGL N1=16, NGL N1=20, NGL

Figure 4.17. Time evolution ofzN1L2forN1=12, 16, and 20 by NGL.

5. Stability analysis and estimation

In [10], Jauberteau find again the CFL stability condition done in [7], for nonlinear Galerkin method:

tNuN

L< α withα <1. (5.1) In [15], Temam describes some numerical schemes for the approximation of nonlinear evolution equations, in particular, Navier-Stokes equations, and studies the stability of the schemes, in particular, nonlinear Galerkin schemes.

We introduce two norms inL2andH1:

|ϕ|2=

ϕ(x,t)2dx 1/2

, ϕ =

ϕ(x,t)2dx

1/2 (5.2)

for any given fieldϕ(x,t)=1(x,t),ϕ2(x,t),ϕ3(x,t)), Ω=

i=3

i=1

(0, 2π). (5.3)

参照

関連したドキュメント

Recently, Velin [44, 45], employing the fibering method, proved the existence of multiple positive solutions for a class of (p, q)-gradient elliptic systems including systems

Furthermore, the upper semicontinuity of the global attractor for a singularly perturbed phase-field model is proved in [12] (see also [11] for a logarithmic nonlinearity) for two

Lions studied (among others) the compactness and regular- ity of weak solutions to steady compressible Navier-Stokes equations in the isentropic regime with arbitrary large

In this work, we have applied Feng’s first-integral method to the two-component generalization of the reduced Ostrovsky equation, and found some new traveling wave solutions,

A new method is suggested for obtaining the exact and numerical solutions of the initial-boundary value problem for a nonlinear parabolic type equation in the domain with the

In Section 7, we will provide a method for computing the free divisibility indicator of a symmetric measure and show that ultraspherical distributions and t-distributions mostly

[9, 28, 38] established a Hodge- type decomposition of variable exponent Lebesgue spaces of Clifford-valued func- tions with applications to the Stokes equations, the

This article is devoted to establishing the global existence and uniqueness of a mild solution of the modified Navier-Stokes equations with a small initial data in the critical