This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

An Asymptotic-Preserving Scheme for Isentropic Flow in Pipe Networks

Michael Redle  and Michael Herty Chair of Applied and Computational Mathematics, RWTH Aachen University, 52062 Aachen, Germany; [email protected]Chair of Numrical Analysis, Institute for Applied Mathematics (IGPM), RWTH University, 52062 Aachen, Germany; [email protected]
Abstract

We consider the simulation of isentropic flow in pipelines and pipe networks. Standard operating conditions in pipe networks suggest an emphasis to simulate low Mach and high friction regimes – however, the system is stiff in these regimes and conventional explicit approximation techniques prove quite costly and often impractical. To combat these inefficiencies, we develop a novel asymptotic-preserving scheme that is uniformly consistent and stable for all Mach regimes. The proposed method for a single pipeline follows the flux splitting suggested in [Haack et al., Commun. Comput. Phys., 12 (2012), pp. 955–980], in which the flux is separated into stiff and non-stiff portions then discretized in time using an implicit-explicit approach. The non-stiff part is advanced in time by an explicit hyperbolic solver; we opt for the second-order central-upwind finite volume scheme. The stiff portion is advanced in time implicitly using an approach based on Rosenbrock-type Runge-Kutta methods, which ultimately reduces this implicit stage to a discretization of a linear elliptic equation.

To extend to full pipe networks, the scheme on a single pipeline is paired with coupling conditions defined at pipe-to-pipe intersections to ensure a mathematically well-posed problem. We show that the coupling conditions remain well-posed in the low Mach/high friction limit – which, when used to define the ghost cells of each pipeline, results in a method that is accurate across these intersections in all regimes. The proposed method is tested on several numerical examples and produces accurate, non-oscillatory results with run times independent of the Mach number.

Keywords: Isentropic Euler equations, pipe networks, non-conservative hyperbolic systems of nonlinear PDEs, asypmtotic-preserving scheme, all-speed scheme, central-upwind scheme, flux splitting, implicit-explicit approach, low Mach limit on pipe networks.

AMS subject classification: 35B40, 35L65, 35R02, 65M08, 76M12.

1 Introduction

This paper focuses on the development of a novel numerical method for gas flow in pipelines and pipe networks. To describe the gas transport, we use the isothermal/isentropic Euler equations with a source to account for the friction along the pipe walls:

ρt+(ρu)x=0,\displaystyle\rho_{t}+{\left(\rho u\right)}_{x}=0, (1.1)
(ρu)t+(ρu2+p)x=κ2Dρu|u|,\displaystyle{\left(\rho u\right)}_{t}+{\left(\rho u^{2}+p\right)}_{x}=-\frac{\kappa}{2D}\rho u{\left|u\right|},

where xx is the (one-dimensional) spatial variable, tt denotes time, ρ\rho is the fluid density, uu denotes the fluid velocity, p=ργp=\rho^{\gamma} is the pressure under the isentropic assumption, in which γ\gamma is the ratio of specific heats, and κ\kappa denotes the Fanning friction coefficient. In the one-dimensional approach, which is quite common when modeling gas flows in pipes due to the ratio of pipe length LL and cross section DD; see e.g. [67, 14]; the unknowns ρ\rho and uu are averaged over the (assumed constant) cross section.

The standard operating conditions hold the gas flow at moderate velocities; see e.g. [16] where they note a reference Mach number around 0.001; and thus we must account for the low Mach number or high friction regimes of (1.1). However, the limiting solution as this parameter goes to zero brings about a number of difficulties – the most notable of which is that the underlying system becomes very stiff. This makes designing efficient and accurate methods to approximate the solution quite challenging. For example, conventional explicit schemes applied to system (1.1) would greatly over-resolve the solution in time, as the wave speeds of the system are proportional to the inverse of the reference Mach number – further implying that the CFL stability restriction is proportional to this small parameter; see, e.g., [36, 35, 69]. Hence, explicit schemes may prove quite computationally expensive, especially in the low Mach/high friction limit.

One alternative to avoid this over-resolution issue are asymptotic-preserving (AP) schemes. By the definition in [48, 49], a scheme is AP if the discretization of the continuous system remains consistent and stable regardless of the value taken for the underlying singular parameter (denoted by ε\varepsilon in this paper). Furthermore, AP schemes allow for the space and time discretization to be independent of ε\varepsilon; i.e., the CFL condition for stability does not depend on the small parameter in the system.

Due to the potential speed up when discretizing with AP methods, they have attracted a lot of attention in the numerical and engineering community. AP schemes have been extensively studied for the kinetic equations; see, e.g., [45, 46, 54, 50, 51, 68, 78] and references therein. More recently, AP methods for the kinetic equations have been further extended to use AP Monte Carlo methods to reduce numerical diffusion effects [30, 31], and to use AP neural networks to solve the underlying PDE system [52, 53]. There has also been extensive development of AP methods in the low Mach limit of the isentropic Euler, compressible Euler, and Navier-Stokes systems in [2, 3, 4, 9, 12, 20, 21, 22, 37, 55, 56, 58, 66, 70, 77], and in the low Froude limit of the shallow water equations in [8, 13, 17, 24, 47, 59, 63, 72, 75, 76].

The number of studies significantly shrinks, though, when it comes to the consideration of nonlinear friction terms that remain in the limiting solution. When this nonlinear friction term, such as that in (1.1), remains in the low Mach/Froude limit, it adds the difficulty that this source must be discretized implicitly in some manner. If discretized naively, this requires some a nonlinear solve, which would preferably be avoided. To our knowledge, only the work in [17, 27] consider some nonlinear friction term, in which only [17] avoids a nonlinear solve via their proposed semi-implicit hybrid finite volume/finite element method.

Furthermore, the number of studies of AP schemes in the extension to pipe networks is also quite limited. To our knowledge, there are only two such developments. In [28], they present an AP hybrid-DG method on networks for the linear convection-diffusion equation. The work in [27] proposes a finite element AP method applied to the barotropic Euler equations with a nonlinear friction term on pipe networks. However, the aformentioned method does opt for an implicit time discretization reliant on a nonlinear solver.

In this paper, we propose an AP scheme for the isentropic Euler equations with a nonlinear friction source on pipe networks. The method on a single pipeline uses hyperbolic flux splitting proposed in [37, 63] to split the stiff and non-stiff parts of the system, which are then treated through an implicit-explicit approach. The non-stiff portion of the system is advanced in time explicitly and discretized in space using the second-order central-upwind (CU) finite volume scheme developed in [60, 61]. The stiff part of the system is advanced in time implicitly using an approach related to Rosenbrock-type Runge-Kutta methods seen in, e.g., [73, 79], which ultimately reduces this implicit stage to an elliptic equation that can then be solved linearly after discretizing in space via standard central-difference. The proposed scheme for a single pipeline is extended to pipe networks by defining coupling conditions, such as those in [7, 6], at pipe-to-pipe intersections to ensure a mathematically well-posed problem. We show that the coupling conditions remain well-posed in the low Mach/high friction regimes, and use them to define the ghost cell values of each pipeline. The resulting method is tested on several numerical examples of pipe networks and produces accurate and non-oscillatory results, in addition to running significantly faster than the analogous fully explicit scheme in the low Mach/high friction limit.

This paper is organized as follows. In §2, we discuss the asymptotics of the isentropic Euler equations (1.1) on pipe networks and associated numerical difficulties. We then develop an AP scheme for the underlying system in §3. We present the performance of the proposed scheme on three examples in §4, and make some concluding remarks in §5.

2 Dimensional Analysis

To look at the asymptotics of (1.1), we non-dimensionalize the system by introducing characteristic time t0t_{0}, characteristic density ρ0\rho_{0}, characteristic velocity w0w_{0}, and characteristic pressure p0p_{0}, along with using the pipe length LL as the characteristic length. Therefore, the dimensionless quantities for system (1.1) read

x^=xL,t^=tt0,ρ^=ρρ0,u^=uw0,p^=pp0.\widehat{x}=\frac{x}{L},\qquad\widehat{t}=\frac{t}{t_{0}},\qquad\widehat{\rho}=\frac{\rho}{\rho_{0}},\qquad\widehat{u}=\frac{u}{w_{0}},\qquad\widehat{p}=\frac{p}{p_{0}}.

Taking w0=L/t0w_{0}=L/t_{0}, substituting these quantities into (1.1), and dropping the hat notation for the sake of simplicity, we obtain the dimensionless isentropic Euler equations with a friction source term:

ρt+(ρu)x=0,\displaystyle\rho_{t}+{\left(\rho u\right)}_{x}=0,
(ρu)t+(ρu2+1Ma2p)x=κ2δρu|u|,\displaystyle{\left(\rho u\right)}_{t}+{\left(\rho u^{2}+\frac{1}{\textrm{Ma}^{2}}p\right)}_{x}=-\frac{\kappa}{2\delta}\rho u{\left|u\right|},

where

Ma=w0ρ0p0,δ=DL,\textrm{Ma}=w_{0}\sqrt{\frac{\rho_{0}}{p_{0}}},\qquad\delta=\frac{D}{L},

are the reference Mach number and the ratio of the cross section to the pipe length, respectively. We then choose to take the reference Mach number Ma=ε\rm{Ma}=\varepsilon, and follow the suggestions of [16, 27, 26] in taking δ=ε2/Cδ\delta=\varepsilon^{2}/C_{\delta}, where CδC_{\delta} is a constant, resulting in the parameterized system

ρt+(ρu)x=0,\displaystyle\rho_{t}+{\left(\rho u\right)}_{x}=0, (2.1)
(ρu)t+(ρu2+1ε2p)x=Cδκ2ε2ρu|u|,\displaystyle{\left(\rho u\right)}_{t}+{\left(\rho u^{2}+\frac{1}{\varepsilon^{2}}p\right)}_{x}=-\frac{C_{\delta}\kappa}{2\varepsilon^{2}}\rho u{\left|u\right|},

which can otherwise be written in the following vector form

𝑼t+𝑭(𝑼)x=𝑺(𝑼),𝑭(𝑼)=(ρuρu2+p/ε2),𝑺(𝑼)=(0Cδκ2ε2ρu|u|),\bm{U}_{t}+\bm{F}{\left(\bm{U}\right)}_{x}=\bm{S}{\left(\bm{U}\right)},\quad\bm{F}{\left(\bm{U}\right)}=\begin{pmatrix}\rho u\\[4.0pt] \rho u^{2}+p/\varepsilon^{2}\end{pmatrix},\quad\bm{S}{\left(\bm{U}\right)}=\begin{pmatrix}0\\[4.0pt] -\frac{C_{\delta}\kappa}{2\varepsilon^{2}}\rho u{\left|u\right|}\end{pmatrix}, (2.2)

where 𝑼:=(ρ,ρu)\bm{U}:=(\rho,\rho u)^{\top}, 𝑭(𝑼)\bm{F}(\bm{U}) denotes the flux, and 𝑺(𝑼)\bm{S}(\bm{U}) is the source due to friction along the pipe walls.

Remark 2.1.

Note that in the limit ε0\varepsilon\rightarrow 0, it is clear that system (2.1) approaches a state where the spatial derivative of pressure balances the friction source due to the pipe walls. This follows a classical limit commonly seen in the modeling of pipelines and pipe networks; see, e.g., [16].

2.1 Continuous Extension to Pipe Networks

To simulate an entire pipe network, we must of course consider appropriate boundary conditions at each pipe entrance and exit – the most complicated of which are at pipe-to-pipe intersections. These are obtained by defining some coupling conditions at the pipe-to-pipe intersections or junctions; see, e.g., [7, 29]. In this section, we briefly describe some suitable condition options that may be prescribed at pipe junctions. The following coupling conditions presented are commonly used examples for the mathematical framework of pipeline networks; see, for example, [42, 43, 39] and references therein.

Let us denote the entrance and exit of pipe k=1,,Kk=1,\ldots,K as xi(k)x_{\rm i}^{(k)} and xf(k)x_{\rm f}^{(k)}, respectively, and the variables in pipe kk as 𝑼(k)=(ρ(k),(ρu)(k))\bm{U}^{(k)}=(\rho^{(k)},(\rho u)^{(k)})^{\top}. Consider a single junction in which pipes with indices 1,,m1,\ldots,m denote the ingoing pipelines and those with indices m+1,,Km+1,\ldots,K are the outgoing pipelines, as depicted in Figure 1. Then at the junction, one must have the coupling condition for:

213mmmm+1mm+2mm+3KK
Figure 1: Illustration of a pipe network junction with mm ingoing pipelines and KmK-m outgoing pipelines.

Conservation of momentum:

k=1m(ρu)(k)(xf(k),t)==m+1K(ρu)()(xi(),t),\sum_{k=1}^{m}(\rho u)^{(k)}(x_{\rm f}^{(k)},t)=\sum_{\ell=m+1}^{K}(\rho u)^{(\ell)}(x_{\rm i}^{(\ell)},t), (2.3)

paired with one of the following:

  • (a)

    Equal pressures (see, e.g., [7, 6]):

    p(ρ(k)(xf(k),t))=p(ρ()(xi(),t))k=1,,m,=m+1,,K;p{\left(\rho^{(k)}(x_{\rm f}^{(k)},t)\right)}=p{\left(\rho^{(\ell)}(x_{\rm i}^{(\ell)},t)\right)}\qquad\forall k=1,\dots,m,\qquad\ell=m+1,\dots,K; (2.4)
  • (b)

    Equal momentums (see, e.g., [19]):

    (ρ(k)(u(k))2)(xf(k),t)+1ε2p(ρ(k)(xf(k),t))=(ρ()(u())2)(xi(),t)+1ε2p(ρ()(xi(),t))\displaystyle{\left(\rho^{(k)}(u^{(k)})^{2}\right)}(x_{\rm f}^{(k)},t)+\frac{1}{\varepsilon^{2}}p{\left(\rho^{(k)}(x_{\rm f}^{(k)},t)\right)}={\left(\rho^{(\ell)}(u^{(\ell)})^{2}\right)}(x_{\rm i}^{(\ell)},t)+\frac{1}{\varepsilon^{2}}p{\left(\rho^{(\ell)}(x_{\rm i}^{(\ell)},t)\right)} (2.5)
    k=1,,m,=m+1,,K;\displaystyle\hskip 213.39566pt\forall k=1,\dots,m,\qquad\ell=m+1,\dots,K;
  • (c)

    Geometry or flow-dependent pressure loss (see, e.g., [67, 74]):

    1ε2p(ρ(k)(xf(k),t))=1ε2p(ρ()(xi(),t))hk,,k=1,,m,=m+1,,K,\frac{1}{\varepsilon^{2}}p{\left(\rho^{(k)}(x_{\rm f}^{(k)},t)\right)}=\frac{1}{\varepsilon^{2}}p{\left(\rho^{(\ell)}(x_{\rm i}^{(\ell)},t)\right)}-h_{k,\ell},\qquad\forall k=1,\dots,m,\qquad\ell=m+1,\dots,K, (2.6)

    where hk,h_{k,\ell} denotes the pressure loss at the junction.

Notice that the ε\varepsilon-dependence remains in the coupling conditions, as it arose from the non-dimensionalization of system (1.1).

The isentropic Euler system (2.1) paired with (2.3) and one of (2.4)–(2.5) has been proven a well-posed problem under the condition that the initial data (i) is not in a vacuum state (ρ(k)(x,t=0)>0k\rho^{(k)}(x,t=0)>0\ \forall k); (ii) has a flow direction that does not change (u(k)(x,t=0)0ku^{(k)}(x,t=0)\geq 0\ \forall k); and (iii) is under subsonic conditions (u(k)(x,t=0)cku^{(k)}(x,t=0)\leq c\ \forall k) [6, 7, 19]. These coupling conditions are implemented into the boundary conditions of each pipe kk; we present how this is done for the proposed scheme in §3.5.1 following the rich literature in this field, e.g., [33, 34, 1, 18, 23, 44, 64, 15, 10, 5].

2.2 The Low Mach/High Friction Limit

To investigate the asymptotic behavior of system (2.1) inside each pipeline, we take the asymptotic expansion of variables ρ\rho and uu. Note that for simplicity, we removed the superscript (k)(k) introduced in the previous section for now, as the coupling conditions are only introduced on the boundaries. Thus, the associated asymptotic expansions of our unknowns are

ρ\displaystyle\rho =ρ(0)+ε2ρ(2)+,\displaystyle=\rho^{(0)}+\varepsilon^{2}\rho^{(2)}+\cdots,
u\displaystyle u =u(0)+ε2u(2)+.\displaystyle=u^{(0)}+\varepsilon^{2}u^{(2)}+\cdots.

Consequentially, we can obtain the asymptotic expansion for pressure p=ργp=\rho^{\gamma} using Taylor series:

p=(ρ(0))γ+ε2γ(ρ(0))γ1ρ(2)+.p={\left(\rho^{(0)}\right)}^{\gamma}+\varepsilon^{2}\gamma{\left(\rho^{(0)}\right)}^{\gamma-1}\rho^{(2)}+\cdots. (2.7)

Note that the ε1\varepsilon^{1} terms are skipped since there are no 𝒪(ε1)\mathcal{O}(\varepsilon^{-1}) appearing in system (2.1). Substituting the expansions of ρ,u,p\rho,\ u,\ p into system (2.1) and collecting like powers of ε\varepsilon, we obtain the asymptotic behavior of the isentropic Euler equations with a friction source:

𝒪(ε2):\displaystyle\mathcal{O}(\varepsilon^{-2}): [(ρ(0))γ]x=Cδκ2ρ(0)u(0)|u(0)|,\displaystyle{\left[{\left(\rho^{(0)}\right)}^{\gamma}\right]}_{x}=-\frac{C_{\delta}\kappa}{2}\rho^{(0)}u^{(0)}{\left|u^{(0)}\right|}, (2.8)
𝒪(1):\displaystyle\mathcal{O}(1): ρt(0)+(ρ(0)u(0))x=0,\displaystyle\rho^{(0)}_{t}+{\left(\rho^{(0)}u^{(0)}\right)}_{x}=0,
(ρ(0)u(0))t+[ρ(0)(u(0))2+γ(ρ(0))γ1ρ(2)]x\displaystyle{\left(\rho^{(0)}u^{(0)}\right)}_{t}+{\left[\rho^{(0)}{\left(u^{(0)}\right)}^{2}+\gamma{\left(\rho^{(0)}\right)}^{\gamma-1}\rho^{(2)}\right]}_{x}
=Cδκ2(ρ(2)u(0)|u(0)|+ρ(0)u(2)|u(0)|+ρ(0)u(0)|u(2)|).\displaystyle\hskip 56.9055pt=-\frac{C_{\delta}\kappa}{2}{\left(\rho^{(2)}u^{(0)}{\left|u^{(0)}\right|}+\rho^{(0)}u^{(2)}{\left|u^{(0)}\right|}+\rho^{(0)}u^{(0)}{\left|u^{(2)}\right|}\right)}.

Here, note that the 𝒪(ε2)\mathcal{O}(\varepsilon^{-2}) asymptotic is exactly that discussed in Remark 2.1.

Similarly, we consider the ε0\varepsilon\rightarrow 0 case on the coupling conditions at the pipe intersections. It is clear that (i) the condition related to conservation of momentum will remain as it is ε\varepsilon-independent; and (ii) regardless of your selection of coupling conditions (2.4), (2.5), or (2.6), all simplify to requiring equal pressures at the junction in the low Mach/high friction limit. Note that the different limiting equations have already been presented e.g. in [16]. The main aspect here is on their numerical treatment.

2.3 Numerical Difficulties in Low Mach/High Friction regimes

By computing the eigenvalues of the Jacobian 𝑭/𝑼\partial\bm{F}/\partial\bm{U}, one can find that the wave speeds of system (2.2) are

{u±1εp(ρ)}.{\left\{u\pm\frac{1}{\varepsilon}\sqrt{p^{\prime}(\rho)}\right\}}.

In turn, this implies that if one was to solve system (2.1) using some standard explicit method with a uniform mesh spatial discretization with cell size Δx{\Delta x}, the corresponding time-step restriction due to the CFL condition would be

ΔtexνΔxmaxx{|u|+1εp(ρ)}=𝒪(εΔx),{\Delta t}_{\rm{ex}}\leq\nu\frac{{\Delta x}}{\displaystyle{\max_{x}}{\left\{{\left|u\right|}+\frac{1}{\varepsilon}\sqrt{p^{\prime}(\rho)}\right\}}}={\mathcal{O}(\varepsilon{\Delta x})}, (2.9)

where 0<ν10<\nu\leq 1 denotes the CFL number. On top of this, explicit schemes typically have numerical diffusion of 𝒪((Δx)p/ε){\mathcal{O}{\left(({\Delta x})^{p}/\varepsilon\right)}} [37], where pp is the order of the method, further implying that one would need to select Δx=𝒪(ε1/p){\Delta x}={\mathcal{O}(\varepsilon^{1/p})} to combat excessive numerical diffusion in the results. Therefore, to obtain unsmeared results, the time-step restriction for explicit schemes would need to be Δtex=𝒪(ε1+1/p){\Delta t}_{\rm{ex}}=\mathcal{O}(\varepsilon^{1+1/p}). In other words, explicit schemes are quite inefficient in the low Mach and high friction regimes due to the significant computational cost.

An alternative to avoid the heavy time-step restriction seen in (2.9) would instead be to advance in time using an implicit method. However, this also could prove quite costly, as the nonlinearity of system (2.1) implies a dependence on some nonlinear iterative solver of an N×NN\times N system of equations, where NN is the number of cells in the spatial discretization.

Thus, we want a scheme that removes this ε\varepsilon-dependence in the time-step restriction, converges to the asymptotics in (2.8), and maintains the correct coupling conditions in the ε0\varepsilon\rightarrow 0 limit. The scheme proposed in the following section aims to meet these desired properties on the discrete level.

3 Asymptotic-Preserving Scheme

To form an AP scheme for the system (2.1) on a single pipeline, we follow the hyperbolic flux splitting idea from [37, 63]. To do so, we separate the slow and fast dynamics into two parts, resulting in the corresponding split system:

ρt+α(ρu)x+(1α)(ρu)x=0,\displaystyle\rho_{t}+\alpha{\left(\rho u\right)}_{x}+{\left(1-\alpha\right)}{\left(\rho u\right)}_{x}=0, (3.1)
(ρu)t+(ρu2+pa(t)ρε2)x+a(t)ε2ρx=Cδf2ε2ρu|u|.\displaystyle{\left(\rho u\right)}_{t}+{\left(\rho u^{2}+\frac{p-a(t)\rho}{\varepsilon^{2}}\right)}_{x}+\frac{a(t)}{\varepsilon^{2}}\rho_{x}=-\frac{C_{\delta}f}{2\varepsilon^{2}}\rho u{\left|u\right|}.

Equivalently, the split form (3.1) can be written into an updated vector form, which reads

𝑼t+𝑭~(𝑼)x+𝑭^(𝑼)x=𝑺(𝑼),\bm{U}_{t}+\widetilde{\bm{F}}{\left(\bm{U}\right)}_{x}+\widehat{\bm{F}}{\left(\bm{U}\right)}_{x}=\bm{S}{\left(\bm{U}\right)}, (3.2)

where

𝑭~(𝑼)=(αρuρu2+pa(t)ρε2),𝑭^(𝑼)=((1α)ρua(t)ρε2),\widetilde{\bm{F}}{\left(\bm{U}\right)}=\begin{pmatrix}\alpha\rho u\\[4.0pt] \displaystyle{\rho u^{2}+\frac{p-a(t)\rho}{\varepsilon^{2}}}\end{pmatrix},\qquad\widehat{\bm{F}}{\left(\bm{U}\right)}=\begin{pmatrix}{\left(1-\alpha\right)}\rho u\\[4.0pt] \displaystyle{\frac{a(t)\rho}{\varepsilon^{2}}}\end{pmatrix}, (3.3)

are the slow (non-stiff) and fast (stiff) dynamics parts of the fluxes, respectively, and 𝑺(𝑼)\bm{S}(\bm{U}) is defined in (2.2).

To guarantee the non-stiff subsystem 𝑼t+𝑭~(𝑼)x=𝟎\bm{U}_{t}+\widetilde{\bm{F}}{\left(\bm{U}\right)}_{x}=\bm{0} is indeed non-stiff and hyperbolic, α\alpha and a(t)a(t) must be chosen appropriately to remove the 1/ε21/\varepsilon^{2} dependence on the wave speeds. Computed by finding the eigenvalues of the Jacobian 𝑭~/𝑼\partial\widetilde{\bm{F}}/\partial\bm{U}, the wave speeds of this subsystem are

{u±(1α)u2+α[p(ρ)a(t)]ε2}.{\left\{u\pm\sqrt{{\left(1-\alpha\right)}u^{2}+\frac{\alpha{\left[p^{\prime}(\rho)-a(t)\right]}}{\varepsilon^{2}}}\right\}}. (3.4)

Thus, to ensure the eigenvalues of the non-stiff subsystem are real and are 𝒪(1){\mathcal{O}}(1) instead of 𝒪(ε2){\mathcal{O}}(\varepsilon^{-2}) as in the original system (2.1), we take

α=εbanda(t)=minxp(ρ),\alpha=\varepsilon^{b}\qquad\textrm{and}\qquad a(t)=\min_{x}p^{\prime}(\rho), (3.5)

and b2b\geq 2. In turn, the new wave speeds in (3.4) now avoid the dissipation and time-step issues seen in original system (2.1), allowing the slow dynamics to be discretized using any appropriate hyperbolic solver. We describe the hyberbolic solver we use in §3.2.

Remark 3.1.

Note that, in comparison to the work of [37, 63], we have less freedom in the selection of this parameter bb arising in (3.5). This is due to the fact that the asymptotic behavior shown in (2.8) allows for a non-constant ρ(0)\rho^{(0)} when ε0\varepsilon\rightarrow 0, meaning [p(ρ)a(t)]{\left[p^{\prime}(\rho)-a(t)\right]} is 𝒪(1).{\mathcal{O}}(1).

3.1 Time Discretization

To discretize the split system (3.2)–(3.3) in a way that relaxes the time-step stability restriction, we use the implicit-explicit (IMEX) approach; that is, we approximate the non-stiff flux terms 𝑭~(𝑼)x\widetilde{\bm{F}}(\bm{U})_{x} explicitly, and use an implicit approximation for the stiff flux terms 𝑭^(𝑼)x\widehat{\bm{F}}(\bm{U})_{x} and the friction source 𝑺(𝑼).\bm{S}(\bm{U}). Since the source term 𝑺(𝑼)\bm{S}(\bm{U}) is nonlinear, we opt for a time discretization related to Rosenbrock-type Runge-Kutta methods, which will still allow the system to be solved without the need of nonlinear solvers; see, e.g., [73, 79] and references therein. To this end, we use the following first-order IMEX time discretization:

ρn+1ρnΔt+α(ρu)xn+(1α)(ρu)xn+1=0,\displaystyle\frac{\rho^{n+1}-\rho^{n}}{{\Delta t}}+\alpha{\left(\rho u\right)}^{n}_{x}+{\left(1-\alpha\right)}{\left(\rho u\right)}^{n+1}_{x}=0, (3.6)
(ρu)n+1(ρu)nΔt+(ρu2+panρε2)xn+anε2ρxn+1=Cδκ2ε2|un|(ρu)n+1.\displaystyle\frac{{\left(\rho u\right)}^{n+1}-{\left(\rho u\right)}^{n}}{{\Delta t}}+{\left(\rho u^{2}+\frac{p-a^{n}\rho}{\varepsilon^{2}}\right)}^{n}_{x}+\frac{a^{n}}{\varepsilon^{2}}\rho^{n+1}_{x}=-\frac{C_{\delta}\kappa}{2\varepsilon^{2}}{\left|u^{n}\right|}{\left(\rho u\right)}^{n+1}. (3.7)

The influence of the Rosenbrock-type method appears in the discretization of the source of (3.7), in which only the ρu\rho u term is evaluated at time tn+1t^{n+1}. For simplicity and notation purposes, let us define

𝑹n:=(Rρ,n,Rρu,n)=𝑭~(𝑼)x.\bm{R}^{n}:=(R^{\rho,n},R^{\rho u,n})^{\top}=-\widetilde{\bm{F}}(\bm{U})_{x}.

One can then solve equations (3.6)–(3.7) for ρn+1\rho^{n+1} and (ρu)n+1(\rho u)^{n+1}, respectively, to obtain

ρn+1\displaystyle\rho^{n+1} =ρn+ΔtRρ,nΔt(1α)(ρu)xn+1,\displaystyle=\rho^{n}+{\Delta t}R^{\rho,n}-{\Delta t}(1-\alpha){\left(\rho u\right)}^{n+1}_{x}, (3.8)
(ρu)n+1\displaystyle{\left(\rho u\right)}^{n+1} =1Ψn(x)[(ρu)n+ΔtRρu,nanΔtε2ρxn+1],\displaystyle=\frac{1}{\Psi^{n}(x)}{\left[{\left(\rho u\right)}^{n}+{\Delta t}R^{\rho u,n}-\frac{a^{n}{\Delta t}}{\varepsilon^{2}}\rho^{n+1}_{x}\right]}, (3.9)

where

Ψn(x):=1+ΔtCδκ2ε2|un|\Psi^{n}(x):=1+{\Delta t}\cdot\frac{C_{\delta}\kappa}{2\varepsilon^{2}}{\left|u^{n}\right|} (3.10)

is always greater than 1. Following then that of [21], we then differentiate (3.9) with respect to xx and substitute this into (3.8) to obtain an elliptic equation for ρn+1:\rho^{n+1}:

ρn+1Δt2ε2an(1α)(ρxn+1Ψn)x=ρn+ΔtRρ,nΔt(1α)[(ρu)n+ΔtRρu,nΨn]x.\rho^{n+1}-\frac{{\Delta t}^{2}}{\varepsilon^{2}}a^{n}(1-\alpha){\left(\frac{\rho^{n+1}_{x}}{\Psi^{n}}\right)}_{x}=\rho^{n}+{\Delta t}R^{\rho,n}-{\Delta t}(1-\alpha){\left[\frac{{\left(\rho u\right)}^{n}+{\Delta t}R^{\rho u,n}}{\Psi^{n}}\right]}_{x}. (3.11)

Assuming all values at time tnt^{n} are known, this implies that the choice of the Rosenbrock-type method in (3.7) results in just a linear equation for the unknown ρn+1\rho^{n+1}. Furthermore, the time discretization in (3.7) in combination with an appropriate spatial discretization, such as that further detailed in §3.2 and §3.3, will result in (3.11) being a linear system that can be solved for ρn+1\rho^{n+1}. This solution of ρn+1\rho^{n+1} is then substituted into (3.9) to obtain (ρu)n+1(\rho u)^{n+1}.

3.2 Spatial Discretization of Non-Stiff Flux Terms

We use the Central-Upwind (CU) finite volume scheme to discretize the non-stiff flux terms 𝑭~(𝑼)\widetilde{\bm{F}}(\bm{U}). For each pipe in the network, we split the domain into NN finite volume cells Cj=[xj12,xj+12]C_{j}=[x_{j-\frac{1}{2}},x_{j+\frac{1}{2}}], where Δx=xj+12xj12{\Delta x}=x_{j+\frac{1}{2}}-x_{j-\frac{1}{2}}. Assume that at time level t=tnt=t^{n}, the solution is realized in terms of its cell averages

 𝑼jn=1ΔxCj𝑼(x,tn)𝑑x.\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j}^{n}=\frac{1}{{\Delta x}}\int_{C_{j}}\bm{U}(x,t^{n})\ dx.

Then we approximate the contribution of the non-stiff flux terms 𝑹:=𝑭~(𝑼)x\bm{R}:=-\widetilde{\bm{F}}(\bm{U})_{x} in each cell using

𝓡jn=𝓕~j+12n𝓕~j12nΔx,{\bm{{\mathcal{R}}}}^{n}_{j}=-\frac{\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{j+\frac{1}{2}}-\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{j-\frac{1}{2}}}{{\Delta x}}, (3.12)

where 𝓕~j±12n\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{j\pm\frac{1}{2}} are computed using the CU fluxes; see, e.g., [38, 60, 61]:

𝓕~j+12n=sj+12+𝑭~(𝑼j+12)sj+12𝑭~(𝑼j+12+)sj+12+sj+12+sj+12+sj+12sj+12+sj+12(𝑼j+12+𝑼j+12).\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{j+\frac{1}{2}}=\frac{s^{+}_{j+\frac{1}{2}}\widetilde{\bm{F}}{\left(\bm{U}^{-}_{j+\frac{1}{2}}\right)}-s^{-}_{j+\frac{1}{2}}\widetilde{\bm{F}}{\left(\bm{U}^{+}_{j+\frac{1}{2}}\right)}}{s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}}+\frac{s^{+}_{j+\frac{1}{2}}s^{-}_{j+\frac{1}{2}}}{s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}}{\left(\bm{U}^{+}_{j+\frac{1}{2}}-\bm{U}^{-}_{j+\frac{1}{2}}\right)}. (3.13)

Here, 𝑼j+12±\bm{U}^{\pm}_{j+\frac{1}{2}} are one-sided point values of 𝑼\bm{U} at the cell interface, computed at time t=tnt=t^{n} using the piecewise linear reconstruction

𝑼~n(x):= 𝑼jn+(𝑼x)jn(xxj),xCj.\widetilde{\bm{U}}^{n}(x):=\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j}+{\left(\bm{U}_{x}\right)}^{n}_{j}{\left(x-x_{j}\right)},\quad x\in C_{j}.

Therefore, the values of the reconstruction at the interface xj+12x_{j+\frac{1}{2}} are

𝑼j+12= 𝑼jn+Δx2(𝑼x)jn,𝑼j+12+= 𝑼j+1nΔx2(𝑼x)j+1n,\bm{U}^{-}_{j+\frac{1}{2}}=\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j}+\frac{{\Delta x}}{2}{\left(\bm{U}_{x}\right)}^{n}_{j},\qquad\bm{U}^{+}_{j+\frac{1}{2}}=\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j+1}-\frac{{\Delta x}}{2}{\left(\bm{U}_{x}\right)}^{n}_{j+1}, (3.14)

where the slopes (𝑼x)jn{\left(\bm{U}_{x}\right)}^{n}_{j} are computed using a nonlinear limiter to avoid oscillations. In this paper, we use the generalized minmod limiter (see, e.g., [62, 65, 71]):

(𝑼x)jn=minmod(θ 𝑼j+1n 𝑼jnΔx, 𝑼j+1n 𝑼j1n2Δx,θ 𝑼jn 𝑼j1nΔx),{\left(\bm{U}_{x}\right)}^{n}_{j}={\textrm{minmod}}{\left(\theta\frac{\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j+1}-\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j}}{{\Delta x}},\ \frac{\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j+1}-\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j-1}}{2{\Delta x}},\ \theta\frac{\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j}-\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}^{n}_{j-1}}{{\Delta x}}\right)},

where the minmod function is

minmod(z1,z2,)={min(z1,z2,)ifzi>0,i,max(z1,z2,)ifzi<0,i,0otherwise,\mbox{minmod}(z_{1},z_{2},\ldots)=\left\{\begin{aligned} &\min(z_{1},z_{2},\cdots)&&\mbox{if}\leavevmode\nobreak\ z_{i}>0,\leavevmode\nobreak\ \forall i,\\ &\max(z_{1},z_{2},\cdots)&&\mbox{if}\leavevmode\nobreak\ z_{i}<0,\leavevmode\nobreak\ \forall i,\\ &0&&\mbox{otherwise},\end{aligned}\right.

and is applied component-wise. Lastly, sj+12±s^{\pm}_{j+\frac{1}{2}} of (3.13) denote the one-sided speeds of propagation, estimated at time t=tnt=t^{n} using the largest and smallest eigenvalues of the Jacobian 𝑭~/𝑼\partial\widetilde{\bm{F}}/\partial\bm{U} seen in (3.4):

sj+12+=\displaystyle s^{+}_{j+\frac{1}{2}}= max{uj+12+(1α)(uj+12)2+αε2[p(ρj+12)an],\displaystyle\max\left\{u^{-}_{j+\frac{1}{2}}+\sqrt{{\left(1-\alpha\right)}{\left(u^{-}_{j+\frac{1}{2}}\right)}^{2}+\frac{\alpha}{\varepsilon^{2}}{\left[p^{\prime}{\left(\rho^{-}_{j+\frac{1}{2}}\right)}-a^{n}\right]}},\right. (3.15)
uj+12++(1α)(uj+12+)2+αε2[p(ρj+12+)an],0},\displaystyle\hskip 56.9055pt\left.u^{+}_{j+\frac{1}{2}}+\sqrt{{\left(1-\alpha\right)}{\left(u^{+}_{j+\frac{1}{2}}\right)}^{2}+\frac{\alpha}{\varepsilon^{2}}{\left[p^{\prime}{\left(\rho^{+}_{j+\frac{1}{2}}\right)}-a^{n}\right]}},0\right\},
sj+12=\displaystyle s^{-}_{j+\frac{1}{2}}= min{uj+12(1α)(uj+12)2+αε2[p(ρj+12)an],\displaystyle\min\left\{u^{-}_{j+\frac{1}{2}}-\sqrt{{\left(1-\alpha\right)}{\left(u^{-}_{j+\frac{1}{2}}\right)}^{2}+\frac{\alpha}{\varepsilon^{2}}{\left[p^{\prime}{\left(\rho^{-}_{j+\frac{1}{2}}\right)}-a^{n}\right]}},\right.
uj+12+(1α)(uj+12+)2+αε2[p(ρj+12+)an],0}.\displaystyle\hskip 56.9055pt\left.u^{+}_{j+\frac{1}{2}}-\sqrt{{\left(1-\alpha\right)}{\left(u^{+}_{j+\frac{1}{2}}\right)}^{2}+\frac{\alpha}{\varepsilon^{2}}{\left[p^{\prime}{\left(\rho^{+}_{j+\frac{1}{2}}\right)}-a^{n}\right]}},0\right\}.

3.3 Fully Discrete Method

To obtain the fully discrete AP scheme for cell CjC_{j}, we take the elliptic equation for ρn+1\rho^{n+1} in (3.11) and the equation for (ρu)n+1(\rho u)^{n+1} in (3.9) and (i) compute non-stiff flux terms 𝑹n=𝑭~(𝑼)x\bm{R}^{n}=-\widetilde{\bm{F}}(\bm{U})_{x} using the CU numerical fluxes described in §3.2; (ii) discretize the first spatial derivative terms using standard second-order central difference; and (iii) use a standard finite difference approximation for second derivatives on the term (ρxn+1/Ψn)x{\left(\rho_{x}^{n+1}/\Psi^{n}\right)}_{x}. Thus, the fully discrete AP scheme for  ρjn+1\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n+1} reads

 ρjn+1Δt2Δx2ε2an(1α)[ϕj+12n ρj+1n+1(ϕj+12n+ϕj12n) ρjn+1+ϕj12n ρj1n+1]\displaystyle\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}-\frac{{\Delta t}^{2}}{{\Delta x}^{2}\varepsilon^{2}}a^{n}(1-\alpha){\left[\phi^{n}_{j+\frac{1}{2}}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j+1}-{\left(\phi^{n}_{j+\frac{1}{2}}+\phi^{n}_{j-\frac{1}{2}}\right)}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}+\phi^{n}_{j-\frac{1}{2}}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j-1}\right]} (3.16)
= ρjn+Δtjρ,nΔt(1α)Dx[1Ψjn(( ρu)jn+Δtjρu,n)],\displaystyle\hskip 113.81102pt=\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n}_{j}+{\Delta t}{\mathcal{R}}^{\rho,n}_{j}-{\Delta t}(1-\alpha)D_{x}{\left[\frac{1}{\Psi^{n}_{j}}{\left({\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n}_{j}+{\Delta t}{\mathcal{R}}^{\rho u,n}_{j}\right)}\right]},

where 𝓡jn=(jρ,n,jρu,n){\bm{{\mathcal{R}}}}^{n}_{j}=({\mathcal{R}}^{\rho,n}_{j},{\mathcal{R}}^{\rho u,n}_{j})^{\top} is defined in (3.12)–(3.13), Ψjn=Ψn(xj)\Psi_{j}^{n}=\Psi^{n}(x_{j}) from (3.10),

Dxξj=ξj+1ξj12ΔxD_{x}\xi_{j}=\frac{\xi_{j+1}-\xi_{j-1}}{2{\Delta x}}

is the discrete central difference operator, and

ϕj+12n=12[1Ψjn+1Ψj+1n]\phi^{n}_{j+\frac{1}{2}}=\frac{1}{2}{\left[\frac{1}{\Psi^{n}_{j}}+\frac{1}{\Psi^{n}_{j+1}}\right]}

is used for the evaluation of 1/Ψj+12n1/\Psi_{j+\frac{1}{2}}^{n} to keep the second-order spatial approximation in the elliptic solve. Note that the definition of Ψjn\Psi_{j}^{n} in (3.10) results in 0<ϕj+12n10<\phi^{n}_{j+\frac{1}{2}}\leq 1, in turn implying that the corresponding matrix to be formed on the right hand side of (3.16) is non-singular (by Gershgorin Theorem).

After solving the linear system in (3.16) for { ρjn+1}{\left\{\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n+1}\right\}}, it can be directly substituted into the spatially discretized version of (3.9) to obtain the fully discrete approximation for ( ρu)jn+1{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}:

( ρu)jn+1=1Ψjn[( ρu)jn+Δtjρu,nanΔtε2Dx ρjn+1].{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}=\frac{1}{\Psi^{n}_{j}}{\left[{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n}_{j}+{\Delta t}{\mathcal{R}}^{\rho u,n}_{j}-\frac{a^{n}{\Delta t}}{\varepsilon^{2}}D_{x}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}\right]}. (3.17)

3.4 Numerical Diffusion and Stability

In this section, we describe how the proposed method addresses the numerical difficulties of explicit schemes previously discussed in §2.3.

The stability of the proposed AP scheme is ensured by Lemma 3.1 of [37], which states that if each piece (the implicit and explicit portions) of the split method is stable, then the full method is also stable. For the fast (stiff) dynamics, one can show that implicit discretization in time, seen in (3.6)–(3.7), is stable for all ρn\rho^{n} and unu^{n}. Thus, stability of the proposed AP scheme is controlled by the time discretization of the slow (non-stiff) dynamics. The CFL condition for the slow dynamics can be found using the eigenvalues from (3.4), resulting in the following time-step restriction:

ΔtAPνΔxmaxx{|u|+(1α)u2+αε2[p(ρ)a(t)]},{\Delta t}_{\rm{AP}}\leq\nu\frac{{\Delta x}}{\displaystyle{\max_{x}}{\left\{{\left|u\right|}+\sqrt{{\left(1-\alpha\right)}u^{2}+\frac{\alpha}{\varepsilon^{2}}{\left[p^{\prime}(\rho)-a(t)\right]}}\right\}}}, (3.18)

in which, due to the selection of α\alpha and a(t)a(t) made in (3.5), the denominator is independent of ε\varepsilon.

To ensure ΔtAP{\Delta t}_{\rm{AP}} is completely ε\varepsilon-independent, we must also confirm the numerical diffusion of the proposed scheme does not have a ε1\varepsilon^{-1} dependence or worse. To do this, we analyze the leading order of numerical diffusion of the CU spatial discretization described in §3.2, and substitute this into the full discretization in equations (3.16)–(3.17). We start by rewriting the CU flux in (3.13) in the form

𝓕~j+12n=𝑭~( 𝑼jn)+𝑭~( 𝑼j+1n)2+𝓓j+12n,\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{j+\frac{1}{2}}=\frac{\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j}^{n})+\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j+1}^{n})}{2}+{\bm{{\mathcal{D}}}}^{n}_{j+\frac{1}{2}},

where

𝓓j+12n=\displaystyle{\bm{{\mathcal{D}}}}^{n}_{j+\frac{1}{2}}= sj+12+2(sj+12+sj+12)[2𝑭~(𝑼j+12)𝑭~( 𝑼jn)𝑭~( 𝑼j+1n)]\displaystyle\frac{s^{+}_{j+\frac{1}{2}}}{2{\left(s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}\right)}}{\left[2\widetilde{{\bm{F}}}(\bm{U}^{-}_{j+\frac{1}{2}})-\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j}^{n})-\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j+1}^{n})\right]} (3.19)
sj+122(sj+12+sj+12)[2𝑭~(𝑼j+12+)𝑭~( 𝑼jn)𝑭~( 𝑼j+1n)]+sj+12+sj+12sj+12+sj+12(𝑼j+12+𝑼j+12),\displaystyle-\frac{s^{-}_{j+\frac{1}{2}}}{2{\left(s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}\right)}}{\left[2\widetilde{{\bm{F}}}(\bm{U}^{+}_{j+\frac{1}{2}})-\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j}^{n})-\widetilde{{\bm{F}}}(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\bm{U}$\kern 0.0pt}}}_{j+1}^{n})\right]}+\frac{s^{+}_{j+\frac{1}{2}}s^{-}_{j+\frac{1}{2}}}{s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}}{\left(\bm{U}^{+}_{j+\frac{1}{2}}-\bm{U}^{-}_{j+\frac{1}{2}}\right)},

is the numerical diffusion term of the CU discretization, with 𝓓j+12n:=(𝒟j+12ρ,n,𝒟j+12ρu,n){\bm{{\mathcal{D}}}}_{j+\frac{1}{2}}^{n}:=({\mathcal{D}}^{\rho,n}_{j+\frac{1}{2}},{\mathcal{D}}^{\rho u,n}_{j+\frac{1}{2}})^{\top} to denote the different components. Here, sj+12±s^{\pm}_{j+\frac{1}{2}} are defined in (3.15) and 𝑼j+12±\bm{U}^{\pm}_{j+\frac{1}{2}} are defined in (3.14). To compute the leading order of the numerical diffusion in (3.19), we introduce the following asymptotic expansions:

 ρjn\displaystyle\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n}_{j} =ρj(0),n+ε2ρj(1),n+,\displaystyle=\rho^{(0),n}_{j}+\varepsilon^{2}\rho^{(1),n}_{j}+\cdots,
ρj+12±\displaystyle\rho^{\pm}_{j+\frac{1}{2}} =ρj+12(0),±+ε2ρj+12(1),±+.\displaystyle=\rho^{(0),\pm}_{j+\frac{1}{2}}+\varepsilon^{2}\rho^{(1),\pm}_{j+\frac{1}{2}}+\cdots.

The asymptotic expansion of ujnu_{j}^{n} and uj+12±u^{\pm}_{j+\frac{1}{2}} follows analogously, and the discrete asymptotic expansion of the pressure term follows the same form as that in equation (2.7). In addition, we expand ana^{n} in a way that follows its definition in (3.5):

an=minxγ(ρj(0),n)γ1+ε2a(2),n+,a^{n}=\min_{x}\gamma{\left(\rho_{j}^{(0),n}\right)}^{\gamma-1}+\varepsilon^{2}a^{(2),n}+\cdots,

where a(2),na^{(2),n} is a constant in space at time tnt^{n}. Using these expansions, we can obtain the leading order of the numerical diffusion (3.19) for ρ\rho:

𝒟j+12ρ,n=\displaystyle{\mathcal{D}}^{\rho,n}_{j+\frac{1}{2}}= αsj+12+2(sj+12+sj+12)[2ρj+12(0),uj+12(0),ρj(0),nuj(0),nρj+1(0),nuj+1(0),n]\displaystyle\frac{\alpha s^{+}_{j+\frac{1}{2}}}{2{\left(s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}\right)}}{\left[2\rho^{(0),-}_{j+\frac{1}{2}}u^{(0),-}_{j+\frac{1}{2}}-\rho^{(0),n}_{j}u^{(0),n}_{j}-\rho^{(0),n}_{j+1}u^{(0),n}_{j+1}\right]} (3.20)
αsj+122(sj+12+sj+12)[2ρj+12(0),+uj+12(0),+ρj(0),nuj(0),nρj+1(0),nuj+1(0),n]\displaystyle-\frac{\alpha s^{-}_{j+\frac{1}{2}}}{2{\left(s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}\right)}}{\left[2\rho^{(0),+}_{j+\frac{1}{2}}u^{(0),+}_{j+\frac{1}{2}}-\rho^{(0),n}_{j}u^{(0),n}_{j}-\rho^{(0),n}_{j+1}u^{(0),n}_{j+1}\right]}
+sj+12+sj+12sj+12+sj+12(ρj+12(0),+ρj+12(0),).\displaystyle+\frac{s^{+}_{j+\frac{1}{2}}s^{-}_{j+\frac{1}{2}}}{s^{+}_{j+\frac{1}{2}}-s^{-}_{j+\frac{1}{2}}}{\left(\rho^{(0),+}_{j+\frac{1}{2}}-\rho^{(0),-}_{j+\frac{1}{2}}\right)}.

Since α=εb,b2\alpha=\varepsilon^{b},\ b\geq 2 from (3.5), this is 𝒪(1){\mathcal{O}}(1) by the last term of (3.20), as ρ\rho is generally not constant in space. Similarly, one can compute the leading order of numerical diffusion (3.19) for ρu\rho u, which comes from the 𝒪(ε2){\mathcal{O}}(\varepsilon^{-2}) portion of the flux 𝑭~(𝑼)\widetilde{\bm{F}}(\bm{U}) seen in equation (3.2). However, since ana^{n} and its expansion are related to p(ρ)p^{\prime}(\rho) and p(ρ)=ργp(\rho)=\rho^{\gamma}, it is clear that the expansions to compute the diffusion will not result in any cancellation of the ε2\varepsilon^{-2} term. Thus, 𝒟j+12ρu,n=𝒪(ε2){\mathcal{D}}^{\rho u,n}_{j+\frac{1}{2}}={\mathcal{O}}(\varepsilon^{-2}).

Finally, substituting the CU fluxes into (3.12), we can obtain the following approximations to 𝓡jn{\bm{{\mathcal{R}}}}_{j}^{n}:

jρ,n\displaystyle{\mathcal{R}}_{j}^{\rho,n} =DxF~ρ(𝑼jn)+𝒪(Δx2),\displaystyle=-D_{x}\widetilde{F}^{\rho}(\bm{U}_{j}^{n})+{\mathcal{O}}({\Delta x}^{2}), (3.21)
jρu,n\displaystyle{\mathcal{R}}_{j}^{\rho u,n} =DxF~ρu(𝑼jn)+𝒪(Δx2ε2),\displaystyle=-D_{x}\widetilde{F}^{\rho u}(\bm{U}_{j}^{n})+{\mathcal{O}}{\left(\frac{{\Delta x}^{2}}{\varepsilon^{2}}\right)}, (3.22)

where 𝑭~:=(F~ρ,F~ρu)\widetilde{\bm{F}}:=(\widetilde{F}^{\rho},\widetilde{F}^{\rho u})^{\top} and DxD_{x} again represents the central difference operator. Here, the 𝒪(Δx2){\mathcal{O}}({\Delta x}^{2}) term in (3.21) and the 𝒪(ε2Δx2){\mathcal{O}}(\varepsilon^{-2}{\Delta x}^{2}) term in (3.22) come from the leading orders from the diffusion 𝒟j+12ρ,n{\mathcal{D}}^{\rho,n}_{j+\frac{1}{2}} and 𝒟j+12ρu,n{\mathcal{D}}^{\rho u,n}_{j+\frac{1}{2}}, respectively, and the Δx2{\Delta x}^{2} piece arises since these diffusion terms are introduced via the second-order CU discretization.

Normally, this 𝒪(ε2Δx2){\mathcal{O}}(\varepsilon^{-2}{\Delta x}^{2}) diffusion term is concerning. However, if we substitute (3.22) into the fully discrete AP scheme seen (3.16) and (3.17), we see that this 𝒪(ε2Δx2){\mathcal{O}}(\varepsilon^{-2}{\Delta x}^{2}) diffusion term is always paired with a division by Ψjn\Psi_{j}^{n}. Then, since Ψjn\Psi_{j}^{n} defined in (3.10) is 𝒪(ε2){\mathcal{O}}(\varepsilon^{-2}), the dependence of ε\varepsilon in the leading order diffusion term cancels. This ε\varepsilon-independence within the numerical diffusion, in combination with the denominator of (3.18) being independent of ε\varepsilon, implies that the time-step restriction of the proposed AP scheme is indeed independent of ε\varepsilon. Furthermore, it is sufficient to take ΔtAP=𝒪(Δx){\Delta t}_{\rm AP}={\mathcal{O}}({\Delta x}) (as opposed to the 𝒪(εΔx){\mathcal{O}}(\varepsilon{\Delta x}) restriction on explicit schemes) to enforce stability.

3.5 Boundary Conditions on Pipe Networks

3.5.1 Coupling Conditions at Pipe Intersections

The algorithm described in §3.1–§3.3 is applied to every pipe within the network of interest. To extend to a full network, we must implement coupling conditions (2.3), with one choice of (2.4), (2.5) or (2.6), on the boundaries of each pipe that meets at the intersections. To obtain the boundary values corresponding to the junction, we solve the so-called half-Riemann problem: Assume a set of coupling conditions from §2.1 and given constant initial data (𝑼0)(k)(\bm{U}^{0})^{(k)} for each pipe kk. We then seek the values 𝑼\bm{U}^{*} satisfying the coupling conditions such that the half-Riemann problem [41, 41, 32]

𝑼t(k)+𝑭(𝑼(k))x=𝟎,\displaystyle\bm{U}^{(k)}_{t}+\bm{F}(\bm{U}^{(k)})_{x}=\bm{0}, (3.23)
𝑼(x,0)={𝑼,if x0,(𝑼0)(k),if x>0,\displaystyle\bm{U}(x,0)=\left\{\begin{aligned} &\bm{U}^{*},&&\textrm{if }x\leq 0,\\ &(\bm{U}^{0})^{(k)},&&\textrm{if }x>0,\end{aligned}\right.

admits a self-similar solution in which all generated waves have non-negative speeds. Here, 𝑼\bm{U} and 𝑭(𝑼)\bm{F}(\bm{U}) are defined in (2.2). Then, if considering coupling conditions (2.3) and (2.4), this amounts to solving the following nonlinear system for (ρ)(k)(\rho^{*})^{(k)}:

k=1KL2((ρ)(k);(ρn)(k),L1+((ρn)(k);(𝑼0)(k)))=0,\displaystyle\sum_{k=1}^{K}L_{2}^{-}{\left((\rho^{*})^{(k)};(\rho^{n})^{(k)},L_{1}^{+}{\left((\rho^{n})^{(k)};(\bm{U}^{0})^{(k)}\right)}\right)}=0, (3.24)
p((ρ)(k))=p((ρ)()),k,\displaystyle p{\left((\rho^{*})^{(k)}\right)}=p{\left((\rho^{*})^{(\ell)}\right)},\qquad k\neq\ell,

where the known states are (𝑼0)(k)(\bm{U}^{0})^{(k)} and (𝑼n)(k)(\bm{U}^{n})^{(k)}, and the functions L1,2±L_{1,2}^{\pm} denote the forward and reversed 1-Lax curve and 2-Lax curve for the isothermal Euler equations in equation (2.1) with p=ργp=\rho^{\gamma} (see similarly, [19]):

L1+(ρ;ρ^,q^)\displaystyle L_{1}^{+}{\left(\rho;\widehat{\rho},\widehat{q}\right)} ={ρρ^q^2γ1ρ1ε(p(ρ)p(ρ^)),if ρ<ρ^,ρρ^q^1ερρ^(ρρ^)[p(ρ)p(ρ^)],if ρ>ρ^,\displaystyle=\left\{\begin{aligned} &\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{2}{\gamma-1}\rho\cdot\frac{1}{\varepsilon}{\left(\sqrt{p^{\prime}(\rho)}-\sqrt{p^{\prime}(\widehat{\rho})}\right)},&&\textrm{if }\rho<\widehat{\rho},\\[4.0pt] &\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{1}{\varepsilon}\sqrt{\frac{\rho}{\widehat{\rho}}{\left(\rho-\widehat{\rho}\right)}{\left[p(\rho)-p(\widehat{\rho})\right]}},&&\textrm{if }\rho>\widehat{\rho},\end{aligned}\ \right. (3.25)
L2(ρ;ρ^,q^)\displaystyle L_{2}^{-}{\left(\rho;\widehat{\rho},\widehat{q}\right)} ={ρρ^q^2γ1ρ1ε(p(ρ^)p(ρ)),if ρ<ρ^.ρρ^q^+1ερρ^(ρρ^)[p(ρ)p(ρ^)],if ρ>ρ^,\displaystyle=\left\{\begin{aligned} &\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{2}{\gamma-1}\rho\cdot\frac{1}{\varepsilon}{\left(\sqrt{p^{\prime}(\widehat{\rho})}-\sqrt{p^{\prime}(\rho)}\right)},&&\textrm{if }\rho<\widehat{\rho}.\\[4.0pt] &\frac{\rho}{\widehat{\rho}}\ \widehat{q}+\frac{1}{\varepsilon}\sqrt{\frac{\rho}{\widehat{\rho}}{\left(\rho-\widehat{\rho}\right)}{\left[p(\rho)-p(\widehat{\rho})\right]}},&&\textrm{if }\rho>\widehat{\rho},\end{aligned}\ \right.

The construction of system (3.24) would follow analogously if instead using the coupling conditions in (2.5) or (2.6).

The known states (𝑼n)(k)(\bm{U}^{n})^{(k)} seen in (3.24) are selected by taking the cell value nearest the junction at time t=tnt=t^{n}; i.e., we take (𝑼n)(k)=(𝑼Nn)(k)(\bm{U}^{n})^{(k)}=(\bm{U}^{n}_{N})^{(k)} for ingoing pipelines and (𝑼n)(k)=(𝑼1n)(k)(\bm{U}^{n})^{(k)}=(\bm{U}^{n}_{1})^{(k)} for outgoing pipelines. The nonlinear system (3.24) is solved via Newton’s method with initial guess 𝑼=(𝑼n)(k)\bm{U}^{*}=(\bm{U}^{n})^{(k)}, in which the Jacobian within the Newton iteration is invertible if the initial guess is subsonic [19]. Note the 1/ε1/\varepsilon dependence in the 1-Lax curve and 2-Lax curve only arises due to considering the non-dimensionalized system (2.2), and does not destroy the nonlinear solve of (3.24). This is further verified in Lemma 3.2. For the numerical experiments conducted in this paper, we observed convergence to a tolerance of 10810^{-8} within \sim2–3 Newton iterations.

Once (ρ)(k)(\rho^{*})^{(k)} is computed, we can directly calculate (ρu)(k)(\rho^{*}u^{*})^{(k)} using

(ρu)(k)=L2((ρ)(k);(ρn)(k),L1+((ρn)(k);(𝑼0)(k))).(\rho^{*}u^{*})^{(k)}=L_{2}^{-}{\left((\rho^{*})^{(k)};(\rho^{n})^{(k)},L_{1}^{+}{\left((\rho^{n})^{(k)};(\bm{U}^{0})^{(k)}\right)}\right)}.

The results of the nonlinear solve (ρ)(k)(\rho^{*})^{(k)} and (ρu)(k)(\rho^{*}u^{*})^{(k)} are then prescribed as the ghost cell values in the spatial discretization described in §3.2.

Lemma 3.2.

In the limiting case ε0\varepsilon\rightarrow 0, the nonlinear system (3.24) with Lax curve definitions (3.25) remains a well-posed problem.

Proof.

Since the second condition of (3.24) is ε\varepsilon-independent, we only need to focus on the first condition. For brevity, let us first rewrite the Lax-curve definitions in (3.25) as

L1+(ρ;ρ^,q^)={ρρ^q^1εg(ρ,ρ^),if ρ<ρ^,ρρ^q^1εh(ρ,ρ^),if ρ>ρ^,andL2(ρ;ρ^,q^)={ρρ^q^+1εg(ρ,ρ^),if ρ<ρ^,ρρ^q^+1εh(ρ,ρ^),if ρ>ρ^,L_{1}^{+}{\left(\rho;\widehat{\rho},\widehat{q}\right)}=\left\{\begin{aligned} &\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{1}{\varepsilon}g(\rho,\widehat{\rho}),&&\textrm{if }\rho<\widehat{\rho},\\[4.0pt] &\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{1}{\varepsilon}h(\rho,\widehat{\rho}),&&\textrm{if }\rho>\widehat{\rho},\end{aligned}\ \right.\quad\textrm{and}\quad L_{2}^{-}{\left(\rho;\widehat{\rho},\widehat{q}\right)}=\left\{\begin{aligned} &\frac{\rho}{\widehat{\rho}}\ \widehat{q}+\frac{1}{\varepsilon}g(\rho,\widehat{\rho}),&&\textrm{if }\rho<\widehat{\rho},\\[4.0pt] &\frac{\rho}{\widehat{\rho}}\ \widehat{q}+\frac{1}{\varepsilon}h(\rho,\widehat{\rho}),&&\textrm{if }\rho>\widehat{\rho},\end{aligned}\ \right.

where g(ρ,ρ^)g(\rho,\widehat{\rho}) and h(ρ,ρ^)h(\rho,\widehat{\rho}) are taken such that these are equivalent to (3.25). In this proof, we will only consider the case in which ρ>ρ^\rho>\widehat{\rho} for both L1+L_{1}^{+} and L2L_{2}^{-}, and the proofs for the other three pairings follow analogously. Following this assumption, then the Lax curves for this case read

L1+(ρ;ρ^,q^)=ρρ^q^1εh(ρ,ρ^)andL2(ρ;ρ^,q^)=ρρ^q^+1εh(ρ,ρ^).L_{1}^{+}{\left(\rho;\widehat{\rho},\widehat{q}\right)}=\frac{\rho}{\widehat{\rho}}\ \widehat{q}-\frac{1}{\varepsilon}h(\rho,\widehat{\rho})\qquad\textrm{and}\qquad L_{2}^{-}{\left(\rho;\widehat{\rho},\widehat{q}\right)}=\frac{\rho}{\widehat{\rho}}\ \widehat{q}+\frac{1}{\varepsilon}h(\rho,\widehat{\rho}).

Note that in the context of the nonlinear system (3.24), the case in which ρ>ρ^\rho>\widehat{\rho} for both L1+L_{1}^{+} and L2L_{2}^{-} is equivalent to having (ρ0)(k)<(ρn)(k)(\rho^{0})^{(k)}<(\rho^{n})^{(k)} and (ρn)(k)<(ρ)(k)(\rho^{n})^{(k)}<(\rho^{*})^{(k)}. We can then use this specific case of the Lax curves and substitute directly into (3.24) to obtain the nonlinear system:

k=1K(ρ)(k)(ρn)(k)[(ρn)(k)(ρ0)(k)(q0)(k)1εh((ρn)(k),(ρ0)(k))]+1εh((ρ)(k),(ρn)(k))=0,\displaystyle\sum_{k=1}^{K}\frac{(\rho^{*})^{(k)}}{(\rho^{n})^{(k)}}{\left[\frac{(\rho^{n})^{(k)}}{(\rho^{0})^{(k)}}(q^{0})^{(k)}-\frac{1}{\varepsilon}h{\left((\rho^{n})^{(k)},(\rho^{0})^{(k)}\right)}\right]}+\frac{1}{\varepsilon}h{\left((\rho^{*})^{(k)},(\rho^{n})^{(k)}\right)}=0, (3.26)
p((ρ)(k))=p((ρ)()),k.\displaystyle p{\left((\rho^{*})^{(k)}\right)}=p{\left((\rho^{*})^{(\ell)}\right)},\qquad k\neq\ell.

This system with ε>0\varepsilon>0 has already been proven to be a well-posed system in [19]. We then multiply the first equation of (3.26) by ε\varepsilon and take the limit ε0\varepsilon\rightarrow 0 to obtain an equivalent nonlinear system in which we wish to solve for (ρ)(k)(\rho^{*})^{(k)}, which reads

k=1Kh((ρ)(k),(ρn)(k))(ρ)(k)(ρn)(k)h((ρn)(k),(ρ0)(k))=0,\displaystyle\sum_{k=1}^{K}h{\left((\rho^{*})^{(k)},(\rho^{n})^{(k)}\right)}-\frac{(\rho^{*})^{(k)}}{(\rho^{n})^{(k)}}h{\left((\rho^{n})^{(k)},(\rho^{0})^{(k)}\right)}=0, (3.27)
p((ρ)(k))=p((ρ)()),k.\displaystyle p{\left((\rho^{*})^{(k)}\right)}=p{\left((\rho^{*})^{(\ell)}\right)},\qquad k\neq\ell.

This is equivalent to that of (3.26) with (q0)(k)(q^{0})^{(k)} being taken as zero. Therefore, this is also already proven as a well-posed problem by the work in [19]. Hence, the system (3.24) is well-posed in the limiting case ε0\varepsilon\rightarrow 0. ∎

Remark 3.3.

As stated in §2.2, the other coupling conditions (2.5) and (2.6) reduce to the pressure balance coupling condition in (2.4) in the limiting case ε0\varepsilon\rightarrow 0. Thus, Lemma 3.2 is additionally valid for coupling conditions (2.5) and (2.6), as their corresponding nonlinear systems would also reduce to (3.27) in the low Mach/high friction limit.

Remark 3.4.

There exists also other approaches to discretize the coupling conditions. Here, we mention the possibility to do so fully implicit in time [57], using a finite–element based approaches [25], linearization approaches  [5, 11], or central scheme type discretizations [40]. As the previous Lemma shows the treatment using half-Riemann problems is, however, sufficient to guarantee here the asymptotic preserving property of the scheme. We therefore do not investigate those alternative approaches.

3.5.2 Additional Boundary Condition Requirements

In addition to defining the ghost cell values for ρ\rho and ρu\rho u at the single point where the pipes meet, the algorithm described in §3.1–§3.3 requires defined values for (i) the reconstructed values on both sides of the cell interfaces x12(k)x_{\frac{1}{2}}^{(k)} and xN+12(k)x_{N+\frac{1}{2}}^{(k)}; and (ii) the central difference derivative of numerical fluxes near pipeline boundaries.

The requirement for reconstructed values at the domain boundaries x12(k)x_{\frac{1}{2}}^{(k)} and xN+12(k)x_{N+\frac{1}{2}}^{(k)} of each pipeline is standard and are directly needed within the numerical flux evaluations; see (3.13). These evaluations are trivial at the inlets and outlets of the pipe network, as they typically involve Dirichlet or Neumann boundary conditions. Again the difficulty lies at the junctions of the network. Since we do not have enough information to form a piecewise-linear reconstruction (via equation (3.14)) of the ghost cells sitting at the junctions, we instead opt for the first-order reconstruction; that is, at pipe intersections, we take

(𝑼N+12±)(k)=𝑼and(𝑼12±)(k)=𝑼,(\bm{U}^{\pm}_{N+\frac{1}{2}})^{(k)}=\bm{U}^{*}\qquad\textrm{and}\qquad(\bm{U}^{\pm}_{\frac{1}{2}})^{(k)}=\bm{U}^{*},

for ingoing and outgoing pipelines, respectively. Here, 𝑼\bm{U}^{*} denotes the solution to nonlinear system (3.24).

The other boundary condition issue lies in the central difference within the fully discrete method to calculate  ρjn+1\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}. As seen in (3.16), we require a central difference of jρu,n{\mathcal{R}}_{j}^{\rho u,n}, which by (3.12) implies the need to evaluate the unknowns 𝓕~12n\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{-\frac{1}{2}} and 𝓕~N+32n\widetilde{{\bm{{\mathcal{F}}}}}^{n}_{N+\frac{3}{2}} for each pipe. This would require even more ghost cell evaluations than the reconstructions on the boundaries. Thus, we instead assume a zero-extrapolation of jρu,n{\mathcal{R}}_{j}^{\rho u,n} for cells C0C_{0} and CN+1C_{N+1} and use the extrapolated values in the central difference seen in (3.16); that is, we use

Dx[1ρu,nΨ1n]=1Δx[2ρu,nΨ2n1ρu,nΨ0n]andDx[Nρu,nΨNn]=1Δx[Nρu,nΨN+1nN1ρu,nΨN1n].D_{x}{\left[\frac{{\mathcal{R}}_{1}^{\rho u,n}}{\Psi_{1}^{n}}\right]}=\frac{1}{{\Delta x}}{\left[\frac{{\mathcal{R}}_{2}^{\rho u,n}}{\Psi_{2}^{n}}-\frac{{\mathcal{R}}_{1}^{\rho u,n}}{\Psi_{0}^{n}}\right]}\qquad\textrm{and}\qquad D_{x}{\left[\frac{{\mathcal{R}}_{N}^{\rho u,n}}{\Psi_{N}^{n}}\right]}=\frac{1}{{\Delta x}}{\left[\frac{{\mathcal{R}}_{N}^{\rho u,n}}{\Psi_{N+1}^{n}}-\frac{{\mathcal{R}}_{N-1}^{\rho u,n}}{\Psi_{N-1}^{n}}\right]}.

Both this and the first-order reconstructions at pipe intersections imply a first-order method at the junctions, and thus everywhere in the domain. In the near future, we intend to expand upon this, the first-order time discretization, and the piecewise-constant initial data within the half-Riemann problem (3.23) to enhance the proposed scheme to be fully second-order accurate.

3.6 The Discrete Low Mach/High Friction Limit

In this section, we show that in the limit as ε0\varepsilon\rightarrow 0, the method converges to the asymptotic state in (2.8). Consider the following asymptotic expansions for the discretization of ρ\rho, uu and pp, which follow from §2.2:

 ρjn\displaystyle\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n} = ρj(0),n+ε2 ρj(2),n+,\displaystyle=\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0),n}_{j}+\varepsilon^{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(2),n}_{j}+\cdots, (3.28)
ujn\displaystyle u_{j}^{n} =uj(0),n+ε2uj(2),n+,\displaystyle=u^{(0),n}_{j}+\varepsilon^{2}u^{(2),n}_{j}+\cdots,
p( ρjn)\displaystyle p(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n}) =(ρj(0),n)γ+ε2γ(ρj(0),n)γ1ρj(2),n+,\displaystyle={\left(\rho^{(0),n}_{j}\right)}^{\gamma}+\varepsilon^{2}\gamma{\left(\rho^{(0),n}_{j}\right)}^{\gamma-1}\rho^{(2),n}_{j}+\cdots,

and analogously at time tn+1t^{n+1}. We want to show that as the proposed method advances in time, it keeps the asymptotic state up to the predicted order of accuracy. To this end, we wish to find a bound on the asymptotic expansion for the time-advanced solution

( ρj(0),n+1)γ+Cδκ2 ρj(0)n+1uj(0),n+1.{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{(0),n+1}\right)}^{\gamma}+\frac{C_{\delta}\kappa}{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0)n+1}_{j}u^{(0),n+1}_{j}.

Since the pressure to friction balance in the asymptotic state arises from the momentum equation in (2.1), we start with a slightly manipulated form of the discrete approximation for ( ρu)jn+1{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j} in (3.17):

ε2Δt(( ρu)jn+Δtjρu,nanΔtε2Dx ρjn+1Ψjn( ρu)jn+1)=0.\frac{\varepsilon^{2}}{{\Delta t}}{\left({\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n}_{j}+{\Delta t}{\mathcal{R}}^{\rho u,n}_{j}-\frac{a^{n}{\Delta t}}{\varepsilon^{2}}D_{x}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}-\Psi^{n}_{j}{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}\right)}=0.

Note that the left hand side is effectively the local truncation error multiplied by the 𝒪(1){\mathcal{O}}(1) term ε2Ψjn\varepsilon^{2}\Psi^{n}_{j}. Here, we first substitute in for jρu,n{\mathcal{R}}^{\rho u,n}_{j} using equation (3.22), resulting in the form

ε2Δt(( ρu)jnΔtDxF~ρu(𝑼jn)anΔtε2Dx ρjn+1Ψjn( ρu)jn+1)=ε2ΔtC1ΔtΔx2ε2,\frac{\varepsilon^{2}}{{\Delta t}}{\left({\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n}_{j}-{\Delta t}D_{x}\widetilde{F}^{\rho u}(\bm{U}_{j}^{n})-\frac{a^{n}{\Delta t}}{\varepsilon^{2}}D_{x}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}-\Psi^{n}_{j}{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}\right)}=\frac{\varepsilon^{2}}{{\Delta t}}\cdot C_{1}\frac{{\Delta t}{\Delta x}^{2}}{\varepsilon^{2}},

where C1C_{1} comes from the leading order of diffusion 𝒟j+12ρu,n{\mathcal{D}}_{j+\frac{1}{2}}^{\rho u,n} that appears within the 𝒪(ε2Δx2){\mathcal{O}}(\varepsilon^{-2}{\Delta x}^{2}) term of (3.22). Substituting in F~ρu(𝑼jn)\widetilde{F}^{\rho u}(\bm{U}_{j}^{n}) from (3.3) and Ψjn\Psi_{j}^{n} from (3.10), we obtain

ε2[( ρu)jn( ρu)jn+1ΔtDx(ρu2)jn]Dx(p( ρjn)an ρjn)anDx ρjn+1Cδκ2( ρu)jn+1=C1Δx2.\varepsilon^{2}{\left[\frac{{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n}_{j}-{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}}{{\Delta t}}-D_{x}{\left(\rho u^{2}\right)}_{j}^{n}\right]}-D_{x}{\left(p(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n})-a^{n}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{n}\right)}-a^{n}D_{x}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{n+1}_{j}-\frac{C_{\delta}\kappa}{2}{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho u$\kern 0.0pt}}}\right)}^{n+1}_{j}=C_{1}{\Delta x}^{2}.

We then apply the asymptotic expansions from (3.28) and take ε0\varepsilon\rightarrow 0, resulting in

Dx[( ρj(0),n)γ]+Cδκ2 ρj(0)n+1uj(0),n+1=anDx( ρj(0),n ρj(0),n+1)C1Δx2.D_{x}{\left[{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{(0),n}\right)}^{\gamma}\right]}+\frac{C_{\delta}\kappa}{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0)n+1}_{j}u^{(0),n+1}_{j}=a^{n}D_{x}{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0),n}_{j}-\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0),n+1}_{j}\right)}-C_{1}{\Delta x}^{2}.

Since DxD_{x} represents the second-order central difference operator, then we equivalently have

[( ρj(0),n)γ]x+Cδκ2 ρj(0)n+1uj(0),n+1=an( ρj(0),n ρj(0),n+1)x+(C2C1)Δx2,{\left[{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{(0),n}\right)}^{\gamma}\right]}_{x}+\frac{C_{\delta}\kappa}{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0)n+1}_{j}u^{(0),n+1}_{j}=a^{n}{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0),n}_{j}-\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0),n+1}_{j}\right)}_{x}+(C_{2}-C_{1}){\Delta x}^{2},

where C2C_{2} represents the the leading error coefficient from using central difference. Lastly, applying Taylor series to the terms at time tnt^{n} about time tn+1t^{n+1}, we obtain

[( ρj(0),n+1)γ]x+Cδκ2 ρj(0)n+1uj(0),n+1=C3Δt+(C2C1)Δx2.{\left[{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{(0),n+1}\right)}^{\gamma}\right]}_{x}+\frac{C_{\delta}\kappa}{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0)n+1}_{j}u^{(0),n+1}_{j}=C_{3}{\Delta t}+(C_{2}-C_{1}){\Delta x}^{2}.

Here, C3C_{3} denotes the leading error term from the Taylor series. Therefore, we can bound the asymptotic expansion at time tn+1t^{n+1}:

[(  ρ j(0),n+1)γ]x+Cδκ2 ρj(0)n+1uj(0),n+1C(Δt+Δx2),{\left\|{\left[{\left(\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}_{j}^{(0),n+1}\right)}^{\gamma}\right]}_{x}+\frac{C_{\delta}\kappa}{2}\hbox{\vbox{\hrule height=0.5pt\kern 1.72218pt\hbox{\kern-0.50003pt$\rho$\kern 0.0pt}}}^{(0)n+1}_{j}u^{(0),n+1}_{j}\right\|}\leq C({\Delta t}+{\Delta x}^{2}),

with C=max{C3,C2C1}C=\max{\left\{C_{3},C_{2}-C_{1}\right\}}, hence implying that the proposed method preserves the asymptotic state up to the order of the scheme.

The limiting scheme is accompanied by the (limiting) coupling conditions (3.24) at the boundary implemented again using ghost cells. Note again that by the discussion made in §3.5.2, the pipe entries and exits occurring at intersections would have a bound that is instead first-order in both space and time.

4 Numerical Results

In this section, we demonstrate the accuracy and performance of the proposed AP scheme on pipe networks in several numerical experiments conducted on the isentropic Euler equations in (2.1). For all examples, we use an adiabatic index value of γ=5/3\gamma=5/3, follow the CFL condition in (3.18) and take the CFL number ν=0.45\nu=0.45, in the source term of (2.1) choose Cδ=1C_{\delta}=1 and κ=103\kappa=10^{-3}, take the minmod parameter θ=1.3\theta=1.3, and set the tolerance for the Newton solve at the junctions to be 10810^{-8}.

In this paper, we will only conduct verifications on the two types of T-junctions – the so-called 1-to-2 T-junction, which has one pipe entering and two pipes leaving the junction, and the so-called 2-to-1 T-junction, which has two pipes entering and one pipe leaving the junction. Illustrations of these are presented in Figure 2. While we only consider the example T-junction networks with all pipes having the same length, the method is of course not restricted to this and can be extended to large and more complex pipe networks.

Figure 2: Illustrations of the 1-to-2 T-junction (left), and 2-to-1 T-junction (right).

Example 1 – Convergence Tests

In the first example, we consider a problem with a smooth density and velocity profile to confirm the convergence rate of the proposed AP method. We consider both the 1-to-2 and 2-to-1 T-junction setups. For ingoing pipelines, we take the initial conditions

u(x,0)=0,ρ(x,0)={1.1x0.4ε1+0.1sin(πε0.8x)0.4ε<x<0.8ε,1x>0.8ε,u(x,0)=0,\qquad\rho(x,0)=\left\{\begin{aligned} &1.1&&x\leq\frac{0.4}{\varepsilon}\\ &1+0.1\sin{\left(\frac{\pi\varepsilon}{0.8}x\right)}&&\frac{0.4}{\varepsilon}<x<\frac{0.8}{\varepsilon},\\ &1&&x>\frac{0.8}{\varepsilon},\end{aligned}\right.

and for outgoing pipes we take the initial conditions ρ(x,0)=1\rho(x,0)=1, u(x,0)=0u(x,0)=0. We will take each pipe to have a length of ε1\varepsilon^{-1}, as we are more interested in the investigating behavior near the junction than the inlet/outlet boundaries. These pipe lengths allow for the smooth profile to pass through the junction before the final time of t=0.2t=0.2, but the smooth profile will not reach the inlets/outlets by final time. At the inlets, we take a Dirichlet boundary condition of ρ=1.1\rho=1.1, and at the outlets we take Neumann boundary conditions.

Since the exact solution is unknown, we obtain the experimental L1L^{1} convergence rates by computing the solution on a number of different meshes, then use the Runge formula

RateΔx(ρ)=log2(ρ(x,1)Δxρ(x,1)2Δx1ρ(x,1)Δx/2ρ(x,1)Δx1),{\rm Rate}_{\Delta x}(\rho)=\log_{2}{\left(\frac{\|\rho(x,1)_{{\Delta x}}-\rho(x,1)_{2{\Delta x}}\|_{1}}{\|\rho(x,1)_{{\Delta x}/2}-\rho(x,1)_{\Delta x}\|_{1}}\right)},

where ρΔx\rho_{\Delta x} denotes the density solution computed on a uniform mesh with all cells having width Δx{\Delta x}. The convergence rates for uu can be computed analogously. We present the L1L^{1} errors and rates for ρ\rho and uu for the 1-to-2 junction in Table 1 and for the 2-to-1 junction in Table 2, both of which confirm the expected first order of accuracy when the fluid passes through the junction.

Δx{\Delta x} ρ(x,1)Δx/2ρ(x,1)Δx1\|\rho(x,1)_{{\Delta x}/2}-\rho(x,1)_{\Delta x}\|_{1} Rate(ρ)Δx{}_{\Delta x}(\rho) u(x,1)Δx/2u(x,1)Δx1\|u(x,1)_{{\Delta x}/2}-u(x,1)_{\Delta x}\|_{1} Rate(u)Δx{}_{\Delta x}(u)
ε=0.1\varepsilon=0.1 1/10 1.43e-02 1.39e-01
1/20 7.72e-03 0.89 7.57e-02 0.88
1/40 3.89e-03 0.99 3.93e-02 0.94
1/80 1.97e-03 0.98 2.05e-02 0.94
1/160 9.85e-04 1.00 1.05e-02 0.96
ε=0.01\varepsilon=0.01 1/10 8.59e-02 1.20e+01
1/20 3.08e-02 1.48 3.43e+00 1.81
1/40 9.53e-03 1.69 1.08e+00 1.67
1/80 2.82e-03 1.76 3.08e-01 1.80
1/160 9.65e-04 1.55 9.94e-02 1.63
ε=0.001\varepsilon=0.001 1/10 2.89e-02 8.21e+00
1/20 9.10e-03 1.67 1.38e+00 2.58
1/40 3.06e-03 1.57 5.28e-01 1.38
1/80 1.01e-03 1.60 2.22e-01 1.25
1/160 3.64e-04 1.47 1.04e-01 1.09
Table 1: Example 1 (1-to-2 T-junction): L1L^{1} errors and corresponding experimental convergence rates.
Δx{\Delta x} ρ(x,1)Δx/2ρ(x,1)Δx1\|\rho(x,1)_{{\Delta x}/2}-\rho(x,1)_{\Delta x}\|_{1} Rate(ρ)Δx{}_{\Delta x}(\rho) u(x,1)Δx/2u(x,1)Δx1\|u(x,1)_{{\Delta x}/2}-u(x,1)_{\Delta x}\|_{1} Rate(u)Δx{}_{\Delta x}(u)
ε=0.1\varepsilon=0.1 1/10 1.49e-02 1.41e-01
1/20 6.98e-03 1.10 8.33e-02 0.76
1/40 3.35e-03 1.06 4.42e-02 0.91
1/80 1.67e-03 1.01 2.27e-02 0.96
1/160 8.42e-04 0.99 1.14e-02 0.99
ε=0.01\varepsilon=0.01 1/10 9.23e-02 1.19e+01
1/20 3.84e-02 1.26 3.01e+00 1.98
1/40 1.19e-02 1.69 9.56e-01 1.66
1/80 2.99e-03 1.99 3.12e-01 1.61
1/160 9.44e-04 1.66 1.21e-01 1.37
ε=0.001\varepsilon=0.001 1/10 2.93e-02 8.16e+00
1/20 9.33e-03 1.65 1.35e+00 2.60
1/40 3.18e-03 1.55 5.12e-01 1.40
1/80 1.07e-03 1.57 2.11e-01 1.27
1/160 4.02e-04 1.42 9.78e-02 1.11
Table 2: Example 1 (2-to-1 T-junction): L1L^{1} errors and corresponding experimental convergence rates.

Example 2 – Inlet Discontinuity

For the second example, we look at the evolution of an initial jump discontinuity that starts at the inlets, resulting in a wave that travels through the junction. For all pipelines, we consider the initial conditions

ρ(x,0)=1,u(x,0)=0,\rho(x,0)=1,\qquad u(x,0)=0,

with each pipe having a length of 100. At the inlets, we take a Dirichlet boundary condition of ρ=1.3\rho=1.3, and prescribe Neumann boundary conditions at the outlets. We look at this initial set up for both the 1-to-2 and 2-to-1 T-junction networks.

We use the proposed AP scheme to compute the solution for ε\varepsilon values of 0.10.1, 0.010.01, and 0.0010.001 to the final times of t=10t=10, t=1t=1, and t=0.1t=0.1, respectively, to capture the behavior of the discontinuity through the junction. The resulting solutions for ρ\rho and uu when taking a spatial mesh of 4000 cells in each pipeline are presented in Figure 3 for the 1-to-2 T-junction and in Figure 4 for the 2-to-1 T-junction. In these figures, the influence of the friction source term is very clear, as it appears as if the flow did not yet reach the junction in the ε=0.001\varepsilon=0.001 results. This is however not the case and is only a result of the strong friction; see Figure 5 where we plot the outgoing pipeline results for ε=0.001\varepsilon=0.001 at t=0.1t=0.1. In addition, we see that in the cases that produce discontinuities in the solution, there are no spurious oscillations present.

Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 3: Example 2 (1-to-2 T-junction): Solutions for ρ\rho (left column) and uu (right column) for ε=0.1\varepsilon=0.1 at t=10t=10 (top row), ε=0.01\varepsilon=0.01 at t=1t=1 (middle row), and ε=0.001\varepsilon=0.001 at t=0.1t=0.1 (bottom row).
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 4: Example 2 (2-to-1 T-junction): Solutions for ρ\rho (left column) and uu (right column) for ε=0.1\varepsilon=0.1 at t=10t=10 (top row), ε=0.01\varepsilon=0.01 at t=1t=1 (middle row), and ε=0.001\varepsilon=0.001 at t=0.1t=0.1 (bottom row).
Refer to caption
Refer to caption
Figure 5: Example 2: Results for ρ\rho (left) and uu (right) of the outgoing pipeline(s) for the 1-to-2 T-junction (blue) and the 2-to-1 T-junction (red dotted).

Example 3 – Comparison with the CU Explicit Scheme

In this example, we test the importance of the ε\varepsilon-independent time-step restriction and compare the proposed AP scheme against the CU finite volume discretization with a forward Euler time-step. The forward Euler time-step was selected so that the explicit scheme matches the first-order in time, second-order in space accuracy of the proposed AP scheme.

We consider the 1-to-2 T-junction with the same initial and boundary conditions as that of Example 2, and run both the proposed AP scheme and the related explicit scheme to a final time t=10t=10 for the ε\varepsilon values of 0.1, 0.01, and 0.001 on various spatial discretizations. We present the run times of both schemes in Table 3. In the run times, we see that for ε=0.1\varepsilon=0.1, the run times for the two methods are on the same order of magnitude. However, the difference becomes drastic as ε0\varepsilon\rightarrow 0. It is clear in Table 3 that the AP scheme keeps all run times roughly the same for varying ε\varepsilon. Conversely, the explicit scheme has the expected ε\varepsilon-dependence within the experimental run times – which, for ε=0.001\varepsilon=0.001, results in simulations that are a daunting 140×\times slower than that of the AP scheme.

Δx{\Delta x} AP Scheme Run Time Explicit Scheme Run Time
ε=0.1\varepsilon=0.1 1/20 2.44 s 4.05 s
1/40 9.14 s 16.1 s
1/80 37.4 s 65.5 s
ε=0.01\varepsilon=0.01 1/20 2.89 s 46.8 s
1/40 11.0 s 192 s
1/80 44.0 s 782 s
ε=0.001\varepsilon=0.001 1/20 2.91 s 406 s
1/40 11.0 s 1610 s
1/80 43.7 s 6450 s
Table 3: Example 3: Run time comparisons of the proposed AP scheme and CU discretization with forward Euler time-stepping for various ε\varepsilon and mesh sizes.

5 Conclusion

In this study, we developed a novel asymptotic-preserving method for the isentropic Euler equations with a friction source on pipe networks. To address the difficulties and stiffness of the system in low Mach or high friction regimes, we split the flux into pieces that represent the slow and fast dynamics. This allows for an explicit time-step on the non-stiff (slow) dynamics portion, and, by using a method based on Rosenbrock-type Runge Kutta schemes, allows for an implicit time-step for the stiff (fast) dynamics that does not require a nonlinear solver. In turn, we were able to confirm both experimentally and theoretically that the proposed scheme is AP in the sense that it provides a consistent and stable solution in the the low Mach and high friction regimes. Most importantly, the CFL stability restriction is only dependent on mesh size, rather than requiring dependence on both the mesh and the small limiting parameter ε\varepsilon within the system. This method within each pipeline is then extended to entire pipe networks, in which coupling conditions must be used at pipe-to-pipe intersections to ensure a mathematically well-posed problem. We show that, even in the limiting regime, the coupling conditions remain well-posed. These coupling conditions are used to set the ghost cell values on each pipeline, thus allowing a seamless coupling of the AP method across pipe junctions within the network.

Since the AP method is combined with a friction source term and pipe junctions, both the asymptotic state in the low Mach/high friction regime and the boundary conditions are non-trivial. Because of this, in addition to a first-order approximation in time, the scheme is currently limited to first-order. The second-order extension to the proposed method is, to our knowledge, non-trivial, as it would require, e.g., one-sided reconstructions, adjustments to the half-Riemann problems, and approximating fluxes in the ghost cells. In future work, these difficulties are something we plan to address in hopes of making a fully second-order AP scheme for isentropic flow in pipe networks.

Acknowledgments

The authors thank the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) for the financial support through 463312734/FOR5409, 320021702/GRK2326, and within SPP 2410 Hyperbolic Balance Laws in Fluid Mechanics: Complexity, Scales, Randomness (CoScaRa) within the Project(s) HE5386/26-1 (Numerische Verfahren für gekoppelte Mehrskalenprobleme, 525842915) and (Zufällige kompressible Euler Gleichungen: Numerik und ihre Analysis, 525853336) HE5386/27-1. Support received funding from the European Union’s Horizon Europe research and innovation programme under the Marie Sklodowska-Curie Doctoral Network Datahyking (Grant No. 101072546) is acknowledged.

References

  • [1] A. Ambroso, C. Chalons, F. Coquel, E. Godlewski, F. Lagoutière, P.-A. Raviart, and N. Seguin, Coupling of general Lagrangian systems, Math. Comp., 77 (2008), pp. 909–941.
  • [2] K. R. Arun and S. Samantaray, Asymptotic preserving low Mach number accurate IMEX finite volume schemes for the isentropic Euler equations, J. Sci. Comput., 82 (2020), pp. Art. 35, 32.
  • [3]  , An asymptotic preserving time integrator for low Mach number limits of the Euler equations with gravity, in Hyperbolic problems: theory, numerics, applications, vol. 10 of AIMS Ser. Appl. Math., Am. Inst. Math. Sci. (AIMS), Springfield, MO, [2020] ©2020, pp. 279–286.
  • [4] S. Avgerinos, F. Bernard, A. Iollo, and G. Russo, Linearly implicit all Mach number shock capturing schemes for the Euler equations, J. Comput. Phys., 393 (2019), pp. 278–312.
  • [5] M. K. Banda, A.-S. Häck, and M. Herty, Numerical discretization of coupling conditions by high-order schemes, J. Sci. Comput., 69 (2016), pp. 122–145.
  • [6] M. K. Banda, M. Herty, and A. Klar, Coupling conditions for gas networks governed by the isothermal Euler equations, Netw. Heterog. Media, 1 (2006), pp. 295–314.
  • [7]  , Gas flow in pipeline networks, Netw. Heterog. Media, 1 (2006), pp. 41–56.
  • [8] G. Bispen, K. R. Arun, M. Lukáčová-Medvid’ová, and S. Noelle, IMEX large time step finite volume methods for low Froude number shallow water flows, Commun. Comput. Phys., 16 (2014), pp. 307–347.
  • [9] G. Bispen, M. Lukáčová-Medvid’ová, and L. Yelash, Asymptotic preserving IMEX finite volume schemes for low Mach number Euler equations with gravitation, J. Comput. Phys., 335 (2017), pp. 222–248.
  • [10] R. Borsche, Numerical schemes for networks of hyperbolic conservation laws, Appl. Numer. Math., 108 (2016), pp. 157–170.
  • [11] R. Borsche and J. Kall, ADER schemes and high order coupling on networks of hyperbolic conservation laws, J. Comput. Phys., 273 (2014), pp. 658–670.
  • [12] S. Boscarino, J.-M. Qiu, G. Russo, and T. Xiong, A high order semi-implicit IMEX WENO scheme for the all-Mach isentropic Euler system, J. Comput. Phys., 392 (2019), pp. 594–618.
  • [13] W. Boscheri, M. Tavelli, and C. E. Castro, An all Froude high order IMEX scheme for the shallow water equations on unstructured Voronoi meshes, Appl. Numer. Math., 185 (2023), pp. 311–335.
  • [14] A. Bressan, S. Čanić, M. Garavello, M. Herty, and B. Piccoli, Flows on networks: Recent results and perspectives, EMS Surv. Math. Sci., 1 (2014), pp. 47–111.
  • [15] G. Bretti, R. Natalini, and B. Piccoli, Fast algorithms for the approximation of a traffic flow model on networks, Discrete Contin. Dyn. Syst. Ser. B, 6 (2006), pp. 427–448.
  • [16] J. Brouwer, I. Gasser, and M. Herty, Gas pipeline models revisited: model hierarchies, nonisothermal models, and simulations of networks, Multiscale Model. Simul., 9 (2011), pp. 601–623.
  • [17] S. Busto and M. Dumbser, A staggered semi-implicit hybrid finite volume / finite element scheme for the shallow water equations at all Froude numbers, Appl. Numer. Math., 175 (2022), pp. 108–132.
  • [18] C. Chalons, P.-A. Raviart, and N. Seguin, The interface coupling of the gas dynamics equations, Quart. Appl. Math., 66 (2008), pp. 659–705.
  • [19] R. M. Colombo and M. Garavello, A well posed Riemann problem for the pp-system at a junction, Netw. Heterog. Media, 1 (2006), pp. 495–511.
  • [20] F. Cordier, P. Degond, and A. Kumbaro, An asymptotic-preserving all-speed scheme for the Euler and Navier-Stokes equations, J. Comput. Phys., 231 (2012), pp. 5685–5704.
  • [21] P. Degond and M. Tang, All speed scheme for the low Mach number limit of the isentropic Euler equations, Commun. Comput. Phys., 10 (2011), pp. 1–31.
  • [22] G. Dimarco, R. Loubère, and M.-H. Vignal, Study of a new asymptotic preserving scheme for the Euler system in the low Mach number limit, SIAM J. Sci. Comput., 39 (2017), pp. A2099–A2128.
  • [23] F. Dubois and P. LeFloch, Boundary conditions for nonlinear hyperbolic systems of conservation laws, J. Differential Equations, 71 (1988), pp. 93–122.
  • [24] A. Duran, F. Marche, R. Turpault, and C. Berthon, Asymptotic preserving scheme for the shallow water equations with source terms on unstructured meshes, J. Comput. Phys., 287 (2015), pp. 184–206.
  • [25] H. Egger, A robust conservative mixed finite element method for isentropic compressible flow on pipe networks, SIAM J. Sci. Comput., 40 (2018), pp. A108–A129.
  • [26] H. Egger and J. Giesselmann, Stability and asymptotic analysis for instationary gas transport via relative energy estimates, Numer. Math., 153 (2023), pp. 701–728.
  • [27] H. Egger, J. Giesselmann, T. Kunkel, and N. Philippi, An asymptotic-preserving discretization scheme for gas transport in pipe networks, IMA J. Numer. Anal., 43 (2023), pp. 2137–2168.
  • [28] H. Egger and N. Philippi, An asymptotic preserving hybrid-dG method for convection-diffusion equations on pipe networks, arXiv preprint arXiv:2209.04238, (2022).
  • [29] K. Ehrhardt and M. C. Steinbach, Nonlinear optimization in gas networks, in Modeling, Simulation and Optimization of Complex Processes, H. G. Bock, H. X. Phu, E. Kostina, and R. Rannacher, eds., Springer Berlin Heidelberg, 2005, pp. 139–148.
  • [30] F. Fei, A time-relaxed Monte Carlo method preserving the Navier-Stokes asymptotics, J. Comput. Phys., 486 (2023), p. 112128.
  • [31] F. Fei, A Navier-Stokes asymptotic preserving Direct Simulation Monte Carlo method for multi-species gas flows, arXiv preprint arXiv:2410.20322, (2024).
  • [32] M. Garavello, K. Han, and B. Piccoli, Models for vehicular traffic on networks, vol. 9 of AIMS Ser. Appl. Math., Am. Inst. Math. Sci. (AIMS), Springfield, MO, 2016.
  • [33] E. Godlewski and P.-A. Raviart, The numerical interface coupling of nonlinear hyperbolic systems of conservation laws: I. The scalar case, Numer. Math., 97 (2004), pp. 81–130.
  • [34] E. Godlewski and P. A. Raviart, A method of coupling non-linear hyperbolic systems: examples in CFD and plasma physics, Internat. J. Numer. Methods Fluids, 47 (2005), pp. 1035–1041. 8th ICFD Conference on Numerical Methods for Fluid Dynamics. Part 2.
  • [35] H. Guillard and A. Murrone, On the behavior of upwind schemes in the low Mach number limit: II. Godunov type schemes, Comput. Fluids, 33 (2004), pp. 655–675.
  • [36] H. Guillard and C. Viozat, On the behaviour of upwind schemes in the low Mach number limit, Comput. Fluids, 28 (1999), pp. 63–86.
  • [37] J. Haack, S. Jin, and J.-G. Liu, An all-speed asymptotic-preserving method for the isentropic Euler and Navier-Stokes equations, Commun. Comput. Phys., 12 (2012), pp. 955–980.
  • [38] A. Harten, P. D. Lax, and B. van Leer, On upstream differencing and Godunov-type schemes for hyperbolic conservation laws, SIAM Rev., 25 (1983), pp. 35–61.
  • [39] M. Herty, N. Izem, and M. Seaid, Fast and accurate simulations of shallow water equations in large networks, Comput. Math. Appl., 78 (2019), pp. 2107–2126.
  • [40] M. Herty, N. Kolbe, and S. Müller, Central schemes for networked scalar conservation laws, Netw. Heterog. Media, 18 (2023), pp. 310–340.
  • [41] M. Herty and M. Rascle, Coupling conditions for a class of second-order models for traffic flow, SIAM J. Math. Anal., 38 (2006), pp. 595–616.
  • [42] M. Herty and M. Seaïd, Simulation of transient gas flow at pipe-to-pipe intersections, Internat. J. Numer. Methods Fluids, 56 (2008), pp. 485–506.
  • [43]  , Assessment of coupling conditions in water way intersections, Internat. J. Numer. Methods Fluids, 71 (2013), pp. 1438–1460.
  • [44] H. Holden and N. H. Risebro, A mathematical model of traffic flow on a network of unidirectional roads, SIAM J. Math. Anal., 26 (1995), pp. 999–1017.
  • [45] J. Hu, S. Jin, and Q. Li, Chapter 5 - asymptotic-preserving schemes for multiscale hyperbolic and kinetic equations, in Handbook of Numerical Methods for Hyperbolic Problems, R. Abgrall and C.-W. Shu, eds., vol. 18 of Handbook of Numerical Analysis, Elsevier, 2017, pp. 103–129.
  • [46] J. Hu, R. Shu, and X. Zhang, Asymptotic-preserving and positivity-preserving implicit-explicit schemes for the stiff BGK equation, SIAM J. Numer. Anal., 56 (2018), pp. 942–973.
  • [47] G. Huang, Y. Xing, and T. Xiong, High order well-balanced asymptotic preserving finite difference WENO schemes for the shallow water equations in all Froude numbers, J. Comput. Phys., 463 (2022), p. 111255.
  • [48] S. Jin, Runge-Kutta methods for hyperbolic conservation laws with stiff relaxation terms, J. Comput. Phys., 122 (1995), pp. 51–67.
  • [49]  , Efficient asymptotic-preserving (AP) schemes for some multiscale kinetic equations, SIAM J. Sci. Comput., 21 (1999), pp. 441–454.
  • [50]  , Asymptotic preserving (AP) schemes for multiscale kinetic and hyperbolic equations: a review, Riv. Math. Univ. Parma (N.S.), 3 (2012), pp. 177–216.
  • [51]  , Asymptotic-preserving schemes for multiscale physical problems, Acta Numer., 31 (2022), pp. 415–489.
  • [52] S. Jin, Z. Ma, and K. Wu, Asymptotic-preserving neural networks for multiscale time-dependent linear transport equations, Journal of Scientific Computing, 94 (2023), p. 57.
  • [53]  , Asymptotic-preserving neural networks for multiscale kinetic equations, Commun. Comput. Phys., 35 (2024), pp. 693–723.
  • [54] S. Jin, L. Pareschi, and G. Toscani, Uniformly accurate diffusive relaxation schemes for multiscale transport equations, SIAM J. Numer. Anal., 38 (2000), pp. 913–936.
  • [55] F. Kanbar, C. Klingenberg, and M. Tang, An asymptotic preserving and uniform well-balanced scheme for the isentropic Euler equations with gravitational source term, (2024).
  • [56] R. Klein, Semi-implicit extension of a Godunov-type scheme based on low Mach number asymptotics I: One-dimensional flow, J. Comput. Phys., 121 (1995), pp. 213–237.
  • [57] O. Kolb, J. Lang, and P. Bales, An implicit box scheme for subsonic compressible flow with dissipative source term, Numer. Algorithms, 53 (2010), pp. 293–307.
  • [58] V. Kučera, M. Lukáčová-Medvid’ová, S. Noelle, and J. Schütz, Asymptotic properties of a class of linearly implicit schemes for weakly compressible Euler equations, Numer. Math., 150 (2022), pp. 79–103.
  • [59] A. Kurganov, Y. Liu, and M. Lukáčová-Medviďová, A well-balanced asymptotic preserving scheme for the two-dimensional rotating shallow water equations with nonflat bottom topography, SIAM J. Sci. Comput., 44 (2022), pp. A1655–A1680.
  • [60] A. Kurganov, S. Noelle, and G. Petrova, Semidiscrete central-upwind schemes for hyperbolic conservation laws and Hamilton-Jacobi equations, SIAM J. Sci. Comput., 23 (2001), pp. 707–740.
  • [61] A. Kurganov and E. Tadmor, Solution of two-dimensional Riemann problems for gas dynamics without Riemann problem solvers, Numer. Methods Partial Differential Equations, 18 (2002), pp. 584–608.
  • [62] K.-A. Lie and S. Noelle, On the artificial compression method for second-order nonoscillatory central difference schemes for systems of conservation laws, SIAM J. Sci. Comput., 24 (2003), pp. 1157–1174.
  • [63] X. Liu, A. Chertock, and A. Kurganov, An asymptotic preserving scheme for the two-dimensional shallow water equations with Coriolis forces, J. Comput. Phys., 391 (2019), pp. 259–279.
  • [64] L. O. Müller and P. J. Blanco, A high order approximation of hyperbolic conservation laws in networks: application to one-dimensional blood flow, J. Comput. Phys., 300 (2015), pp. 423–437.
  • [65] H. Nessyahu and E. Tadmor, Nonoscillatory central differencing for hyperbolic conservation laws, J. Comput. Phys., 87 (1990), pp. 408–463.
  • [66] S. Noelle, G. Bispen, K. R. Arun, M. Lukáčová-Medviďová, and C.-D. Munz, A weakly asymptotic preserving low Mach number scheme for the Euler equations of gas dynamics, SIAM J. Sci. Comput., 36 (2014), pp. B989–B1024.
  • [67] A. Osiadacz, Simulation and analysis of gas networks, (1987).
  • [68] W. Ren, H. Liu, and S. Jin, An asymptotic-preserving Monte Carlo method for the Boltzmann equation, J. Comput. Phys., 276 (2014), pp. 380–404.
  • [69] F. Rieper, On the dissipation mechanism of upwind-schemes in the low Mach number regime: A comparison between roe and hll, J. Comput. Phys., 229 (2010), pp. 221–232.
  • [70] S. Samantaray, Asymptotic preserving linearly implicit additive IMEX-RK finite volume schemes for low Mach number isentropic Euler equations, arXiv preprint arXiv:2409.05854, (2024).
  • [71] P. K. Sweby, High resolution schemes using flux limiters for hyperbolic conservation laws, SIAM J. Numer. Anal., 21 (1984), pp. 995–1011.
  • [72] S. Vater and R. Klein, A semi-implicit multiscale scheme for shallow water flows at low Froude number, Commun. Appl. Math. Comput. Sci., 13 (2018), pp. 303–336.
  • [73] G. Wanner and E. Hairer, Solving ordinary differential equations II, vol. 375, Springer Berlin Heidelberg New York, 1996.
  • [74] F. M. White and H. Xue, Fluid mechanics, vol. 3, McGraw-hill New York, 2003.
  • [75] X. Xie, H. Dong, and M. Li, High order well-balanced asymptotic preserving IMEX RKDG schemes for the two-dimensional nonlinear shallow water equations, J. Comput. Phys., 510 (2024), p. 113092.
  • [76] H. Zakerzadeh, The RS-IMEX scheme for the rotating shallow water equations with the Coriolis force, in Finite volumes for complex applications VIII—hyperbolic, elliptic and parabolic problems, vol. 200 of Springer Proc. Math. Stat., Springer, Cham, 2017, pp. 199–207.
  • [77] J. Zeifang, J. Schütz, K. Kaiser, A. Beck, M. Lukáˇcová Medvid’ová, and S. Noelle, A novel full-Euler low Mach number IMEX splitting, Commun. Comput. Phys., 27 (2020), pp. 292–320.
  • [78] B. Zhang, H. Liu, and S. Jin, An asymptotic preserving Monte Carlo method for the multispecies Boltzmann equation, J. Comput. Phys., 305 (2016), pp. 575–588.
  • [79] X. Zhong, Additive semi-implicit Runge-Kutta methods for computing high-speed nonequilibrium reactive flows, J. Comput. Phys., 128 (1996), pp. 19–31.