Abstract
We prove convergence rates of monotone schemes for conservation laws for Hölder continuous initial data with unbounded total variation, provided that the Hölder exponent of the initial data is greater than \(\nicefrac {1}{2}\). For strictly \({{\,\mathrm{Lip}\,}}^+\) stable monotone schemes, we prove convergence for any positive Hölder exponent. Numerical experiments are presented which verify the theory.
Similar content being viewed by others
1 Introduction
Consider the scalar hyperbolic conservation law
where \(f\in C^1(\mathbb {R})\) is the flux function and \(u_0\in L^1\cap L^\infty (\mathbb {R})\) is the initial data. Equations of this form appear in a large number of applications, including scenarios where very irregular data is to be expected; we mention in particular flow in porous media [1, 2], turbulent flows (so-called “Burgulence”) [3,4,5], and advection with rough coefficients [6]. While the study of qualitative properties of “rough” solutions of (1) has been explored in detail (see e.g. [3,4,5]), the behavior of numerical methods for (1) has received much less attention. There exists convergence results for linear conservation laws with rough coefficients [6]. However, there are no known results for non-linear conservation laws with rough initial data.
The purpose of this paper is to study the convergence rate of monotone numerical methods for (1) in the presence of rough (say, piecewise Hölder continuous) initial data \(u_0\). As is to be expected, the convergence rate deteriorates with lower regularity. We demonstrate in several numerical experiments that our estimates are sharp, or close to being sharp.
1.1 Weak Solutions of Hyperbolic Conservation Laws
As is well-known, solutions of nonlinear hyperbolic Eq. (1) can develop shocks in finite time, making it necessary to interpret the equation in a weak manner. A weak solution of (1) is a function \(u\in L^1\cap L^{\infty }(\mathbb {R}\times \mathbb {R}_+)\) satisfying
for all test functions \(\phi \in C_c^\infty (\mathbb {R}\times \mathbb {R}_+)\). It is well-known that weak solutions are non-unique, so one introduces entropy conditions to single out the physically relevant solutions. Concretely, we say that \(u\in L^1\cap L^{\infty }(\mathbb {R}\times \mathbb {R}_+)\) is an entropy solution of (1), if for every pair of functions \(\eta , q:\mathbb {R}\rightarrow \mathbb {R}\) where \(\eta \) is convex and \(q'=\eta 'f'\), it holds that
in the sense of distributions. In particular, it is sufficient to impose the entropy condition with respect to the Kruzkov entropy pairs, given by
for all \(k\in \mathbb {R}\). It was shown by Kruzkov (see e.g. [7] or [8, Proposition 2.10]) that entropy solutions of (1) are unique.
1.2 Finite Volume Methods for Conservation Laws
This section briefly describes the conventional approach of numerical approximation of conservation laws through finite volume and finite difference methods. For a complete review, one can consult e.g. [9].
We discretize the spatial domain \(\mathbb {R}\) by partitioning it into a collection of cells \({\mathcal {C}}_i {:}{=} [x_{i-\nicefrac {1}{2}}, x_{i+\nicefrac {1}{2}})\subset \mathbb {R}\) with corresponding cell midpoints \(x_{i}{:}{=}\frac{x_{i+\nicefrac {1}{2}}+x_{i-\nicefrac {1}{2}}}{2}.\) For simplicity we assume that our mesh is equidistant, that is,
for some \({\Delta x}>0\). We discretize time by equidistant points, that is, we choose \(t^n = n{\Delta t}\) for \(n\in \mathbb {N}_0\) for some \({\Delta t}>0\).
For each cell \({\mathcal {C}}_i\) and each point in time \(t^n\) we let \(v^{n}_i\) be an approximation of the cell average of u at time \(t^n\), (here, , where |C| is the Lebesgue measure of a Lebesgue set \(C\subset \mathbb {R}\)). This approximation is computed according to the finite volume scheme
where F is a numerical flux function. We furthermore assume the numerical flux function is consistent with f and locally Lipschitz continuous; more precisely, for every bounded set \(K\subset \mathbb {R}\), there exists a constant \(C_F>0\) such that
We will frequently abuse notation and view grid functions \(v\in \ell ^1(\mathbb {Z})\) as an element of \(L^1(\mathbb {R})\) under the inclusion \(\ell ^1(\mathbb {Z})\hookrightarrow L^1(\mathbb {R})\) which maps \(v\mapsto \sum _i v_i \mathbb {1}_{{\mathcal {C}}_i}\).
2 A Modified Kuznetsov Lemma
Kuznetsov’s lemma [10] provides an explicit estimate of the difference between two (approximate) solutions of (1) in terms of their relative (Kruzkov) entropy. In this section we recall Kuznetsov’s lemma and prove a corollary which — as opposed to Kuznetsov’s original application of the lemma — does not depend on \({{\,\mathrm{TV}\,}}(u_0)\) being bounded. We note that both Lemmas 1 and 2 can be generalized to multiple space dimensions (see e.g. [10] and [8, Section 4.3]). However, since we will only be able to handle one-dimensional equations in Sect. 3, we chose to stick to one dimension, for the sake of simplicity.
Fix now some final time \(T>0\). Kuznetsov’s lemma estimates approximation errors in the space
For \(u\in \mathcal {K}\) and \(\sigma >0\) we define the moduli of continuity
Let \(\omega \in C_c^\infty (\mathbb {R})\) be a standard mollifier, i.e. an even function satisfying \({{\,\mathrm{supp}\,}}\omega \subset [-1,1]\), \(0\le \omega \le 1\) and \(\int _{\mathbb {R}}\omega \,dx = 1.\) For \(\epsilon >0\) we define \(\omega _\epsilon (x)=\frac{1}{\epsilon }\omega (\frac{x}{\epsilon })\). For \(\epsilon ,\epsilon _0>0\), define
For \(\phi \in C_c^\infty (\mathbb {R}\times \mathbb {R}_+,\mathbb {R})\), \(k\in \mathbb {R}\) and \(u,v\in \mathcal {K}\) we set
Lemma 1
(Kuznetsov’s lemma [10]) Let \(v\in \mathcal {K}\) and let w be an entropy solution of (1). If \(0<\epsilon _0<T\) and \(\epsilon >0\), then
where \(v_0=v(\cdot , 0)\) and \(w_0=w(\cdot ,0)\).
The following is a straightforward extension of [10, Lemma 4 and Theorem 4].
Lemma 2
Let \(u_0\in L^1(\mathbb {R})\cap L^\infty (\mathbb {R})\) and let \(v^{\Delta x}\) be the solution computed by a monotone finite volume scheme (3) with initial data \(v^{\Delta x}_0\). Then
for any \(T>0\), \(\epsilon >0\) and \(0<\epsilon _0<T\), for some \(C>0\) only depending on the choice of smoothing kernel \(\omega \).
Proof
Let w be the entropy solution of (1) with \(w_0=v^{\Delta x}_0\). Then
by the stability of entropy solutions in \(L^1(\mathbb {R})\) (see e.g. [11, Theorem 1] or [8, Proposition 2.10]). We estimate the second term using Lemma 1. For notational convenience, denote
Without loss of generality we may assume that \(T=t^{N+1}\) for some \(N\in \mathbb {N}\). Then
(summation by parts)
(set \({\bar{\phi }}_i^n{:}{=}\frac{1}{{\Delta x}}\int _{x_{i-\nicefrac {1}{2}}}^{x_{i+\nicefrac {1}{2}}}\phi (x,t^{n+1})\,dx\) and \({\bar{\phi }}_{i+\nicefrac {1}{2}}^{n+\nicefrac {1}{2}}{:}{=} \frac{1}{{\Delta t}}\int _{t^n}^{t^{n+1}}\phi (x_{i+\nicefrac {1}{2}},t)\,dt\))
Let \(Q^n_{i+\nicefrac {1}{2}}{:}{=} F\big (v^n_i\vee k, v^n_{i+1}\vee k\big ) - F\big (v^n_i\wedge k, v^n_{i+1}\wedge k\big )\) be the Crandall–Majda numerical entropy flux, so that
(see e.g. [12] or [8, (3.33)]). It is not hard to show that Q is Lipschitz continuous,
where \(C_F\) is the Lipschitz constant for F (cf. (4)). Assuming now that \(\phi \) is non-negative, we obtain from the above discrete entropy inequality
(using (6) and the Lipschitz continuity \(\Vert q\Vert _{{{\,\mathrm{Lip}\,}}}\le \Vert f\Vert _{{{\,\mathrm{Lip}\,}}}\))
(smoothness of \(\phi \))
From this estimate we obtain
for some constant \(C>0\) only depending on \(\omega \).
It remains to estimate \(\nu (v^{\Delta x},\epsilon _0)\). The standard estimate
yields
\(\square \)
3 Convergence Rates for Irregular Data
With the Kuznetsov lemma and its corollary in place, we are now in place to prove convergence rates for (3) with irregular data. We start with some preliminaries in Sect. 3.1 before proving convergence rates in Sect. 3.
3.1 Preliminaries
We define the discrete Lip\(^+\) (semi-)norm as the sublinear functional
Following [13] (see also [14]), we say that a numerical flux function is (strictly) Lip\(^+\) stable if
for some \(\beta \ge 0\) (\(\beta >0\), respectively) which is independent of \({\Delta t},{\Delta x}\). Iterating (7), it holds in particular that
It was shown in [13] that the Lax–Friedrichs, Engquist–Osher and Godunov schemes are all strictly \({{\,\mathrm{Lip}\,}}^+\) stable. (The Roe scheme is non-strictly \({{\,\mathrm{Lip}\,}}^+\) stable.) The concept of \({{\,\mathrm{Lip}\,}}^+\) stability is motivated by the Oleinik entropy condition for conservation laws with strictly convex flux functions [15], which states that the \({{\,\mathrm{Lip}\,}}^+\) seminorm \(|u|_{{{\,\mathrm{Lip}\,}}^+}{:}{=}\sup _{x\ne y} \frac{u(x)-u(y)}{x-y}\) of a solution of (1) should decrease over time at a rate proportional to \(t^{-1}\); more precisely,
where \(0\le \beta _0\le f''(v)\) for all \(v\in \mathbb {R}\).
For a function \(g\in L^1(\mathbb {R})\) we define its total variation as
We say that a finite volume scheme is total variation diminishing (TVD) if for every \(u_0\in {{\,\mathrm{BV}\,}}(\mathbb {R})\), we have \({{\,\mathrm{TV}\,}}(v^{n+1})\le {{\,\mathrm{TV}\,}}(v^{n})\) for all \(n\ge 0\). We say that the scheme is monotone if for all cell averaged initial data \(u^0,v^0\) with \(u^0_j\le v^0_j\) for all \(j\in \mathbb {Z}\), we have \(u^n_{j}\le v^n_{j}\) for all \(n>0\) and \(j\in \mathbb {Z}\).
Lemma 3
Let \(u\in C^\alpha _c(\mathbb {R})\) for some \(\alpha >0\) and let \(u^{{\Delta x}}\in \ell ^1(\mathbb {Z})\) be the volume averages of u,
Then
where C only depends on \(\alpha \) and the size of the support of u.
Proof
Let \(K=\{i\in \mathbb {Z}\mid {\mathcal {C}}_i\cap {{\,\mathrm{supp}\,}}u\ne \emptyset \}\). Then
where \(C=\Vert u\Vert _{C^\alpha }{\Delta x}|K|\) and |K| is the Lebesgue measure of K. Similarly,
for the same constant C as above. \(\square \)
3.2 Convergence Rates
Without any assumptions on the scheme beyond being monotone, we can only prove convergence rates for initial data whose Hölder exponent is not smaller than \(\nicefrac {1}{2}\), which the following theorem makes precise.
Theorem 1
For a flux function \(f\in C^1(\mathbb {R})\), let \(u:\mathbb {R}\times [0,T]\rightarrow \mathbb {R}\) be the entropy solution of (1) with initial data \(u_0\in C_c^\alpha (\mathbb {R})\) for some \(\alpha \in (0,1)\). Let \((v_i^n)_{i,n}\) be generated by a monotone finite volume scheme (3) with initial data \(u_0\). Then
for any \(T>0\), for some \(C>0\) only depending on f and \(u_0\).
Proof
Since \(u_0\) is Hölder continuous with exponent \(\alpha \), Lemma 3 implies that \({{\,\mathrm{TV}\,}}(v^{\Delta x}_0)\le C{\Delta x}^{\alpha -1}<\infty \), and since the scheme is TVD we get \({{\,\mathrm{TV}\,}}(v^{{\Delta x}}(t^n))\le {{\,\mathrm{TV}\,}}(v^{\Delta x}_0)\). Hence,
We note furthermore that
Combining the above estimates with that of Lemma 2, we see that
Choosing \(\epsilon =\epsilon _0={\Delta x}^{1/2}\) yields
which was what we wanted. \(\square \)
We can improve the somewhat suboptimal convergence rate of \({\Delta x}^{\alpha -1/2}\) for \({{\,\mathrm{Lip}\,}}^+\)-stable schemes. To this end we need the following result.
Lemma 4
Let \(u_0\in L^1\cap L^\infty (\mathbb {R})\) have compact support and let u be the entropy solution of (1). Let \((v_i^n)_{i,n}\) be generated by a strictly \({{\,\mathrm{Lip}\,}}^+\) stable finite volume scheme (3). Then
where \(t^N\le T\) and \(C>0\) is independent of \({\Delta x}\).
Proof
Let \(M>0\) be such that \({{\,\mathrm{supp}\,}}v^{\Delta x}(t)\in [-M,M]\) for all \(t\in [0,T]\) and let \(I\in \mathbb {N}\) be such that \(x_{I-1}<M\le x_I\). The compact support of v and the strict \({{\,\mathrm{Lip}\,}}^+\) stability imply that
Hence,
\(\square \)
Theorem 2
For a strictly convex flux function \(f\in C^1(\mathbb {R})\), let \(u:\mathbb {R}\times [0,T]\rightarrow \mathbb {R}\) be the entropy solution of (1) with initial data \(u_0\in C_c^\alpha (\mathbb {R})\) for some \(\alpha \in (0,1)\). Let \((v_i^n)_{i,n}\) be generated by a strictly \({{\,\mathrm{Lip}\,}}^+\) stable, monotone finite volume scheme (3) with initial data \(u_0\). Then
for any \(T>0\), for some \(C_{L,M,f,\beta }>0\). For small \({\Delta x}>0\) this yields the “almost \({\Delta x}^{\alpha /2}\)” estimate
Proof
for some \(C>0\) independent of \({\Delta x}\). Inserting this and the bounds \(\Vert u_0-v^{\Delta x}_0\Vert _{L^1(\mathbb {R})}\le C{\Delta x}^\alpha \) and \({{\,\mathrm{TV}\,}}(v^{\Delta x}_0)\le C{\Delta x}^{\alpha -1}\) from Lemma 3 into the Kuznetsov estimate (5), we produce
Defining
and setting \(\epsilon = \epsilon _0 = {\Delta x}^{1-\alpha /2}\sqrt{Q({\Delta x},\alpha )}\) yields
Since \(\alpha \in (0,1)\), the second term on the right-hand side dominates, so we obtain (13). To get (14) we estimate
\(\square \)
4 Numerical Examples
We consider three scalar conservation laws: Burgers’ equation where \(f(u)=u^2/2\), a cubic conservation law where \(f(u)=u^3/3\), and lastly a linear conservation law where \(f(u)=u\). The initial data will be given as fractional Brownian motion with varying Hurst exponent H. Introduced by Mandelbrot et al. [16], fractional Brownian motion can be seen as a generalization of standard Brownian motion with a scaling exponent different than 1/2. We set
where \(B^H\) is a path of fractional Brownian motion with Hurst exponent \(H\in (0,1)\). Brownian motion corresponds to a Hurst exponent of \(H=1/2\).
To generate fractional Brownian motion, we use the random midpoint displacement method originally introduced by Lévy [17] for Brownian motion, and later adapted for fractional Brownian motion [18, 19]. For a more detailed description on how we generate fractional Brownian motion, consult [20, A.4.1]. See Fig. 1 (left column) for an example with \(H=0.125\), \(H=0.5\) and \(H=0.75\). The initial data is normalized to have values in \([-1,1]\).
4.1 Numerical Results
Figures 2 and 3 show the computed solutions for mesh resolutions of \({\Delta x}=2^{-8}\) and \({\Delta x}=2^{-15}\), and as expected the approximation converges upon mesh refinement. In order to measure the rate of convergence we compare with a reference solution computed on a mesh of \(2^{16}\) cells (\({\Delta x}= 2^{-16}\)); the results are shown in Fig. 4. The figure clearly shows convergence for all the given configurations. However, for most configurations—most notably those of low Hurst index H—we observe better convergence rates than the rates \({\Delta x}^{H-\nicefrac {1}{2}}\) and \({\Delta x}^{H/2}\sqrt{|\log {\Delta x}|}\) predicted by Theorems 12, respectively.
4.2 Sharpness of our Estimates
In Fig. 5 we show the evaluation of the inverse of the total variation as a function of time. As we can see from the plot, the total variation decays as C/t, which agrees well with the estimate on \({{\,\mathrm{TV}\,}}(v^n)\) in the proof of Lemma 4.
Inspired by (12), we use the value of \(\beta =\frac{1}{2}\cdot \frac{1}{4}\) for the Godunov flux applied to Burgers’ equation, computed in [13], and measure the sharpness of the bound (12) by the ratio
which is plotted in Fig. 6 as a function of the spatial resolution \({\Delta x}\). As we can see, the bound is not perfectly sharp, and seems to overestimate the sum on the left hand side of (12) by a factor of \(\Delta ^{\frac{1}{4}}\). This partially explains the discrepancy of the observed convergence rates and the predicted convergence rate of Theorem 2.
5 Conclusion
In this paper we have extended the standard Kuznetsov convergence proof for finite volume schemes approximating solutions to hyperbolic conservation laws to include initial data with unbounded total variation. The theory covers rapidly oscillating data such as Brownian and fractional Brownian motion. We show several numerical experiments which show good agreement with the theory.
Our result can easily be extended to cover initial data which is only piecewise Hölder continuous with a finite number of downward jump discontinuities. The suboptimal rate \({\Delta x}^{\alpha -1/2}\) in Theorem 1 can be extended even further to cover e.g. initial data in Besov spaces, since it only relies on the projection estimates (8a) and (8b).
We conjecture that the rate \({\Delta x}^{\alpha /2}\) given in (14) in Theorem 2 is optimal or near optimal. For optimality of convergence rates see e.g. [21, 22].
Data and Code Availability
All numerical experiments have been done with the Alsvinn code available from https://alsvinn.github.io. The code for post-processing, along with the generation of the initial data, can be found at https://github.com/kjetil-lye/unbounded_tv_experiments. They are also permanently stored on the Zenodo platform with the DOI 10.5281/zenodo.4088164.
References
Coclite, G.M., Mishra, S., Risebro, N.H., Weber, F.: Analysis and numerical approximation of brinkman regularization of two-phase flows in porous media. Comput. Geosci. 18(5), 637–659 (2014)
Krotkiewski, Marcin, Ligaarden, Ingeborg S., Lie, Knut-Andreas., Schmid, Daniel W.: On the importance of the stokes-brinkman equations for computing effective permeability in karst reservoirs. Commun. Comput. Phys. 10(5), 1315–1332 (2011)
Sinai, Y.G.: Statistics of shocks in solutions of inviscid burgers equation. Commun. Math. Phys. 148(3), 601–621 (1992)
Bec, J., Khanin, K.: Burgers turbulence. Phys. Rep. 447, 1–66 (2007)
She, Z.-S., Aurell, E., Frisch, U.: The inviscid Burgers equation with initial data of Brownian type. Commun. Math. Phys. 148, 623–641 (1992)
Weber, F.: Convergence rates of finite difference schemes for the linear advection and wave equation with rough coefficient. IMA J. Numer. Anal. 37(3), 1586–1634 (2016)
Dafermos, C.M.: Hyperbolic conservation laws in continuum physics. In: Fundamental Principles of Mathematical Sciences, Vol. 325, 4th ed. Springer-Verlag, Berlin (2016)
Holden, H., Risebro, N.H.: Front tracking for hyperbolic conservation laws. In: Applied Mathematical Sciences. Vol 152, 2nd ed. Springer, Heidelberg (2015)
LeVeque, R.J.: Numerical methods for conservation laws. Lectures in Mathematics ETH Zürich, 2nd ed. Birkhäuser Verlag, Basel (1992)
Kuznetsov, N.N.: Accuracy of some approximate methods for computing the weak solutions of a first-order quasi-linear equation. USSR Comput. Math. Math. Phys. 16(6), 105–119 (1976)
Kruzkov, S.N.: First order quasilinear equations in several independent variables. Math USSR SB 10(2), 217–243 (1970)
Crandall, M.G., Majda, A.: Monotone difference approximations for scalar conservation laws. Math. Comput. 34, 1–21 (1980)
Nessyahu, H., Tadmor, E.: The convergence rate of approximate solutions for nonlinear scalar conservation laws. SIAM J. Numer. Anal. 29(6), 1505–1519 (1992)
Fjordholm, U.S., Solem, S.: Second-order convergence of monotone schemes for conservation laws. SIAM J. Numer. Anal. 54(3), 1920–1945 (2016)
Oleinik, O.A.: On discontinuous solutions of non-linear differential equations. Uspekhi Mat. Nauk. 12:3–73, 1957
Mandelbrot, Benoit B., Van Ness, John W.: Fractional Brownian motions, fractional noises and applications. SIAM Rev. 10, 422–437 (1968)
Lévy, P.: Processus stochastiques et mouvement brownien. Les Grands Classiques Gauthier-Villars. Éditions Jacques Gabay, Sceaux (1992)
Fournier, A., Fussell, D., Carpenter, L.: Computer rendering of stochastic models. Commun. ACM 25(6), 371–384 (1982)
Voss, R.F.: Random fractal forgeries. In: Earnshaw, R.A. (ed.) Fundamental Algorithms for Computer Graphics NATO Advanced Study Institute Directed by J.E. Bresenham, R.A. Earnshaw, M.L.V. Pitteway, pp. 805–835. Springer Berlin Heidelberg, Berlin (1991)
Lye, K.O.: Computation of statistical solutions of hyperbolic systems of conservation laws. PhD thesis, ETH Zürich (2020)
Şabac, F.: The optimal convergence rate of monotone finite difference methods for hyperbolic conservation laws. SIAM J. Numer. Anal. 34(6), 2306–2318 (1997)
Ruf, A.M., Sande, E., Solem, S.: The optimal convergence rate of monotone schemes for conservation laws in the Wasserstein distance. J. Sci. Comput. 80(3), 1764–1776 (2019)
Funding
Open access funding provided by University of Oslo. USF was partially supported by the Research Council of Norway project number 301538.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The Author declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Fjordholm, U.S., Lye, K.O. Convergence Rates of Monotone Schemes for Conservation Laws for Data with Unbounded Total Variation. J Sci Comput 91, 32 (2022). https://doi.org/10.1007/s10915-022-01806-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-022-01806-x