An Asymptotic-Preserving Scheme for Isentropic Flow in Pipe Networks
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:
(1.1) | ||||
where is the (one-dimensional) spatial variable, denotes time, is the fluid density, denotes the fluid velocity, is the pressure under the isentropic assumption, in which is the ratio of specific heats, and 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 and cross section ; see e.g. [67, 14]; the unknowns and 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 in this paper). Furthermore, AP schemes allow for the space and time discretization to be independent of ; 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 , characteristic density , characteristic velocity , and characteristic pressure , along with using the pipe length as the characteristic length. Therefore, the dimensionless quantities for system (1.1) read
Taking , 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:
where
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 , and follow the suggestions of [16, 27, 26] in taking , where is a constant, resulting in the parameterized system
(2.1) | ||||
which can otherwise be written in the following vector form
(2.2) |
where , denotes the flux, and is the source due to friction along the pipe walls.
Remark 2.1.
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 as and , respectively, and the variables in pipe as .
Consider a single junction in which pipes with indices denote the ingoing pipelines and those with indices are the outgoing pipelines, as depicted in Figure 1.
Then at the junction, one must have the coupling condition for:
Conservation of momentum:
(2.3) |
paired with one of the following:
- (a)
-
(b)
Equal momentums (see, e.g., [19]):
(2.5) - (c)
Notice that the -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 (); (ii) has a flow direction that does not change (); and (iii) is under subsonic conditions () [6, 7, 19]. These coupling conditions are implemented into the boundary conditions of each pipe ; 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 and . Note that for simplicity, we removed the superscript 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
Consequentially, we can obtain the asymptotic expansion for pressure using Taylor series:
(2.7) |
Note that the terms are skipped since there are no appearing in system (2.1). Substituting the expansions of into system (2.1) and collecting like powers of , we obtain the asymptotic behavior of the isentropic Euler equations with a friction source:
(2.8) | ||||
Here, note that the asymptotic is exactly that discussed in Remark 2.1.
Similarly, we consider the 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 -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 , one can find that the wave speeds of system (2.2) are
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 , the corresponding time-step restriction due to the CFL condition would be
(2.9) |
where denotes the CFL number. On top of this, explicit schemes typically have numerical diffusion of [37], where is the order of the method, further implying that one would need to select to combat excessive numerical diffusion in the results. Therefore, to obtain unsmeared results, the time-step restriction for explicit schemes would need to be . 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 system of equations, where is the number of cells in the spatial discretization.
Thus, we want a scheme that removes this -dependence in the time-step restriction, converges to the asymptotics in (2.8), and maintains the correct coupling conditions in the 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:
(3.1) | ||||
Equivalently, the split form (3.1) can be written into an updated vector form, which reads
(3.2) |
where
(3.3) |
are the slow (non-stiff) and fast (stiff) dynamics parts of the fluxes, respectively, and is defined in (2.2).
To guarantee the non-stiff subsystem is indeed non-stiff and hyperbolic, and must be chosen appropriately to remove the dependence on the wave speeds. Computed by finding the eigenvalues of the Jacobian , the wave speeds of this subsystem are
(3.4) |
Thus, to ensure the eigenvalues of the non-stiff subsystem are real and are instead of as in the original system (2.1), we take
(3.5) |
and . 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.
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 explicitly, and use an implicit approximation for the stiff flux terms and the friction source Since the source term 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:
(3.6) | |||
(3.7) |
The influence of the Rosenbrock-type method appears in the discretization of the source of (3.7), in which only the term is evaluated at time . For simplicity and notation purposes, let us define
One can then solve equations (3.6)–(3.7) for and , respectively, to obtain
(3.8) | ||||
(3.9) |
where
(3.10) |
is always greater than 1. Following then that of [21], we then differentiate (3.9) with respect to and substitute this into (3.8) to obtain an elliptic equation for
(3.11) |
Assuming all values at time are known, this implies that the choice of the Rosenbrock-type method in (3.7) results in just a linear equation for the unknown . 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 . This solution of is then substituted into (3.9) to obtain .
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 . For each pipe in the network, we split the domain into finite volume cells , where . Assume that at time level , the solution is realized in terms of its cell averages
Then we approximate the contribution of the non-stiff flux terms in each cell using
(3.12) |
where are computed using the CU fluxes; see, e.g., [38, 60, 61]:
(3.13) |
Here, are one-sided point values of at the cell interface, computed at time using the piecewise linear reconstruction
Therefore, the values of the reconstruction at the interface are
(3.14) |
where the slopes are computed using a nonlinear limiter to avoid oscillations. In this paper, we use the generalized minmod limiter (see, e.g., [62, 65, 71]):
where the minmod function is
and is applied component-wise. Lastly, of (3.13) denote the one-sided speeds of propagation, estimated at time using the largest and smallest eigenvalues of the Jacobian seen in (3.4):
(3.15) | ||||
3.3 Fully Discrete Method
To obtain the fully discrete AP scheme for cell , we take the elliptic equation for in (3.11) and the equation for in (3.9) and (i) compute non-stiff flux terms 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 . Thus, the fully discrete AP scheme for reads
(3.16) | ||||
where is defined in (3.12)–(3.13), from (3.10),
is the discrete central difference operator, and
is used for the evaluation of to keep the second-order spatial approximation in the elliptic solve. Note that the definition of in (3.10) results in , in turn implying that the corresponding matrix to be formed on the right hand side of (3.16) is non-singular (by Gershgorin Theorem).
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 and . 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:
(3.18) |
in which, due to the selection of and made in (3.5), the denominator is independent of .
To ensure is completely -independent, we must also confirm the numerical diffusion of the proposed scheme does not have a 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
where
(3.19) | ||||
is the numerical diffusion term of the CU discretization, with to denote the different components. Here, are defined in (3.15) and are defined in (3.14). To compute the leading order of the numerical diffusion in (3.19), we introduce the following asymptotic expansions:
The asymptotic expansion of and 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 in a way that follows its definition in (3.5):
where is a constant in space at time . Using these expansions, we can obtain the leading order of the numerical diffusion (3.19) for :
(3.20) | ||||
Since from (3.5), this is by the last term of (3.20), as is generally not constant in space. Similarly, one can compute the leading order of numerical diffusion (3.19) for , which comes from the portion of the flux seen in equation (3.2). However, since and its expansion are related to and , it is clear that the expansions to compute the diffusion will not result in any cancellation of the term. Thus, .
Finally, substituting the CU fluxes into (3.12), we can obtain the following approximations to :
(3.21) | ||||
(3.22) |
where and again represents the central difference operator. Here, the term in (3.21) and the term in (3.22) come from the leading orders from the diffusion and , respectively, and the piece arises since these diffusion terms are introduced via the second-order CU discretization.
Normally, this 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 diffusion term is always paired with a division by . Then, since defined in (3.10) is , the dependence of in the leading order diffusion term cancels. This -independence within the numerical diffusion, in combination with the denominator of (3.18) being independent of , implies that the time-step restriction of the proposed AP scheme is indeed independent of . Furthermore, it is sufficient to take (as opposed to the 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 for each pipe . We then seek the values satisfying the coupling conditions such that the half-Riemann problem [41, 41, 32]
(3.23) | ||||
admits a self-similar solution in which all generated waves have non-negative speeds. Here, and are defined in (2.2). Then, if considering coupling conditions (2.3) and (2.4), this amounts to solving the following nonlinear system for :
(3.24) | ||||
where the known states are and , and the functions denote the forward and reversed 1-Lax curve and 2-Lax curve for the isothermal Euler equations in equation (2.1) with (see similarly, [19]):
(3.25) | ||||
The construction of system (3.24) would follow analogously if instead using the coupling conditions in (2.5) or (2.6).
The known states seen in (3.24) are selected by taking the cell value nearest the junction at time ; i.e., we take for ingoing pipelines and for outgoing pipelines. The nonlinear system (3.24) is solved via Newton’s method with initial guess , in which the Jacobian within the Newton iteration is invertible if the initial guess is subsonic [19]. Note the 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 within 2–3 Newton iterations.
Once is computed, we can directly calculate using
The results of the nonlinear solve and are then prescribed as the ghost cell values in the spatial discretization described in §3.2.
Lemma 3.2.
Proof.
Since the second condition of (3.24) is -independent, we only need to focus on the first condition. For brevity, let us first rewrite the Lax-curve definitions in (3.25) as
where and are taken such that these are equivalent to (3.25). In this proof, we will only consider the case in which for both and , and the proofs for the other three pairings follow analogously. Following this assumption, then the Lax curves for this case read
Note that in the context of the nonlinear system (3.24), the case in which for both and is equivalent to having and . We can then use this specific case of the Lax curves and substitute directly into (3.24) to obtain the nonlinear system:
(3.26) | ||||
This system with has already been proven to be a well-posed system in [19]. We then multiply the first equation of (3.26) by and take the limit to obtain an equivalent nonlinear system in which we wish to solve for , which reads
(3.27) | ||||
This is equivalent to that of (3.26) with 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 . ∎
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 . 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 and 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 and ; and (ii) the central difference derivative of numerical fluxes near pipeline boundaries.
The requirement for reconstructed values at the domain boundaries and 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
for ingoing and outgoing pipelines, respectively. Here, 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 . As seen in (3.16), we require a central difference of , which by (3.12) implies the need to evaluate the unknowns and 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 for cells and and use the extrapolated values in the central difference seen in (3.16); that is, we use
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 , the method converges to the asymptotic state in (2.8). Consider the following asymptotic expansions for the discretization of , and , which follow from §2.2:
(3.28) | ||||
and analogously at time . 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
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 in (3.17):
Note that the left hand side is effectively the local truncation error multiplied by the term . Here, we first substitute in for using equation (3.22), resulting in the form
where comes from the leading order of diffusion that appears within the term of (3.22). Substituting in from (3.3) and from (3.10), we obtain
We then apply the asymptotic expansions from (3.28) and take , resulting in
Since represents the second-order central difference operator, then we equivalently have
where represents the the leading error coefficient from using central difference. Lastly, applying Taylor series to the terms at time about time , we obtain
Here, denotes the leading error term from the Taylor series. Therefore, we can bound the asymptotic expansion at time :
with , 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 , follow the CFL condition in (3.18) and take the CFL number , in the source term of (2.1) choose and , take the minmod parameter , and set the tolerance for the Newton solve at the junctions to be .
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.
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
and for outgoing pipes we take the initial conditions , . We will take each pipe to have a length of , 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 , but the smooth profile will not reach the inlets/outlets by final time. At the inlets, we take a Dirichlet boundary condition of , and at the outlets we take Neumann boundary conditions.
Since the exact solution is unknown, we obtain the experimental convergence rates by computing the solution on a number of different meshes, then use the Runge formula
where denotes the density solution computed on a uniform mesh with all cells having width . The convergence rates for can be computed analogously. We present the errors and rates for and 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.
Rate | Rate | ||||
---|---|---|---|---|---|
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 | |
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 | |
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 |
Rate | Rate | ||||
---|---|---|---|---|---|
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 | |
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 | |
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 |
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
with each pipe having a length of 100. At the inlets, we take a Dirichlet boundary condition of , 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 values of , , and to the final times of , , and , respectively, to capture the behavior of the discontinuity through the junction. The resulting solutions for and 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 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 at . In addition, we see that in the cases that produce discontinuities in the solution, there are no spurious oscillations present.














Example 3 – Comparison with the CU Explicit Scheme
In this example, we test the importance of the -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 for the 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 , the run times for the two methods are on the same order of magnitude. However, the difference becomes drastic as . It is clear in Table 3 that the AP scheme keeps all run times roughly the same for varying . Conversely, the explicit scheme has the expected -dependence within the experimental run times – which, for , results in simulations that are a daunting 140 slower than that of the AP scheme.
AP Scheme Run Time | Explicit Scheme Run Time | ||
---|---|---|---|
1/20 | 2.44 s | 4.05 s | |
1/40 | 9.14 s | 16.1 s | |
1/80 | 37.4 s | 65.5 s | |
1/20 | 2.89 s | 46.8 s | |
1/40 | 11.0 s | 192 s | |
1/80 | 44.0 s | 782 s | |
1/20 | 2.91 s | 406 s | |
1/40 | 11.0 s | 1610 s | |
1/80 | 43.7 s | 6450 s |
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 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 -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.