On the implementation of a finite volumes scheme with monotone transmission conditions for scalar conservation laws on a star-shaped network
Sabrina Francesca Pellegrino

TL;DR
This paper validates a finite volume numerical scheme with monotone transmission conditions for scalar conservation laws on star-shaped networks by comparing with explicit solutions and Riemann problem solutions, supporting its accuracy and applicability.
Contribution
It provides the first validation of a finite volume scheme with monotone transmission conditions for networked scalar conservation laws through explicit and Riemann problem comparisons.
Findings
Scheme accurately reproduces explicit solutions
Effective in solving Riemann problems on networks
Supports further validation of the finite volume method
Abstract
In this paper we validate the implementation of the numerical scheme proposed in [3]. The validation is made by comparison with an explicit solution here obtained, and the solutions of Riemann problems for several networks. We then perform some simulations in order to qualitatively validate the model under consideration. Such results represent also a first step for the validation of the finite volumes scheme introduced in [9].
| Number | Rate of | Rate of | Rate of | |||
| of cells | convergence | convergence | convergence | |||
| per arc | ||||||
| - | - | - | ||||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the implementation of a finite volumes scheme with monotone transmission conditions for scalar conservation laws on a star-shaped network
Sabrina Francesca Pellegrino
Dipartimento di Matematica
Università degli Studi di Bari
Via Orabona 4
70125 Bari
Italy
Abstract.
In this paper we validate the implementation of the numerical scheme proposed in [3]. The validation is made by comparison with an explicit solution here obtained, and the solutions of Riemann problems for several networks. We then perform some simulations in order to qualitatively validate the model under consideration.
Such results represent also a first step for the validation of the finite volumes scheme introduced in [9].
Key words and phrases:
finite volumes scheme, networks, scalar conservation laws, transmission conditions, Riemann solver at the junction.
The author acknowledges the support of the Région Bourgogne Franche-Comté, projet 2017-2020 “Analyse mathématique et simulation numérique d’EDP issus de problèmes de contrôle et du trafic routier" and of the Université de Bourgogne Franche-Comté, projet Chrysalide 2017 “Contrôle, analyse numérique et applications d’équations hyperboliques sur un réseau". The author is member of the Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM)
1. Introduction
We investigate from the numerical point of view the model developed in [3] by Andreianov, Coclite and Donadello, called here ACD, which describes the evolution of traffic at a junction consisting of incoming and outgoing arcs. Incoming arcs are parametrized by and numbered by the index , while outgoing arcs are parametrized by and numbered by the index in such a way that the junction is always located at . We denote the generic arc by , , and the network by .
We describe the evolution of traffic on each arc by the Lighthill-Whitham-Richards (LWR) model [13, 15], namely by a scalar conservation law of the form
[TABLE]
where is the density and is the flux on the -th arc. We assume that the arcs have a common maximal density and the fluxes are all bell-shaped (unimodal), Lipschitz and non-degenerate nonlinear i.e.
- (F)
for all , with , , and there exists such that for a.e. , 2. (NLD)
for all , is not constant on any non-trivial subinterval of .
We augment (1) with the initial conditions
[TABLE]
where , . We also impose the conservation of the total density at the junction, i.e. for a.e.
[TABLE]
Notice that the previous equation makes sense as the assumption (F) ensures the existence of strong traces [14, 16].
In [3] the authors prove the well-posedness of solutions obtained as vanishing viscosity limits for the Cauchy problem (1)-(2). Their result relies upon the explicit characterization of the class of admissible weak solution at the junction in terms of vanishing viscosity germ, see [1, 4, 5]. It represents a generalized study of the model investigated in [8], in which the authors establish the existence of weak solutions as limit of vanishing viscosity approximations. Such results are relevant in the perspective of a theoretical analysis of PDEs on networks, in particular, they allow the extension of the analogy between vanishing viscosity and numerical scheme both in the network case. Furthermore, their analysis is applicable to general junction solvers enjoying enjoying the order-preservation property, see for instance [10].
The aim of this paper is to validate the implementation of the numerical scheme proposed in [3] by comparison with an explicit solution here computed and with the solutions of Riemann problems both for merge, divide and 2-2 cases. Moreover, we show the consistency of the scheme with respect to the case of a network with no discontinuity at the junction, namely taking the same flux on each arc, and finally a convergence analysis is also performed. These results are used in the validation of the finite volumes scheme with point constraints at the junction introduced in [9].
The paper is organized as follows. In Section 2 we briefly recall the main theoretical results for ACD. In Section 3 we compute an explicit solution for the problem in the case of a merge consisting of two incoming and one outgoing arcs. In Section 4 we present the numerical scheme. Finally, Section 5 is devoted to the validation of the scheme.
2. Well-posedness of ACD in the frame of admissible solutions
The well-posedness for the general Cauchy problem (1)- (2)- (3) is established in [3] in the frame of admissible solution.
We recall some definitions.
Definition 2.1**.**
A function , , is a weak solution of (5) if
- •
for every and every nonnegative test function with compact support
[TABLE]
- •
for a.e. , it holds
[TABLE]
We remind the formulation of the Bardos-LeRoux-Nédélec boundary condition for conservation laws in terms of the Godunov numerical flux (see [7, 11]), which will be useful for the definition of admissible solution at the junction.
Definition 2.2**.**
The Godunov flux related to a flux satisfying (F) is the function which associates to any couple the value (the equality holds due to the Rankine-Hugoniot condition), where is the Kruzhkov [12] entropy solution to the Riemann problem
[TABLE]
see Figure 1. The analytical expression of the Godunov flux is given by
[TABLE]
We denote by the Godunov flux associated with the flux , .
Consider the initial boundary value problem
[TABLE]
and assume is a Kruzkov entropy solution in the interior of the half plane . Then satisfies the boundary condition in the sense of Bardos-LeRoux-Nédélec (see [7]) if and only if .
Fix an initial condition . We look for a function such that for every , is a weak entropy solution of
[TABLE]
where is to be fixed in the sequel in order to ensure the conservation at the junction.
The condition (4) is equivalent to ask for the traces to satisfy the boundary condition in the sense of Bardos-LeRoux-Nédélec
[TABLE]
In order to describe the solution of (1) we postulate (see [1, 6])
[TABLE]
The criterion for the choice of is equivalent to the condition (4), indeed, due to (6) and (7), we can express (4) in the following way
[TABLE]
We can now give the definition of admissible solution.
Definition 2.3**.**
Given an initial condition , we say that in is an admissible solution for the Cauchy problem at the junction (1) associated with , if there exists a function such that, for any , is a weak solution of (5) with , chosen to fulfill (8), and such that , fulfill (4).
The authors provide a characterization of vanishing viscosity limits for the problem (1) in terms of Dirichlet problems on , coupled by a transmission condition at the junction. To this aim, they introduce the vanishing viscosity germ (see [4, 5, 1]), which can be identified by the set of all possible stationary admissible solutions to (1) that are constant on each road of .
The main result of [3] is summarized in the following theorem.
Theorem 2.4** (Theorem 3.1 in [3]).**
For any given initial condition in the problem (1) admits a unique admissible solution in .
Moreover, if and are two admissible solutions corresponding respectively to the initial condition and , then for all and , where ,
[TABLE]
In particular, the map that associates to the unique corresponding admissible profile , is non-expansive with respect to the distance for all .
3. An explicit admissible solution at a merge
In this section we compute an explicit solution for the problem consisting of two incoming and one outgoing arcs. We consider
[TABLE]
as the flux for each arc. As initial condition, we choose
[TABLE]
The exact solution is obtained by an explicit analysis of the wave-front interactions, with computer assisted computation of the front slopes and interaction times.
At time , let be the solution of
[TABLE]
then, on a rarefaction starts from and its values are given by
[TABLE]
On starts the backward shock given by
[TABLE]
On a rarefaction starts from and its values are given by
[TABLE]
On , let be the point where the shock originated from interacts with the shock . As a result, from starts a shock given by
[TABLE]
and reaches the junction at time that corresponds to the time at which the second incoming arc becomes empty. On , in , the stationary shock originated from interacts with the rarefaction . As a result, from starts a shock given by
[TABLE]
Let be the intersection between and . From this point starts a forward shock
[TABLE]
Let be the solution of
[TABLE]
Therefore, a rarefaction appears on :
[TABLE]
Let be the point where and interact. From this point starts a forward shock , with left state , which reaches the junction at time , then is empty. Finally, on at time starts a shock which interacts with the rarefaction generating the additional shock
[TABLE]
4. Finite volumes numerical scheme
We fix a constant space step . For and , we set . We define the cell centers for and consider the uniform spatial mesh on each
[TABLE]
so that the position of the junction corresponds to for each edge. Then we fix a constant time step satisfying the CFL condition
[TABLE]
and for we define the time discretization . At each time , represents an approximation of the main value of the solution on the interval , , along the -th arc. We initialize the scheme by discretizing the initial conditions
[TABLE]
for all and for if , if .
For each , at all cell interfaces with we consider the standard Godunov flux corresponding to the flux . At the junction we take on each arc the Godunov flux corresponding to the admissible solution of the Riemann problem at the junction, defined as in [3], which we compute by means of a two-step procedure:
- (i)
find
[TABLE] 2. (ii)
compute
[TABLE]
where
[TABLE]
The choice of the Godunov’s flux is motivated by the fact that all admissible stationary solutions are exact solutions for such scheme. However, one can use any other numerical flux that is monotone, consistent and Lipschitz continuous.
A convergence result for the scheme (13)-(14)-(15) can be found in [3].
5. Validation of the numerical scheme
We propose here to validate the numerical scheme (13)-(14)-(15) making a comparison with the explicit solution computed in the Section 3; by comparison with the solution of Riemann problems and by showing the consistence of the scheme with respect to a network consisting of one single arc.
We consider the explicit solution to (1) constructed in Section 3. The setup for the simulation is as follows. We consider as domain of computation for the incoming arcs and for the outgoing one, and , as space and time step, respectively. A qualitative comparison between the numeric solution and the explicit solution at different fixed times is shown in Figure 2.
Additionally, we perform a convergence analysis for this test. We introduce the relative -error respectively for the whole network, for the incoming and for the outgoing arcs at a given time as follows
[TABLE]
Table 1 depicts the relative -error with respect to the space step at the fixed time . The time step is fixed to . Since we are dealing with a first order scheme approximating discontinuous solutions, the sub-linear convergence rate found results expected.
5.1. Riemann problem for a - merge.
We consider a network consisting of three edges and one junction, with two incoming and one outgoing arcs. We consider as domain of computation for the incoming arcs and for the outgoing one, and we take a normalized flux for each arc.
In Figures 3 we present a qualitative comparison between the numerically computed solution and the explicitly one at time , corresponding to the Riemann problems having and as initial conditions, respectively.
We observe good agreement between the exact and the numeric solution. The parameters for the simulations are and .
5.2. Riemann problem for a - divide.
We consider a network consisting of three edges and one junction, with one incoming and two outgoing arcs. We consider as domain of computation for the incoming arc and for the outgoing ones, and we take a normalized flux for each arc. We consider as initial conditions for the Riemann problems and , respectively.
Figure 4 shows a qualitative comparison between the numerically computed solution and the explicitly one at time , corresponding to the above initial conditions. Also in this case, we can observe good agreements between the exact solution and its numerical approximation. The parameters for the computed solution are and .
5.3. Riemann problem for - network.
We consider here a junction with two incoming and two outgoing arcs. We consider as domain of computation for the incoming arcs and for the outgoing ones, and we take a normalized flux for each arc. As initial condition for the Riemann problems on the network we choose and .
Also in this case, in Figures 5 and 6 we find a good agreement between the exact and the numerical solutions. The parameters for the simulation are and .
5.4. A network with no discontinuity at junction.
In this section we consider a network consisting of an arc without any discontinuity at the junction, namely, we assume that the flux on the incoming arc coincides with the flux on the outgoing arc, and therefore, this setting is equivalent to the case of a single arc. This simulation exploits the idea consisting in solving two scalar conservation laws on half-space coupled by an ad hoc transmission condition at the interface [1]. We remark that, in the case of discontinuous flux, the transmission condition can be interpreted in terms of a flux constraint at the interface [2].
We apply the scheme to two different domains, one including the junction located at , and one not. More in details, we choose and as domain of computation, and as flux along the arcs. We consider the initial densities and for the first simulation, and for the second one. The parameters of computation are and .
Figure 7 displays the comparison between the profiles of solutions in the two simulations at times and . We can observe the same qualitative behavior shifted of .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Andreianov, B., and Cancès, C. On interface transmission conditions for conservation laws with discontinuous flux of general shape. J. Hyperbolic Differ. Equ. 12 , 2 (2015), 343–384.
- 2[2] Andreianov, B., and Cancès, C. The Godunov scheme for scalar conservation laws with discontinuous bell-shaped flux functions. Applied Mathematics Letters 25 , 11 (2012), 1844 – 1848.
- 3[3] Andreianov, B., Coclite, G. M., and Donadello, C. Well-posedness for vanishing viscosity solutions of scalar conservation laws on a network. Discrete and Continuous Dynamical Systems A 37 , 11 (2017), 5913–5942.
- 4[4] Andreianov, B., Karlsen, K. H., and Risebro, N. H. On vanishing viscosity approximation of conservation laws with discontinuous flux. Netw. Heterog. Media 5 , 3 (2010), 617–633.
- 5[5] Andreianov, B., Karlsen, K. H., and Risebro, N. H. A theory of L 1 superscript 𝐿 1 {L}^{1} -dissipative solvers for scalar conservation laws with discontinuous flux. Archive for Rational Mechanics and Analysis 201 , 1 (2011), 27–86.
- 6[6] Andreianov, B., and Mitrović, D. Entropy conditions for scalar conservation laws with discontinuous flux revisited. Ann. Inst. H. Poincaré Anal. Non Linéaire 32 , 6 (2015), 1307–1335.
- 7[7] Bardos, C., Leroux, A. Y., and Nedelec, J. C. First order quasilinear equations with boundary conditions. Communications in Partial Differential Equations 4 , 9 (1979), 1017–1034.
- 8[8] Coclite, G. M., and Garavello, M. Vanishing viscosity for traffic on networks. SIAM Journal on Mathematical Analysis 42 , 4 (2010), 1761–1783.
