Weights Design For Maximal Order WENO Schemes

May 25, 2017 | Author: Pep Mulet | Category: Applied Mathematics, Scientific Computing, Numerical Analysis and Computational Mathematics
Report this link


Description

See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/259635157

Weights Design For Maximal Order WENO Schemes Article in Journal of Scientific Computing · September 2013 DOI: 10.1007/s10915-013-9810-0

CITATIONS

READS

5

58

3 authors: Francesc Aràndiga

M. C. Martí

University of Valencia

University of Concepción

44 PUBLICATIONS 534 CITATIONS

5 PUBLICATIONS 14 CITATIONS

SEE PROFILE

SEE PROFILE

Pep Mulet University of Valencia 52 PUBLICATIONS 1,700 CITATIONS SEE PROFILE

All content following this page was uploaded by M. C. Martí on 18 November 2014. The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document and are linked to publications on ResearchGate, letting you access and read them immediately.

J Sci Comput (2014) 60:641–659 DOI 10.1007/s10915-013-9810-0

Weights Design For Maximal Order WENO Schemes F. Aràndiga · M. C. Martí · P. Mulet

Received: 3 May 2013 / Revised: 21 October 2013 / Accepted: 2 December 2013 / Published online: 12 December 2013 © Springer Science+Business Media New York 2013

Abstract Weighted essentially non-oscillatory (WENO) finite difference schemes, developed by Liu et al. (Comput Phys 115(1):200–212, 1994) and improved by Jiang and Shu (Comput Phys 126(1):202–228, 1996), are one of the most popular methods to approximate the solutions of hyperbolic equations. But these schemes fail to provide maximal order accuracy near smooth extrema, where the first derivative of the solution becomes zero. Some authors have addressed this problem with different weight designs. In this paper we focus on the weights proposed by Yamaleev and Carpenter (J Comput Phys 228:4248–4272, 2009). They propose new weights to provide faster weight convergence than those presented in Borges et al. (J Comput Phys 227:3191–3211, 2008) and deduce some constraints on the weights parameters to guarantee that the WENO scheme has maximal order for sufficiently smooth solutions with an arbitrary number of vanishing derivatives. We analyze the scheme with the weights proposed in Yamaleev and Carpenter (J Comput Phys 228:4248–4272, 2009) and prove that near discontinuities it achieves worse orders than classical WENO schemes. In order to solve these accuracy problems, we define new weights, based on those proposed in Yamaleev and Carpenter (J Comput Phys 228:4248–4272, 2009), and get some constraints on the weights parameters to guarantee maximal order accuracy for the resulting schemes. Keywords High resolution shock capturing schemes · Non linear reconstructions · Weighted ENO

This research was partially supported by Spanish MINECO Grant MTM 2011–22741. F. Aràndiga · M. C. Martí · P. Mulet (B) Departament de Matemàtica Aplicada, Universitat de València, Valencia, Spain e-mail: [email protected] F. Aràndiga e-mail: [email protected] M.C. Martí e-mail: [email protected]

123

642

J Sci Comput (2014) 60:641–659

1 Introduction Weighted essentially non-oscillatory (WENO) finite difference [4] schemes are popular methods for approximating solutions to hyperbolic conservation equations. This technique, proposed by Liu et al. [9] and improved by Jiang and Shu [8], constitutes an improvement of the ENO technique, first introduced by Harten et al. [6]. WENO schemes use a convex combination of the different polynomial reconstruction candidates of the ENO method, instead of selecting one of them. A weight, which depends on the smoothness of the function on the corresponding stencil, is assigned to each polynomial reconstruction, so that polynomials corresponding to singularity-crossing stencils should have a negligible contribution to the convex combination. Jiang and Shu [8] presented an smoothness measurement of the reconstructed function which is more efficient than that proposed by Liu et al. Using the indicator of smoothness introduced by Liu et al. [9], an r − th order ENO scheme can be converted into an (r + 1) − th order WENO scheme, whereas Jiang and Shu’s smoothness indicators provide the maximal order, 2r − 1, which can be attained with 2r − 1 data. But, as has been shown in [2,7,15], the classical weight functions for the fifth-order WENO scheme fail to provide the maximal order of convergence near smooth extrema, where the first derivative of the solution becomes zero. Recently, new approaches have been proposed to solve this problem. In [7] a simple modification of the original scheme is found to be sufficient to give maximal order convergence even near critical points. In [2] new weights are built for the fifth-order WENO scheme, providing new WENO schemes with less dissipation and higher resolution than classical WENO schemes. In [15], Yamaleev and Carpenter propose new weights to provide faster error convergence than those presented in [2], and find some constraints on the weights parameters to guarantee that the WENO scheme has maximal order for sufficiently smooth solutions with an arbitrary number of vanishing derivatives. In this paper we analyze the structure of the new weights proposed in [15] and we prove that near discontinuities the scheme drops to first order, instead of achieving the same order as the classical ENO scheme does. We also study the role of the parameter ε appearing in the definition of the weights to avoid null denominators and its relationship with the loss of accuracy near discontinuities and extrema of the reconstructed functions and we also find some constraints on this parameter in order to guarantee maximal order of accuracy in smooth regions, even at extrema. Finally, we solve these accuracy problems by deriving new weights from those developed in [15]. The outline of the paper is as follows: in Sect. 2 we review the WENO reconstruction technique and the different weights proposed in [2,7,15] to define new WENO methods with better resolution than the classical WENO method [8,9]. We analyze the weights developed by Yamaleev and Carpenter [15], showing that schemes with these weights achieve only first order accuracy near discontinuities. In Sect. 3 we propose new weights to solve those accuracy problems and we get some constraints on the weights parameter ε to guarantee that the new WENO scheme has maximal order for sufficient smooth solutions with an arbitrary number of vanishing derivatives. Furthermore, in Sect. 4, we present numerical experiments that assess our theoretical results. Finally, in Sect. 5 some conclusions are drawn.

2 WENO Finite Difference Schemes Since finite differences WENO schemes (see [12]) can be naturally extended to multiple dimensions by design and to systems via local characteristic decompositions, for the exposi-

123

J Sci Comput (2014) 60:641–659

643

tion’s sake, we restrict ourselves to one-dimensional scalar conservation laws with properly prescribed initial and boundary conditions on some interval, which are written as: u t + F(u)x = 0.

(1)

Consider a uniform grid on [0, 1] defined by the points x j = ( j + 21 )h, j = 0, . . . , N − 1, which are called cell centers, with cell boundaries given by x j+ 1 = x j + h2 , where h = 1/N 2 is the uniform grid spacing. In order to obtain high order finite difference conservative schemes to solve this conservation law, we use Shu and Osher’s technique [12]. Following this technique, the conservative property of the spatial discretization is obtained by implicitly defining the function f as: 1 F(u(x)) = h

x+ h2



f (ξ )dξ , x− h2

so that the spatial derivative in (1) is exactly obtained by a conservative finite difference formula at the cell boundaries,      1 h h ut + f x+ − f x− = 0. h 2 2   Highly accurate approximations to f x ± h2 may be computed using known grid values of F (which are cell-averages of f ) and a reconstruction method. If fˆ is an approximation to f obtained from point values of F in an stencil around x j+ 1 such that f (x j+ 1 ) = 2 2 fˆ(x 1 ) + d(x 1 )h r + O(h r +1 ), for a Lipschitz function d, then we can discretize j+ 2

j+ 2

(F(u))x (x j ) =

fˆ(x j+ 1 ) − fˆ(x j− 1 ) 2

2

x

+ O(h r ).

In this work, we obtain fˆ by the WENO reconstruction method which appeared in [9]. The final conservative scheme can be obtained by the method of lines, by using an appropriate ODE solver (see [12]). This scheme would have a formal spatial order of r . For large r one thus obtains highly accurate schemes for smooth solutions, although when discontinuities appear or are present in the initial condition the schemes are at most first order accurate (see [3,5]). Despite this fact, the high spatial order schemes usually yield better resolution near discontinuities than lower order methods. In the rest of the paper, we focus on the approximation of f (x j+ 1 ). If we denote Sk , 2 k = 0, . . . , r − 1, the r candidate stencils Sk = {x j+k−r +1 , . . . x j+k }, k = 0, . . . , r − 1, and pkr (x) the (r −1)-th degree polynomial reconstruction defined on the stencil Sk , satisfying pkr (x j+ 1 ) = f (x j+ 1 ) + O(h r ) , then a WENO reconstruction of f is given by a convex 2 2 combination: q(x j+ 1 ) = 2

r −1  k=0

wk pkr (x j+ 1 ), wk ≥ 0, k = 0, . . . , r − 1, 2

r −1 

wk = 1.

(2)

k=0

123

644

J Sci Comput (2014) 60:641–659

The weights wk should be selected with the goal of achieving the maximal order of accuracy 2r − 1 wherever f is smooth (see [10]), and r − th order, like the ENO algorithm, elsewhere. As in the original WENO approach [9], we first note that for r ≥ 2, coefficients Ckr , called optimal weights, can be computed such that: −1 pr2r−1 (x j+ 1 ) = 2

r −1 

Ckr pkr (x j+ 1 ), Ckr ≥ 0, k = 0, . . . , r − 1, 2

k=0

r −1 

Ckr = 1.

k=0

In Aràndiga et al. [1], give different explicit formulae for the polynomial reconstructions and the optimal weights. Notice that, to satisfy the requirements on the nonlinear weights wk , one can define them verifying the condition: wk = Ck + O(h m ),

k = 0, . . . , r,

(3)

with m ≤ r − 1. Then, it holds (see [9], [1]) that f (x j+ 1 ) − q(x j+ 1 ) = O(h r +m ), 2

2

(4)

and, if m = r − 1 in (3), then the approximation (4) has maximal order 2r − 1. Weights satisfying these conditions are defined in [9] as follows: αk wk = r −1 i=0

αi

, αk =

Ckr , k = 0, . . . , r − 1, (ε + Ik )μ

(5)

where μ ∈ {1, . . . , r }, Ik = Ik (h) is an smoothness indicator of the function f on the stencil Sk and ε is an small positive number, possibly dependent on h, introduced to avoid null denominators (as we will see, ε has a strong influence on the overall performance of the approximations at critical points and at discontinuities). We denote by JS-WENO the WENO schemes obtained with weights (5) and Jiang and Shu’s smoothness indicators proposed in [8]. In [7], it was detected that the classical fifth-order WENO scheme (obtained with r = 3), called JS-WENO5, achieves only third order accuracy at critical points of smooth solutions. In order to solve this loss of accuracy at extrema, Henrick et al. [7] define a new WENO method called mapped WENO. In their work, instead of formulating a new indicator of smoothness to obtain fifth-order accurate schemes near critical points, they define new weights. Another attempt to get maximal order of accuracy for the WENO5 scheme can be found in [2], where Borges et al. devise new nonlinear weights, providing a new WENO scheme for r = 3, called WENO-Z, with less dissipation and higher resolution than the classical WENO5. Yamaleev and Carpenter proposed [15,16] new weights providing faster weight convergence and better resolution near strong discontinuities. They presented these weights in an Energy Stable context that is out of the scope of the present paper. The schemes with these weights will be called YC-WENO henceforth. The proposed weights are:   τ2r −1 αk wk = r −1 , αk = Ck 1 + , k = 0, . . . , r − 1, (6) Ik + ε i=0 αi where Ik is the classical Jiang and Shu’s smoothness indicator ([8]), ε is a small positive parameter that can depend on h and the function τ2r −1 is defined by:  2 τ2r −1 = V x j−r +1 , . . . , x j+r −1  ,

123

J Sci Comput (2014) 60:641–659

645

where V x j−r +1 , . . . , x j+r −1  is the undivided difference defined on the entire (2r − 1)point stencil. Yamaleev and Carpenter show that WENO schemes with these weights and parameter ε satisfying:   ε ≥ O h 3r −4 , (7) have maximal order regardless of the number of vanishing derivatives of the solution. We study the order of accuracy of the reconstructions obtained using the WENO scheme with Yamaleev and Carpenter’s weights near discontinuities when the function f is not smooth but it is smooth at least at one of the stencils Sk , k = 0, . . . , r − 1. We know that if f is not smooth at the stencil Sk then the smoothness indicator of f in Sk satisfies Ik  0, when h → 0 whereas if f is smooth at the stencil Sk , then Ik = O(h 2 ). Since the nodes in the undivided difference that defines τ2r −1 cross a discontinuity, then τ2r −1 = O(1). Then, denoting K = {k/ f not smooth in Sk }, we obtain that αk = O(1) if r −1  αk / K. This yields αi = O(h −2 ) and wk = r−1 = k ∈ K, whereas αk = O(h −2 ) if k ∈ if k ∈ K, whereas wk = O(1) if k ∈ /K. We then deduce:

f (x j+ 1 ) − q(x j+ 1 ) = f (x j+ 1 ) − 2

2

2

=

r −1 

wk

k=0

=



k∈ /K

=



k∈ /K

wk

r −1 

2

f (x j+ 1 ) − pkr (x j+ 1 ) 2



αi

wk pkr (x j+ 1 )

k=0



i=0

i=0

O(h 2 )

2





f (x j+ 1 ) − pkr (x j+ 1 ) + wk f (x j+ 1 ) − pkr (x j+ 1 ) 2

O(1)O(h r ) +

2



k∈K

2

2

O(h 2 )O(1) = O(h 2 ).

k∈K

This result shows that the order of accuracy of the reconstructions obtained using the YCWENO scheme drops to 2 wherever one stencil, but not all of them, can avoid a discontinuity. This conclusion can also be drawn for the WENO-Z reconstructions proposed in [2]. This order of accuracy is worse than the order of accuracy r of the corresponding ENO scheme when r > 2. Furthermore, it is expected that the order of approximation to the derivative will drop to 1 when performing finite differences of the reconstructions, as can be seen in the following experiment, in which we test the performance of the YC-WENO5 reconstruction near discontinuities. This experiment appears in [1], where the authors test the performance of JS-WENO5 reconstructions. We consider the discontinuous function f (x) = x 3 + cos(x) + H (x) where H (x) = 0 if i x ≤ 0.5, H (x) = 1 if x > 0.5, and uniform grids on [−1,  1]with N = 25 · 2 , i = 0, . . . , 7. We compute the errors of the approximations of f x j±1 provided by the YC-WENO5 reconstructions with r = 3 at the points x j±1 , where x j−1 is at the left  part of the discontinuity and x j+1 is at the right part of the discontinuity, 0.5 ∈ x j , x j+1 . In this experiment we use ε = 10−100 ≈ 0 and ε = h 2 and respectively display in Tables 1, 2 the  errors e j±1 for the corresponding h. We also display the deduced orders o j±1 (h) = log2 e j±1 (h)/e j±1 (h/2) to reveal that the order of the YC-WENO5 reconstructions drops to 1 when using divided differences, as we expected, while the order of the JS-WENO5 reconstructions is 2, as can be seen in [1]. The numerical results in Sect. 4 will show that this order loss may be reflected as oscillations near some discontinuities.

123

646 Table 1 Results of accuracy test with εh = 10−100

J Sci Comput (2014) 60:641–659 h

e j−1

o j−1

8.000e−02 −2.9427e−03

Table 2 Results of accuracy test with εh = h 2

e j+1

o j+1

7.2249e−03 −1.6680e−03 6.9407e−01

4.000e−02

2.9280e−03 −1.1520e−01 −1.0310e−03 5.8138e−01

2.000e−02

3.1714e−03

8.4840e−01 −6.8904e−04 1.0368e+00

1.000e−02

1.7614e−03

9.2491e−01 −3.3584e−04 9.9537e−01

5.000e−03

9.2775e−04

9.6256e−01 −1.6846e−04 9.9247e−01

2.500e−03

4.7607e−04

9.8130e−01 −8.4671e−05 9.9505e−01

1.250e−03

2.4114e−04

9.9070e−01 −4.2481e−05 9.9725e−01

6.250e−04

1.2135e−04

−2.1281e−05

h

e j−1

o j−1

e j+1

o j+1

8.000e−02

1.9614e−01

8.6647e−01

−3.8327e−02

9.7274e−01

4.000e−02

1.0758e−01

9.3715e−01

−1.9529e−02

9.6898e−01

2.000e−02

5.6185e−02

9.8501e−01

−9.9767e−03

9.9984e−01

1.000e−02

2.8386e−02

9.9321e−01

−4.9889e−03

9.9858e−01

5.000e−03

1.4260e−02

9.9667e−01

−2.4969e−03

9.9902e−01

2.500e−03

7.1465e−03

9.9841e−01

−1.2493e−03

9.9935e−01

1.250e−03

3.5772e−03

9.9927e−01

−6.2493e−04

9.9970e−01

6.250e−04

1.7895e−03

−3.1253e−04

3 New Weights for Maximal Order WENO Schemes. The analytical and numerical results obtained in Sect. 2 show that YC-WENO schemes achieve maximal order of accuracy when the function is smooth but the results could be improved near discontinuities. To solve these accuracy problems we propose new WENO weights, based on Yamaleev and Carpenter’s weights, that yield maximal order of accuracy when the function is smooth and provide higher order of accuracy than the order of accuracy provided using Yamaleev and Carpenter’s weights, when the function is not smooth. As we will see, these weights also reduce the spurious oscillations that appear near discontinuities. The new WENO weights that we propose, named AMM-WENO henceforth, are defined by:     r τ2r −1 μ αk wk = r −1 , αk = Ck 1 + , , k = 0, . . . , r − 1, μ = Ik + ε 2 i=0 αi where Ik is the classical Jiang and Shu’s smoothness indicator, ε is a small positive parameter and the function τ2r −1 is the square of the undivided difference defined on the entire (2r − 1) −point stencil. It is worth noticing that μ = 1 gives Yamaleev and Carpenter’s weights and that our choice yields 2μ ≥ r . With an analysis as in [1, Proposition 3], we can state some constraints on the order of the parameter ε to guarantee maximal order WENO methods when we use the modified weights proposed above. These constraints are less restrictive than Yamaleev and Carpenter’s restriction (7).

123

J Sci Comput (2014) 60:641–659

647

Proposition 1 Let ε = K h q with K > 0, q ∈ N, q ≤ 4r − 4 − and μ =

r 2

r , μ

(8)

. The WENO reconstruction of f is defined by: q(x) =

r −1 

wk pkr (x),

(9)

k=0

where αk wk = r −1 i=0

    τ2r −1 μ k = 0, . . . , r − 1 and αk = Ckr 1 + . ε + Ik

αi

Then: 1. At regions where f is smooth: wk = Ckr (1 + O(h r )),

0 ≤ k < r,

f (x j+ 1 ) − q(x j+ 1 ) = d(x j+ 1 )h 2r −1 + O(h 2r ), 2

2

2

for a locally Lipschitz function d. 2. If f is not smooth but it is smooth at least at one of the stencils Sk , k = 0, . . . , r − 1, then: f (x j+ 1 ) − q(x j+ 1 ) = O(h r ). 2

2

  Proof Let us suppose that the function f is smooth, then τ2r −1 = O h 2(2r −2) . With this we have:    



τ τ2r −1 μ 2r −1 μ αk = Ckr 1 + ≤ Ckr 1 + ε + Ik ε   μ 

2(2r −2) O(h ) = Ckr 1 + = Ckr 1 + O h (4r −4−q)μ . q Kh r . μ r It follows that if q satisfies this bound then αk = Ck (1 + O(h r )), therefore

To get (4r − 4 − q)μ ≥ r , we deduce that q ≤ 4r − 4 −

r −1 

αi =

i=0

αk wk = r −1 i=0

r −1 

    Ckr + O h r = 1 + O h r ,

i=0

αi

=

  Ckr (1 + O(h r )) = Ckr 1 + O(h r ) . 1 + O(h r )

(10)

Now if F is a primitive function of f and P is an interpolator of F at {x j−r + 1 , . . . , x j+r − 1}, 2

then P = pr2r−1 and we can deduce that

f (x j+ 1 ) − pr2r−1 (x j+ 1 ) = b f (2r −1) (x j+ 1 )h 2r −1 + O(h 2r ), b = 0. 2

2

2

2

(11)

123

648

J Sci Comput (2014) 60:641–659

We know that the r − th order polynomial reconstruction defined on the stencil Sk , pkr (x), satisfies pkr (x j+ 1 ) = f (x j+ 1 ) + O(h r ). 2

2

Using this, (9), (10), (11) and the fact that

r −1 

(Ckr − wk ) = 0, we get:

k=0

f (x j+ 1 ) − q(x j+ 1 ) 2

2

−1 −1 (x j+ 1 ) + pr2r−1 (x j+ 1 ) − q(x j+ 1 ) = f (x j+ 1 ) − pr2r−1 2

2

2

2

r −1   r  Ck − wk pkr (x j+ 1 ) = b f (2r −1) (x j+ 1 )h 2r −1 + O(h 2r ) + 2

2

k=0

= b f (2r −1) (x j+ 1 )h 2r −1 + O(h 2r ) + 2

r −1

  r  Ck − wk pkr (x j+ 1 ) − f (x j+ 1 ) 2

k=0

= b f (2r −1) (x j+ 1 )h 2r −1 + O(h 2r ) − 2

r −1 

2

Ckr O(h r )O(h r )

k=0

= b f (2r −1) (x j+ 1 )h 2r −1 + O(h 2r ), 2

b f (2r −1)

a locally Lipschitz function. with Let us now suppose that f has a discontinuity at some, but not all, of the stencils Sk , k = 0, . . . , r − 1. With a similar analysis to the one conducted in the previous section, we deduce that αk =  O(1) if f has a discontinuity on Sk and αk = O(h −2μ ) if f is smooth at Sk . −1 αk Therefore, ri=0 αi = O(h −2μ ) and wk = r−1 = O(h 2μ ) if f is smooth at Sk . i=0

αi

If we denote K = {k/ f not smooth in Sk }, then f (x j+ 1 ) − q(x j+ 1 ) 2

=

r −1 

2

wk

k=0

=



wk



f (x j+ 1 ) − pkr (x j+ 1 ) 2







f (x j+ 1 ) − pkr (x j+ 1 ) + wk f (x j+ 1 ) − pkr (x j+ 1 )

k∈ /K

=



2

O(1)O(h r ) +

k∈ /K

since μ =

r 2

2

2



k∈K

2

2

O(h 2μ )O(1) = O(h r ),

k∈K

implies 2μ ≥ r .



Note 1 The parameter ε in Proposition 1 is a dimensional quantity. For finite difference WENO schemes K should be chosen proportional to the square of some reference flux value, so that the scheme would not be affected by changes of units.

4 Numerical Experiments In this section we assess numerically the theoretical results obtained previously.

123

J Sci Comput (2014) 60:641–659 Table 3 Results of test 1, ε = h 2 ; e(h) denotes the ∞-norm of the error of the solution of the linear advection equations at t = 1; o(h) = log2 (e(h)/e(h/2)) denotes the deduced order of e(h)

Table 4 Results of test 1, ε = h 5 ; e(h) denotes the ∞-norm of the error of the solution of the linear advection equations at t = 1; o(h) = log2 (e(h)/e(h/2)) denotes the deduced order of e(h)

649 JS-WENO5,

YC-WENO5

AMM-WENO5

h

e(h)

o(h)

e(h)

o(h)

e(h)

o(h)

1/25

4.92e−01

2.72

4.49e−01

2.71

4.95e−01

2.85

1/50

7.47e−02

3.64

6.84e−02

3.39

6.88e−02

3.40

1/100

5.99e−03

3.93

6.52e−03

4.84

6.52e−03

4.84

1/200

3.94e−04

4.33

2.28e−04

4.99

2.28e−04

4.99

1/400

1.96e−05

4.71

7.18e−06

5.00

7.18e−06

5.00

1/800

7.48e−07

4.96

2.25e−07

5.00

2.25e−07

5.00

1/1600

2.40e−08

7.04e−09

7.04e−09

JS-WENO5,

YC-WENO5

AMM-WENO5

h

e(h)

o(h)

e(h)

o(h)

e(h)

o(h)

1/25

5.13e−01

0.85

4.75e−01

2.87

4.91e−01

1.79

1/50

2.84e−01

5.51

6.50e−02

3.29

1.42e−01

4.40

1/100

6.22e−03

2.23

6.64e−03

4.53

6.73e−03

4.69

1/200

1.32e−03

3.11

2.88e−04

4.22

2.61e−04

4.35

1/400

1.53e−04

3.18

1.55e−05

3.97

1.28e−05

4.08

1/800

1.69e−05

3.04

9.86e−07

3.81

7.62e−07

3.87

1/1600

2.06e−06

7.04e−08

5.20e−08

Test 1 We compute approximations up to t = 1 with N = 25 · 2l , l = 0, . . . , 6 and C F L = 0.5 to the solution of the linear advection equation: u t + u x = 0,

0 < x < 1,

with periodic boundary conditions and initial condition given in [15, p. 4264] consisting in a C 6 function with three critical points: x = 0.5 with order 3 (i.e., f (0.5) = f (0.5) = f (0.5) = 0, f (iv) (0.5) = 0), x = 0.3 and x = 0.7 of order 6. The ODE solver for the semidiscretized problem is the third order TVD Runge-Kutta scheme proposed in [11].  We  use 3 JS-WENO5, YC-WENO5 and AMM-WENO5 reconstructions, i.e., r = 3, so μ = =2 2 is used for our proposed weights. For a given scheme we denote the ∞-norm of the error by e(h) and the orders o(h) = log2 (e(h)/e(h/2)) deduced from the experiments. We display in Table 3 the results for ε = h 2 and in Table 4 the results for ε = h 5 (this parameter satisfies condition (7) proposed by Yamaleev and Carpenter’s to obtain maximal order YC-WENO schemes). Since the ODE solver is third order accurate, we take t = Cx 5/3 , with C = 0.5 · 502/3 to ensure t 3 = O(x 5 ) and t/x ≤ 0.5 for the sizes N considered in the experiment. With this choice, the error introduced by the ODE solver has an order of accuracy not less than the spatial order of accuracy. As can be seen in Table 3 for ε = h 2 the errors for YC-WENO5 and AMM-WENO5 are similar and slightly smaller than the errors for JS-WENO5 and the order is 5 for all three reconstructions. For ε = h 5 and small h the results in Table 4 are slightly better for AMM-WENO5 than for YC-WENO5 and both quite better than JS-WENO5. The order is more difficult to deduce in this case for YC-WENO5 and AMM-WENO5, since o(h) does

123

650

J Sci Comput (2014) 60:641–659

Table 5 Results of test 2 with εh = 10−100 ; e j±1 respectively denote the errors at the points right after and before the discontinuity; o j±1 (h) =   log2 e j±1 (h)/e j±1 (h/2)

Table 6 Results of test 2 with εh = h 2 ; e j±1 respectively denote the errors at the points right after and before the discontinuity; o j±1 (h) =   log2 e j±1 (h)/e j±1 (h/2)

h

e j−1

o j−1

e j+1

o j+1

8.000e−02

−5.5575e−03

0.9648

4.6570e−03

2.0164

4.000e−02

−2.8473e−03

1.9518

1.1511e−03

1.9972

2.000e−02

−7.3601e−04

1.9938

2.8833e−04

2.0001

1.000e−02

−1.8480e−04

1.9984

7.2078e−05

2.0005

5.000e−03

−4.6252e−05

1.9995

1.8013e−05

2.0005

2.500e−03

−1.1567e−05

1.9998

4.5018e−06

2.0003

1.250e−03

−2.8922e−06

1.9999

1.1252e−06

2.0002

6.250e−04

−7.2311e−07

2.8126e−07

h

e j−1

e j−1 / h 2

e j+1

e j+1 / h 2

8.000e−02

−1.0883e−02

1.9385

4.4575e−03

1.9721

4.000e−02

−2.8393e−03

1.9681

1.1361e−03

1.9875

2.000e−02

−7.2572e−04

1.9854

2.8650e−04

1.9959

1.000e−02

−1.8328e−04

1.9927

7.1827e−05

1.9982

5.000e−03

−4.6051e−05

1.9963

1.7979e−05

1.9992

2.500e−03

−1.1542e−05

1.9983

4.4972e−06

1.9996

1.250e−03

−2.8890e−06

1.9991

1.1246e−06

1.9998

6.250e−04

−7.2270e−07

2.8119e−07

not seem to converge to 5, probably due to round-off errors when adding h 5 ≈ 10−15 for h ≈ 10−3 . The order of JS-WENO5 approaches 3, thus revealing an order loss at smooth extrema. Test 2 We use the same setup as in Sect. 2 to test the performance of the AMM-WENO5 reconstruction when using divided differences to approximate derivatives. In Tables 5, 6 we show the results of this test for the AMM-WENO5 scheme and ε = 10−100 and ε = h 2 respectively. The  columns corresponding to the deduced orders o j±1 (h) = log2 e j±1 (h)/e j±1 (h/2) reveal that the order of the divided differences of AMM-WENO5 reconstructions is 2, the same order that we obtained with the original WENO5 method, whereas the order achieved with divided differences of YC-WENO5 reconstruction is 1 in this case. x2 + cos(x). In this experiment Test 3 We use the same setup as in Sect. 2 for f (x) = x 4 + 2 we want to test the order of accuracy of the reconstructions computed using the AMMWENO5 (r = 3) method when we choose the value of the parameter ε depending on the condition r q ≤ 4r − 4 −  r  , 2

f (0)

= = f (0) = 0 but f (iv) (0) = 0, so that the being satisfied or not. Note that order of the critical point x j+ 1 = 0 is s = 3 and the order of the smoothness indicator is Ik = O(h 2s+2 ) = O(h 8 ).

123

2

f (0)

J Sci Comput (2014) 60:641–659 Table 7 Estimated orders  log2 e(h i )/e(h i+1 ) , i = 0. . . . , 19 for Test 3 with different values of ε

651 h

ε = h2

ε = h4

ε = h6

ε = h8

ε = h 10

1.000e−01

4.9973

8.2845

2.1971

3.0001

3.0024

5.000e−02

4.9993

5.01797

5.1690

3.00004

3.0006

2.500e−02

4.9998

4.99984

7.2594

3

3.0001

1.250e−02

5

5

8.33170

3

3

6.250e−03

5

5

8.7003

3

3

3.125e−03

5

5

7.8990

3

3

1.562e−03

5

5

5.7840

3

3

7.812e−04

5

5

5.0672

3

3

3.906e−04

5

5

5.0043

3

3

1.953e−04

5

5

5.00027

3

3

9.765e−05

5

5

5

3

3

5.002 5

3.06

4.998

3.04

4.996

3.02 3

4.994 JS N=400 YC N=400 AMM N=400 JS N=1000 YC N=1000 AMM N=1000 exact solution

4.992 4.99 4.988 0.67

0.675 0.68

JS N=400 YC N=400 AMM N=400 JS N=1000 YC N=1000 AMM N=1000 exact solution

2.98 2.96 2.94 0.685 0.69

0.695

0.7

0.7

0.705 0.71 0.715 0.72 0.725 0.73 0.735

Fig. 1 Results of Test 4: Enlarged views near the discontinuity of the solution of the linear advection equation with different WENO5 schemes with N = 400 and N = 1000 points, t = 0.5 and ε = h 5

In our case, for r = 3, the condition leads to: 3 q ≤ 4 · 3 − 4 −  3  = 6.5.

(12)

2

For testing the accuracy order we choose ε = h 2 , h 4 , h 6 , which satisfy condition (12), and ε = h 8 , h 10 which do not satisfy this condition. As we can see in Table 7, for the choices of ε that satisfy the condition (12) the method has maximal order of accuracy 2r − 1 but the order of accuracy is smaller for the choices that do not satisfy the condition. In the next numerical examples, we will see that Yamaleev and Carpenter’s weights may produce oscillations near discontinuities and that our proposed weights seem to reduce or suppress them. Test 4 We compute the approximations of the solution of the linear advection equation: u t + u x = 0,

0 < x < 1,

with initial conditions: u 0 (x) = 5, x ≤ 0.2, u 0 (x) = 3 x > 0.2.

123

652

J Sci Comput (2014) 60:641–659

5.05

3.1

5

3.05

4.95

3

4.9

2.95

mu=1 mu=2 mu=3 mu=4 exact solution

4.85

mu=1 mu=2 mu=3 mu=4 exact solution

2.9

0.665 0.67 0.675 0.68 0.685 0.69 0.695 0.7

0.7

0.71

0.72

0.73

0.74

0.75

Fig. 2 Results of Test 4: Enlarged views near the discontinuity of the solution of the linear advection equation with AMM-WENO9 and different values of the exponent μ, with N = 400 points, t = 0.5 and ε = h 14 1.1 YC AMM JS refer.

1 0.9

YC AMM JS refer.

0.45

0.8

0.4

0.7 0.6

0.35

0.5 0.4

0.3

0.3 0.2 0.25 0.1 0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

0.63

0.64

0.65

0.66

0.67

0.68

0.69

0.7

0.71

0.72

(b)

(a) 0.32 YC AMM JS refer.

0.465 0.46

YC AMM JS refer.

0.3 0.28

0.455

0.26

0.45

0.24

0.445

0.22

0.44

0.2

0.435

0.18

0.43

0.16

0.425

0.14 0.12

0.42 0.465 0.47 0.475 0.48 0.485 0.49 0.495 0.5 0.505 0.51 0.515

(c)

0.795 0.8

0.805 0.81 0.815 0.82 0.825 0.83 0.835 0.84

(d)

Fig. 3 Results of Test 5 with WENO9: a Plot of the density with N = 400. b–d are enlarged views of a

We compute the approximations up to t = 0.5 with 400 and 1000 points and C F L = 0.5. We use the third order TVD Runge-Kutta scheme proposed in [11] to solve the semidiscretized   problem. In this example, we use WENO5 reconstructions, with r = 3, so 3 μ= = 2. We also define ε = h 5 which satisfies Yamaleev and Carpenter’s condi2 tion (7) required to obtain maximal order WENO schemes. The exponent q = 5 for h in ε also satisfies our restrictions (8) for obtaining maximal order.

123

J Sci Comput (2014) 60:641–659

653

1.1

0.44

YC AMM JS refer.

1 0.9

0.4

0.8

0.38

0.7

0.36

0.6

0.34

0.5

0.32

0.4

0.3

0.3

0.28

0.2 0.1 0

YC AMM JS refer.

0.42

0.26 0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

0.662

0.664

(a)

0.666

0.668

0.67

0.672

0.674

(b) 0.28

0.429

YC AMM JS refer.

0.4285 0.428

YC AMM JS refer.

0.26 0.24

0.4275

0.22

0.427 0.2 0.4265 0.426

0.18

0.4255

0.16

0.425

0.14

0.4245 0.12 0.484

0.486

0.488

0.49

0.492

0.494

0.81

0.811 0.812 0.813 0.814 0.815 0.816 0.817 0.818 0.819

(c)

(d)

Fig. 4 Results of Test 5 with WENO9: a Plot of the density with N = 4000. b–d are enlarged views of a

We observe in Fig. 1 that the AMM-WENO5 scheme performs better than the YC-WENO5 scheme, specially near discontinuities where this scheme presents some oscillations which are reduced when using our modified weights. In addition, the approximation to the exact solution is better when using our modified weights than when Yamaleev and Carpenter’s weights or Jiang and Shu’s weights are used. We can also appreciate that the oscillations obtained near the discontinuity that appear with Yamaleev and Carpenter’s weights are reduced when using our modified weights. In Fig. 2 we show the results of this experiment when using the AMM-WENO9 reconstruction with the highest exponent q = 14 that (8) allows for ε = h q and different exponents μ = 1, 2, 3, 4 (μ = 1 corresponds to YC-WENO9). As can be seen, the AMM-WENO9 scheme with μ = 3 performs better than the rest of the options, specially near discontinuities, and μ = 1 gives again an oscillatory behavior. Test 5 We consider Sod’s problem [13] which consists in the one-dimensional Euler equations of gas dynamics: ⎧ ρt + (ρu)x = 0 ⎪ ⎪ ⎨ (ρu)t + (ρu 2 + p)x = 0 , ⎪ ⎪ ⎩ E t + ((E + p)u)x = 0

(13)

123

654

J Sci Comput (2014) 60:641–659

5 4.1

4.5 4

4

3.5

3.9

3 3.8

2.5 2

3.7 JS AMM YC reference

1.5 1 0.5 −5

JS AMM YC reference

3.6 3.5

−4

−3

−2

−1

0

1

2

3

4

5

0.5

0.55

0.6

(a)

0.65

0.7

0.75

0.8

(b) 4

4 3.5 3.95 3 3.9

2.5 2

3.85

1.5

JS AMM YC reference

3.8

−0.2

−0.15

JS AMM YC reference

1

−0.1

−0.05

0

0.05

2.2

2.25

(c)

2.3

2.35

2.4

2.45

2.5

2.55

2.6

(d)

Fig. 5 Results of Test 6 with WENO9: a Approximations of the density with N = 400 points, t = 1.8. b–f are enlarged views of the most interesting parts of a

where ρ, u, p and E are the density, velocity, pressure and total energy respectively, assuming the equation of state: E=

1 p + ρu 2 , γ −1 2

where γ = 1.4 and the initial conditions are given by: (ρ, u, p) = (1, 0, 1) if x < 0.5, (ρ, u, p) = (0.125, 0, 0.1) if x > 0.5, with outflow boundary conditions. The numerical scheme follows a method of lines approach. The spatial discretization is obtained by Shu-Osher’s finite difference strategy [11], with the appropriate WENO reconstruction applied to characteristic fluxes obtained by Donat-Marquina’s [4] two-Jacobians local characteristic projections and Local Lax-Friedrichs flux-splittings. This spatiallydiscretized problem is solved by the third order TVD Runge-Kutta scheme proposed in [11]. We use this numerical scheme, and its two-dimensional extension, for all subsequent tests that require the solution of Euler equations. In Figs. 3 and 4 we compare the solutions obtained with the schemes JS-WENO9, YCWENO9 and AMM-WENO9 at t = 0.18, with C F L = 0.5, ε = h 11 , for N = 400 and N = 4,000 cells. As can be deduced from these figures, the solutions obtained with the YCWENO9 scheme shows oscillations near discontinuities that do not seem to disappear upon

123

J Sci Comput (2014) 60:641–659

655

5 4.1 4.5 4

4 3.5

3.9

3

3.8

2.5 3.7 2

1 0.5 −5

3.6

JS AMM YC reference

1.5

−4

−3

−2

JS AMM YC reference

3.5

−1

0

1

2

3

4

5

0.68

0.7

0.72

(a)

0.74

0.76

0.78

0.8

(b) 3.5

3.91 3.9

3 3.89 2.5

3.88 3.87

2 3.86 3.85 3.84

1.5

JS AMM YC reference

JS AMM YC reference

1

3.83 −0.1 −0.09 −0.08 −0.07 −0.06 −0.05 −0.04 −0.03 −0.02 −0.01

(c)

2.36

2.37

2.38

2.39

2.4

2.41

2.42

(d)

Fig. 6 Results of Test 6 with WENO9: a approximations of the density with N = 4000 points, t = 1.8. b–f are enlarged views of the most interesting parts of a

refinement. It can be further observed that the resolution of AMM-WENO9 at singularities is slightly better than the resolution of JS-WENO9. Test 6 We consider here the simulation of the interaction of a shock and an entropy wave, [12], with the one-dimensional Euler equations of gas dynamics (13). The initial conditions are set by a Mach 3 shock interacting with a perturbed density field: ⎧

√ 4 35 31 ⎪ , , if x < −4 ⎨ 27 7 9 3 (ρ, u, p) = (14) ⎪  ⎩ 1 + 15 sin (5x), 0, 1 if x ≥ −4 on the domain [−5, 5] with homogeneous Neumann boundary conditions at the left part of the domain and Dirichlet boundary conditions at the right part of the domain. In Figs. 5 and 6 we compare the results obtained using the JS-WENO9, YC-WENO9 and AMM-WENO9 schemes at t = 1.8 with N = 400 and N = 4,000 cells and ε = h 8 . A reference solution is obtained with the JS-WENO9 scheme and N = 12,800 cells. As can be seen, the approximations obtained using Yamaleev and Carpenter’s weights show some oscillations in the vicinity of the strong shock near x = 2.4. This oscillations do not seem to diminish upon mesh refinement. One can also observe that our modified weights yield slightly better results than Jiang and Shu’s weights, specially for N = 400.

123

123

0

50

(d)

100

JS YC AMM

150

7.5

8

8.5

9

9.5

40

(b)

60

80

JS YC AMM

100 120 140

(e)

66 68 70 72 74 76 78 80 82 84

20

7.5

8

8.5

9

9.5

10

10.5

20

40

60

80

100

120

140

105

20

40

110

(f)

(c)

60

115

80

120

JS YC AMM

100 120 140

Fig. 7 Results of Test 7 for a grid of 1024 × 256 cells: a–c 50 contour lines of the density obtained with JS-WENO5, YC-WENO5 and AMM-WENO5, respectively; d displays sections of a–c at pixel height 18; e, f are zooms of d

0

2

4

6

8

10

12

14

16

18

20

20

100 120 140

40

40

80

60

60

(a)

80

80

60

100

100

40

120

120

20

140

140

656 J Sci Comput (2014) 60:641–659

0

50

100

(d)

150

(a)

200

250

JS YC AMM

300

7

7.5

8

8.5

9

9.5

10

10.5

100

(b)

150

200

JS YC AMM

250

(e)

135 140 145 150 155 160 165 170 175 180

50

6.5

7

7.5

8

8.5

9

9.5

10

10.5

11

50

100

150

200

250

300

100

(c)

150

200

JS YC AMM

250

(f)

205 210 215 220 225 230 235 240 245 250

50

Fig. 8 Results of Test 7 for a grid of 2048 × 512 cells: a–c 50 contour lines of the density obtained with JS-WENO5, YC-WENO5 and AMM-WENO5, respectively; d displays sections of a–c at pixel height 36; e, f are zooms of d

0

2

4

6

8

10

12

14

16

18

50

50

250

100

100

200

150

150

150

200

200

100

250

250

50

300

300

J Sci Comput (2014) 60:641–659 657

123

658

J Sci Comput (2014) 60:641–659

Test 7 In this test a double Mach reflection of a strong shock is simulated with the 2D Euler equations of gas dynamics (see [14]). The problem involves a Mach 10 shock in air (γ = 1.4) which makes a 60◦ angle with a reflecting wall. The computational domain has been rotated by −30◦ , so that the reflecting wall is located at the bottom, beginning at x = 0.25. The domain is then a rectangle 4 units long and 1 unit high, starting at x = 0, y = 0. Initially the shock extends from the point x = 0.25 at the bottom of the computational domain to the top boundary. Postshock conditions are assigned at the boundaries located to the left of the shock; the air ahead of the shock is left undisturbed and has density 1.4 and pressure 1. Outflow conditions are applied at the right end of the domain, and the values on the top boundary to the right of the shock are those of undisturbed air. We run the experiment with C F L = 0.25 and t = 0.2 for resolutions 1024 × 256 and 2048 × 512 and display an enlarged view of the results in Figs. 7 and 8, respectively. As can be observed, the results obtained with YC-WENO5 and AMM-WENO5 have more vorticity developed at the contact lines, thus indicating that they introduce a smaller amount of numerical disipation than JS-WENO5. The results obtained with AMM-WENO5 seem to have some more vorticity than those obtained with YC-WENO5.

5 Conclusions In this paper we have analyzed the Weighted ENO reconstructions proposed by Yamaleev and Carpenter [15]. We have shown that the WENO method with Yamaleev and Carpenter’s weights has worse order of accuracy near discontinuities than the corresponding WENO method with Jiang and Shu’s weights. This is reflected in the numerical experiments as some oscillations that may appear near discontinuities. To alleviate the problem of loss of accuracy at extrema while retaining the same order as ENO schemes near discontinuities, we have proposed a new set of weights based on Yamaleev and Carpenter’s weights. We have proven that, near discontinuities, the order of accuracy of the finite difference WENO scheme with these weights is better than the order of accuracy achieved with Yamaleev and Carpenter’s weights and that the oscillations obtained in the approximated solutions using Yamaleev and Carpenter’s weights diminish considerably when we use the newly proposed weights.

References 1. Aràndiga, F., Baeza, A., Belda, A.M., Mulet, P.: Analysis of WENO schemes for full and global accuracy. SIAM J. Num. Anal. 42(2), 893–915 (2011) 2. Borges, R., Carmona, M., Costa, B., Don, W.: An improved weighted essentially non-oscillatory scheme for hyperbolic conservation laws. J. Comput. Phys. 227, 3191–3211 (2008) 3. Casper, J., Carpenter, M.H.: Computational considerations for the simulation of shock-induced sound. SIAM J. Sci. Comput. 19(3), 813–828 (1998). (electronic) 4. Donat, R., Marquina, A.: Capturing shock reflections: an improved flux formula. J. Comput. Phys. 125(1), 42–58 (1996) 5. Engquist, B., Sjögreen, B.: The convergence rate of finite difference schemes in the presence of shocks. SIAM J. Numer. Anal. 35(6), 2464–2485 (1998) 6. Harten, A., Engquist, B., Osher, S., Chakravarthy, S.: Uniformly high-order accurate essentially nonoscillatory schemes. III. J. Comput. Phys. 71(2), 231–303 (1987) 7. Henrick, A., Aslam, T., Powers, J.: Mapped weighted essentially non-oscillatory schemes: achieving optimal order near critical points. J. Comput. Phys. 207, 542–567 (2005) 8. Jiang, G.S., Shu, C.W.: Efficient implementation of weighted ENO schemes. J. Comput. Phys. 126(1), 202–228 (1996)

123

J Sci Comput (2014) 60:641–659

659

9. Liu, X.D., Osher, S., Chan, T.: Weighted essentially non-oscillatory schemes. J. Comput. Phys. 115(1), 200–212 (1994) 10. Mulet, P.: The maximal order of semidiscrete schemes for quasilinear first order partial differential equations (2012). Submitted 11. Shu, C.W., Osher, S.: Efficient implementation of essentially non-oscillatory shock-capturing schemes. J. Comput. Phys. 77(2), 439–471 (1988) 12. Shu, C.W., Osher, S.: Efficient implementation of essentially non-oscillatory shock-capturing schemes. II. J. Comput. Phys. 83(1), 32–78 (1989) 13. Sod, G.: A survey of several finite difference methods for systems of nonlinear hyperbolic conservation laws. J. Comput. Phys. 27(1), 1–31 (1978) 14. Woodward, P., Colella, P.: The numerical simulation of two-dimensional fluid flow with strong shocks. J. Comput. Phys. 54(1), 115–173 (1984) 15. Yamaleev, N., Carpenter, M.: A systematic methodology for constructing high-order energy stable WENO schemes. J. Comput. Phys. 228, 4248–4272 (2009) 16. Yamaleev, N., Carpenter, M.: Third-order energy stable WENO scheme. J. Comput. Phys. 228, 3025–3047 (2009)

123 View publication stats



Comments

Copyright © 2024 UPDOCS Inc.