Abstract
In this study, we use an extension of Yang’s convergence criterion [N. Jiang, On the wavewise entropy inequality for high-resolution schemes with source terms II: the fully discrete case] to show the entropy convergence of a class of fully discrete schemes, now with source terms, for non-homogeneous scalar convex conservation laws in the one-dimensional case. The homogeneous counterparts (HCPs) of these schemes were constructed by S. Osher and S. Chakravarthy in the mid-1980s [A New Class of High Accuracy TVD Schemes for Hyperbolic Conservation Laws (1985), Very High Order Accurate TVD Schemes (1986)], and the entropy convergence of these methods, when , was settled by the author [N. Jiang, The Convergence of α Schemes for Conservation Laws II: Fully-Discrete]. For semi-discrete schemes, with or without source terms, the entropy convergence of these schemes was previously established (for ) by the author [N. Jiang, The Convergence of α Schemes for Conservation Laws I: Semi-Discrete Case].
Keywords:
inhomogeneous conservation laws; fully discrete α schemes with source terms; entropy convergence MSC:
65M12; 35L60
1. Introduction
This paper is concerned with the entropy convergence of fully discrete schemes with source terms that approximate inhomogeneous scalar conservation laws. The homogeneous counterparts (HCPs) of this class of high-order schemes, i.e., schemes without source terms, were constructed and analyzed by S. Osher and S. Chakravarthy [1,2], who also established the TVD property of this family of schemes. Furthermore, for and , schemes are in conservative form, using points and having -order of accuracy (except at isolated critical points). In addition, the utility and the effectiveness of these methods in obtaining approximate solutions to nonlinear hyperbolic conservation laws were demonstrated in [1,2,3]. When , the author [4] showed that the numerical solutions to S. Osher and S. Chakravarthy’s original schemes of a fully discrete case indeed converge to the entropy solution. The goal of this study is to extend this result to the non-homogeneous case. In other words, we show the entropy consistence of fully discrete schemes with source terms for . The technique of this research is based on an extension of [5] Yang’s WEI framework [6], which was established for fully discrete schemes that approximate homogeneous scalar conservation laws, to handle non-homogeneous cases.
We would like to mention that in the literature, not many convergence results for systems or/and multidimensional conservation laws have been verified. Nonetheless, in practice, once the convergence of the scalar case has been established, using nonlinear field-by-field decomposition extension to systems generally works well; see [1,3,7,8], for example. Osher and Chakravarthy also showed that the extensions of schemes to systems have many of the same properties as in the scalar case [2]. Two-dimensional schemes that are based on dimension-by-dimension high-resolution differencing, even for complex configurations with very strong shocks, also perform well; see [7,9,10], for example. Consequently, the analysis of the entropy convergence of schemes with source terms is very important and relevant from both the theoretical and practical points of view. These schemes can be embedded in or integrated into the design and development of state-of-the-art schemes that can handle modern computational needs for systems and multidimensional cases.
In this study, we consider numerical approximations to scalar conservation laws with source terms:
where is convex and . Here, stands for the subspace of consisting of functions with bounded total variation. Next, to introduce the numerical methods, we let , where h and are spatial and temporal step sizes, respectively. Let be the nodal values of piecewise constant mesh function approximating the solution of (1). Now, the numerical schemes that we are interested in admit the conservative form
where the numerical flux, g, is given by
and
for any data . Also, function g is Lipschitz continuous with respect to its arguments and is consistent with the conservation law in the sense that
The homogeneous problems that correspond to (1) are
With the numerical flux given by (4), we call the corresponding schemes
that are consistent with the problems of (6) the homogeneous counterparts (HCPs) of schemes (2)–(5).
The paper is organized as follows: In Section 2, we review the notions of the extremum paths [6], the definition of schemes with source terms in the case of ; then, we establish the extremum traceableness of -scaled forms [5], which is necessary for analyzing the entropy convergence of the schemes with source terms that are given in the next section. In Section 3, we present a simplified version of the extension of Yang’s convergence criterion [5], an important entropy estimate, and then the main convergence result. Section 4 presents the concluding remarks; finally, in Abbreviations, we list some abbreviations that are used throughout the paper.
2. Extremum Traceableness of -Scaled Forms
2.1. Extremum Paths
In this subsection, we introduce the schemes with source terms, whose HCPs were constructed by Chakravarthy and Osher [1,2], and the notions of Yang’s extremum paths [6].
To improve readability, throughout the rest of the paper, we use the following shorthand notation: , , and . Also, whenever there is no ambiguity in the context, we employ the following simplified notation: , , , and , where k and n are the spatial and temporal indexes, respectively.
Let be the flux of an E-scheme [11] that is characterized by
for all u between and . Then, the flux differences are defined by
At time level , for all k, we define a series of local CFL numbers
Clearly, we have and . For convenience, we also set the ratios
We recall that the “minmod” operator is defined by
which can be converted, when divided by x, to a monotonically increasing function
where . Clearly, has a symmetry property,
In the sequel, using this symmetry property, we can recast a scheme of form (2)–(5) into an increment form. For and , an scheme [1,2], now with a source term, is given by
where
The superscripts shown over denote flux-limited values of and are computed as follows:
In the above, b is a “compression” parameter [2] chosen in the range
We shall assume for the remainder of the paper that the local CFL numbers satisfy for all .
By rewriting the expression
as
and
as
it is easy to see that an scheme of form (15)–(16) can be written in an increment form [4] as
with
and
A scheme of form (21)–(23) provides a convenient way of checking the extremum traceability of a scheme of form (25) and the TVD property of the associated HCP (7) [10,12].
For convenience, let be the set of all sequences of numbers in with a zero limit. We use bold-faced letters to represent the sequences in and use the corresponding light-faced ones with subscripts to represent the terms in such a sequence.
Let , i.e., and . We call the following scheme the -scaled form [5] of schemes (2)–(5):
where step size and step size .
The concept of discrete extremum paths was introduced by Yang (see Definition 6.3 [13] and Definition 2.13 [6]) for both semi-discrete and fully discrete cases. For the purpose of keeping this paper reasonably self-contained, we re-state Yang’s definitions for the fully discrete case in order.
Let us consider a numerical solution u defined on set of grid points A finite set of successive grid points , with , is said to be the stencil of a spatial maximum or simply an -stencil of u at time , provided that , and . Notions of -stencils for minima and E-stencils for general extrema are defined similarly. Throughout the paper, we refer to [6] for the definitions, lemmas, and theorems that we quote in the context.
Definition 1
(see Definition 2.13 [6]). A nonempty subset of X denoted by , is called a ridge of numerical solution u from to if the following apply:
(i) For all ν, , set
is not empty and is an -stencil of u at ;
(ii) For all ν, ,
Set is called the x-projection of at . The value of u along the ridge is denoted by for .
If for all , , the -stencil in item (i) of the definition is replaced with an -stencil, then the set is called a trough of u from to and is denoted by . The related notions and are defined similarly. Ridges and troughs are also called extremum paths. When we do not distinguish between ridges and troughs, we use , , or for either type. We write
Definition 2
(see Definition 2.14 [6]). A scheme is said to be extremum-traceable if there exists a positive constant such that for each numerical solution u of the scheme and each integer , there exists a finite or infinite collection of extremum paths with the following properties:
(i) is precisely the set of E-stencils of at time arranged in ascending spatial coordinates.
(ii) If is a ridge (trough), then is a non-increasing (non-decreasing) function of n.
(iii) Let for . If , then
(iv) If , then for .
2.2. Extremum Traceableness of the -Scaled Form
In the next section, we use an extension of Yang’s convergence criterion [5,6] to show the entropy convergence of schemes (15)–(16). For this purpose, we need to verify that -scaled form (25) is extremum-traceable. The proof of Theorem 1 is similar to the proof of Theorem 2.3 [12]. For this reason, we omit the proof.
Theorem 1
The inequalities of (26) are Harten’s [10] sufficient conditions for the HCPs of schemes (15)–(16) to be TVD. In terms of the local CFL numbers, the conclusion of Theorem 1 can be stated as follows.
Corollary 1.
The conditions for ε-scaled form (25) to be extremum-traceable for sufficiently small ε and are the following inequalities:
for all k and for ; when is an extremum,
and
Proof.
When is an extremum, and are reduced to
and
Using the four inequalities above, we arrive at the desired estimations:
and so on. □
Notice that ; Lemma 1 follows from Corollary 1 when the building block of schemes belongs to a subfamily of E-fluxes defined by
where s is a sonic point of : .
It is clear that both Godunov [14] and Engquist–Osher [15] fluxes,
and
are members of the fluxes given by (31).
3. The Main Result: The Entropy Convergence of Schemes with Source Terms
The schemes that we are concerned satisfy the following separation property at the spatial extrema. See E. Tadmor [16] for a similar kind of conditions that were used to check the TVD conditions of the HCPs of schemes (2)–(5).
Assumption 1.
The numerical fluxes , , satisfy
and
The proof of Lemma 2 is the same as the one for the associated HCPs of (15)–(16), since the proof does not involve source terms.
In reference to (25), we denote and for any collection of data . Let , and be the linear functions interpolating at and . In this section, we assume that and . Clearly, HCPs (24) of schemes (21)–(23) and thus of schemes (15)–(16) are TVD, since schemes (24) are the original TVD schemes (for ) by Osher and Chakravarthy [2].
Definition 3
(see Definition 3.3 [5]). For ε-scaled form (25), we call an ordered pair of numbers a rarefying pair if and when . We call a collection of data an ε-rarefying collection of ε-scaled form (25) to rarefying pair if, for , the following apply:
(i) ;
(ii) , , ;
(iii) Either or , and either or .
Clearly, conditions (i) and (ii) imply that
We define piecewise constant function associated with -rarefying collection of -scaled form (25) as follows:
An -rarefying collection of -scaled form (25) to pair that satisfies
is called an ε-normal collection.
Theorem 2
(see Theorem 3.21 [5]). A scheme of form (15)–(16), thus of form (21)–(23), with extremum-traceable ε-scaled form (25) converges for convex conservation laws (1) if, for every rarefying pair {} and ε-rarefying collection of ε-scaled form (25) to the pair, the quadrature inequality
holds for some constant , provided that ε is sufficiently small.
For the class of schemes with source terms, the condition of every -rarefying collection in Theorem 2 can be weakened by every -normal collection; thus, we can simplify this convergence criterion as the following lemma.
Lemma 3.
A scheme of form (15)–(16), thus of form (21)–(23), with extremum-traceable ε-scaled form (25) converges for convex conservation laws (1), provided that for each rarefying pair , there is a constant such that, for sufficiently small ε, inequality (37) holds for all ε-normal collections of ε-scaled form (25) to rarefying pair .
Proof.
Let be an arbitrary -rarefying collection of -scaled form (25) to pair . Without loss of generality, we assume that . Let
By (i) and (iii) of Definition 3, is a minimum or a maximum. In either case, Assumption 1 and condition (ii) of Definition 3 imply that
or
Similarly, we have
or
Next, we construct an -normal collection as follows: First, let and ; we also set , , and for . Then, we have
which imply that
Thus, the -normality of is justified by the non-decreasing relation of
Indeed, we notice that the relationship
is directly inherited from condition (ii) of the given -rarefying collection of ,
Therefore, we only need to verify that
and similarly, we have
The proof is straightforward, and we omit the details.
Now, let G be the Lipschitz constant of numerical flux g, and . If we denote
then a priori estimate holds. Let be a constant such that for all -normal collections of -scaled form (25) to pair , inequality (37) holds for . Thus, for , inequality (37) also holds for -normal collection . Therefore, for , inequality (37) holds for all -rarefying collections of -scaled form (25) to pair provided that .
It remains for us to show the a priori estimate. First, we notice that for , and we can verify that for , the jth term of S equals the jth term of . Therefore, the terms of the difference
from to are all diminished. Then, for the remaining terms, we use the relationship of and , and (39)–(42) to yield the following estimates:
and
For an -normal collection , we denote vertex by and the area of convex polygon by . Let , and let
When the building blocks of schemes (15)–(16), thus of schemes (21)–(23), are the subclass of E-schemes with the fluxes defined by (31), we obtain a very important inequality (49), which enables us to prove Theorem 3, the main result of this paper. The proof of Lemma 4 is similar to the one, given by the author [4], for the HCPs of (15)–(16). To see the reason for that, first, we can show the inequality
by mimicking the proof for inequality (50) with the following modifications: In the proof of case 1, let c be a constant such that for , and we set , when ; for case 3, let c be a constant such that for , and we set , when . Next, we remark that the derivations of all estimations in the proof of (49) are the same as the ones in the proof for their HCPs; except for -scaled form (25), we now have extra finite terms of form (which may be multiplied by a bounded quantity), which all vanish to zero as . This means that if is small enough and , then the contributions of these terms are negligible; therefore, inequality (49) still holds for -scaled form (25). For the convenience of the reader, we provide the proof at the end of the paper. Also, we would like to recall that Lemma 5 is Yang’s original result [6].
Lemma 4.
Lemma 5
(see Lemma 3.7 [6]). We have
for .
Let . When , for the class of fully discrete schemes with source terms, equipped with the above lemmas, we obtain the following entropy convergence result.
Theorem 3.
Proof.
First, by Lemma 1, -scaled form (25) is extremum-traceable for sufficiently small and . Next, for each -normal collection of (25) to rarefying pair , we claim that
Indeed, for the given -normal collection , we have and . Also, we recall that and
Case 1. If , then as well. Let c be a constant such that for and set , when . We obtain
Case 2. If and , we let c be a constant such that for . Now, we have
Case 3. If and , we let c be a constant such that for and set , when . We obtain
In all three cases, without loss of generality, for the given , we let for all l. Thus, as claimed, the following inequality holds:
Now, we set
Since is finite, for some j between I and J. We then let
We also have for some between I and J. Clearly, we can choose j and k so that .
To complete the proof, we argue by contradiction. Hence, we assume that for certain convex f, a scheme of form (15)–(16), thus of form (21)–(23), does not converge. By Lemma 3 and inequality (50), there is a rarefying pair such that for each , , and , there is an -normal collection of -scaled form (25) to the pair that satisfies
It follows that there is a sequence of -normal collections , where , such that
The following three cases exhaust all possibilities.
Case 1. Let us set Then, there are a subsequence of -normal collections, still denoted by , and a corresponding sequence of integers such that
and . For simplicity, we fix and drop it from the notation. Let us set . It is a positive constant, since is a rarefying pair. By applying Lemmas 4 and 5, we have
if This contradicts (51).
Case 2. Let us set Then, there are a subsequence of the -normal collections, still denoted by , and a corresponding sequence of integers such that , and . We then have
where is the following -normal collection: and . By Lemma 4, we have
for since This contradicts (51).
Case 3. . Then, there exists a sequence of integers with such that . We then have
where is the following -normal collection: . In this case, numerical flux becomes E-flux . Hence, we have
The right-hand side of the inequality is a positive constant, since is a rarefying pair. This contradicts (51) again. We have thus completed the proof of Theorem 3. □
Finally, we finish this section by presenting the proof of Lemma 4.
Proof of Lemma 4.
In the following, we keep the same notation, and for instead of . We also use
to denote the divided difference.
To justify inequality (49), it suffices to show the following inequality:
Without loss of generality, let be a sonic point () such that for some integer k with . Then, for any given by (31), we have
and
To enhance readability, we further simplify the notation. We denote , , , , , , , , and . Then, by (35) and (48), we have
and the definitions of , and will be given shortly. Let us recall that the numerical flux is defined by
and with the help of increment form (21)–(23), we have
Let
and
With these definitions and the convexity of the flux in mind, we derive the following estimates:
where c is some constant. Similarly, notice that by writing
we obtain
where
and
Now, we compute the th, kth, and th terms of the RHS of (55) defined by , , and , respectively, as follows: Again, we let c be some generic constant.
and
Next, we combine the estimates of , , and into one estimate. But first, we let
and
Using the fact that , , and , we have
where
and
Clearly, for sufficiently small and , it is feasible that
Thus, we have completed the proof of Lemma 4. □
4. Concluding Remarks
In this paper, we establish the entropy convergence of schemes with source terms for scalar convex conservation laws when and . These (five-point grid bandwidth) schemes, except at isolated critical points, are second-order-accurate in space. Nevertheless, they are only first-order-accurate in time. Further research could consider the case of schemes for or their extensions with higher-order accuracy in time and could consider other methods with higher-order accuracy in space and time. The author is currently working on the convergence analysis of a non-homogeneous and nonlinear SSP Runge–Kutta method, which indeed has second-order accuracy both in time and (except at isolated critical points) space, and we hope to report this new result soon. The homogeneous counterpart of this method is one of the original SSP Runge–Kutta methods constructed by Shu [17], and Shu and Osher [18], of which the entropy convergence has been shown by the author [19].
Funding
This research received no external funding.
Acknowledgments
This recent, improved version of the paper was inspired by all reviewer’s positive and constructive feedback. The author would like to express her great appreciation to each of them for their time, expertise, and suggestions on the subject.
Conflicts of Interest
The author declares no conflict of interest.
Abbreviations
| HCPs | Homogeneous counterparts |
| TVD | Total variation diminishing |
| WEI | Wavewise entropy inequality |
| BV | Subspace of consisting of functions with bounded total variation |
| CFL | Courant–Friedrichs–Lewy |
| LHS | Left-hand side |
| SSP | Strong stability preserving |
References
- Chakravarthy, S.; Osher, S. A New Class of High Accuracy TVD Schemes for Hyperbolic Conservation Laws. In Proceedings of the 23rd Aerospace Science Meeting, Reno, NV, USA, 14–17 January 1985; pp. 1–11. [Google Scholar]
- Osher, S.; Chakravarthy, S. Very High Order Accurate TVD Schemes. J. Oscil. Theory Comput. Methods Compens. Compact. 1986, 2, 229–274. [Google Scholar]
- Chakravarthy, S.; Osher, S. Computing with High Resolution Upwind Schemes for Hyperbolic Equations. In Proceedings of the AMS-SIAM 1983, Boulder, CO, USA, 5–11 June 1983. [Google Scholar]
- Jiang, N. The Convergence of α Schemes for Conservation Laws II: Fully-Discrete Case. Methods Appl. Anal. 2014, 21, 201–220. [Google Scholar] [CrossRef]
- Jiang, N. On the wavewise entropy inequality for high-resolution schemes with source terms II: The fully discrete case. Methods Appl. Anal. 2019, 26, 297–318. [Google Scholar] [CrossRef]
- Yang, H. On Wavewise Entropy Inequalities for High Resolution Schemes II: Fully Discrete MUSCL Schemes with Exact Evolution in Small Time. SIAM. J. Numer. Anal. 1999, 36, 1–31. [Google Scholar] [CrossRef]
- Chakravarthy, S.; Osher, S. High resolution applications of the Osher upwind scheme for the Euler equations. Presented at the 6th CFD Conference, Danvers, MA, USA, 13–15 July 1983. [Google Scholar]
- Sweby, P.K. High resolution schemes using flux limiters for hyperbolic conservation laws. SIAM J. Numer. Anal. 1984, 21, 995–1011. [Google Scholar] [CrossRef]
- Colella, P.; Woodeard, P.R. The piecewise-parabolic method (PPM) for gas-dynamical simulations. Presented at the 6th CFD Conference, Danvers, MA, USA, 13–15 July 1983. [Google Scholar]
- Harten, A. High resolution schemes for hyperbolic conservative laws. J. Comput. Phys. 1983, 49, 357–393. [Google Scholar] [CrossRef]
- Osher, S.; Chakravarthy, S. High resolution schemes and entropy condition. SIAM J. Numer. Anal. 1984, 21, 955–984. [Google Scholar] [CrossRef]
- Jiang, N. On the Convergence of Fully-Discrete High-Resolution Schemes with Van Leer’s Flux Limiter for Conservation Laws. Methods Appl. Anal. 2009, 16, 403–422. [Google Scholar] [CrossRef]
- Yang, H. On Wavewise Entropy Inequalities for High-Resolution Schemes I: The Semi-Discrete Case. Math. Comp. 1996, 65, 45–67. [Google Scholar] [CrossRef][Green Version]
- Godunov, S.K. Finite-difference method for numerical computation of discontinuous solutions of the equations of fluid dynamics. Mat. Sb. 1959, 47, 271–306. [Google Scholar]
- Engquist, B.; Osher, S. Stable and Entropy Satisfying Approximations for Transonic Flow Calculations; LBL Report No. 14661; American Mathematical Society: Providence, RI, USA, 1982. [Google Scholar]
- Tadmor, E. Convenient total variation diminishing conditions for nonlinear difference schemes. SIAM J. Numer. Anal. 1988, 25, 1002–1014. [Google Scholar] [CrossRef]
- Shu, C.-W. Total-variation-diminishing time discretizations. SIAM J. Sci. Stat. Comput. 1988, 9, 1073–1084. [Google Scholar] [CrossRef]
- Shu, C.-W.; Osher, S. Efficient implementation of essentially non-oscillatory shock capturing schemes II. J. Comp. Phys. 1989, 83, 32–78. [Google Scholar] [CrossRef]
- Jiang, N. On the Convergence of a Second Order Nonlinear SSP Runge-Kutta Method for Convex Scalar Conservation laws. Methods Appl. Anal. 2022, 29, 209–228. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).