Next Article in Journal
Experimental Study on Axial Compression Behavior and Bearing Capacity Analysis of High Titanium Slag CFST Columns
Next Article in Special Issue
Multi-Switching Combination Synchronization of Three Fractional-Order Delayed Systems
Previous Article in Journal
An Eight-Zonal Piezoelectric Tube-Type Threaded Ultrasonic Motor Based on Second-Order Bending Mode
Previous Article in Special Issue
Parametrical Non-Complex Tests to Evaluate Partial Decentralized Linear-Output Feedback Control Stabilization Conditions from Their Centralized Stabilization Counterparts
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Short Overview of Early Developments of the Hardy Cross Type Methods for Computation of Flow Distribution in Pipe Networks

1
European Commission, Joint Research Centre (JRC), 21027 Ispra, Italy
2
IT4Innovations, VŠB—Technical University of Ostrava, 708 00 Ostrava, Czech Republic
3
Research and Development Center “Alfatec”, 18000 Niš, Serbia
*
Authors to whom correspondence should be addressed.
On a short visit at IT4Innovations, VŠB—Technical University of Ostrava.
Appl. Sci. 2019, 9(10), 2019; https://doi.org/10.3390/app9102019
Submission received: 9 March 2019 / Revised: 10 April 2019 / Accepted: 16 April 2019 / Published: 16 May 2019

Abstract

:
Hardy Cross originally proposed a method for analysis of flow in networks of conduits or conductors in 1936. His method was the first really useful engineering method in the field of pipe network calculation. Only electrical analogs of hydraulic networks were used before the Hardy Cross method. A problem with flow resistance versus electrical resistance makes these electrical analog methods obsolete. The method by Hardy Cross is taught extensively at faculties, and it remains an important tool for the analysis of looped pipe systems. Engineers today mostly use a modified Hardy Cross method that considers the whole looped network of pipes simultaneously (use of these methods without computers is practically impossible). A method from a Russian practice published during the 1930s, which is similar to the Hardy Cross method, is described, too. Some notes from the work of Hardy Cross are also presented. Finally, an improved version of the Hardy Cross method, which significantly reduces the number of iterations, is presented and discussed. We also tested multi-point iterative methods, which can be used as a substitution for the Newton–Raphson approach used by Hardy Cross, but in this case this approach did not reduce the number of iterations. Although many new models have been developed since the time of Hardy Cross, the main purpose of this paper is to illustrate the very beginning of modeling of gas and water pipe networks and ventilation systems. As a novelty, a new multi-point iterative solver is introduced and compared with the standard Newton–Raphson iterative method.

1. Introduction

Hardy Cross solved the problem of distribution of flow in networks of pipes in his article “Analysis of Flow in Networks of Conduits or Conductors” [1] published on 13 November 1936.
Networks of pipes are nonlinear systems since the relation between flow and pressure is not linear. On the contrary, the relation between current and voltage in electrical networks with regular resistors is governed by the linear Ohm’s law. Electrical circuits with diodes as well as hydraulic networks are nonlinear systems where resistance depends on current and voltage, i.e., on flow and pressure, respectively [2]. Nonlinear electrical circuits are electrical circuits containing nonlinear components. Nonlinear components can be resistive, capacitive, and inductive.
The distribution of flow in a network of pipes depends on the known inputs and consumptions at all nodes, on the given geometry of pipes, and on network topology. A stable state of flow in a network must satisfy Kirchhoff’s laws, which are statements of the conservation of mass and energy. Although in theory an indefinite number of flow distributions that satisfy that the conservation of mass is possible, only one distribution from this set also satisfies the conservation of energy for all closed paths formed by pipes in the network. This state is unique for the given network and in- and outflows [3].
Since the relation between flow and pressure is not linear, Hardy Cross used a relation between an increment of flow and an increment of pressure, as this relation is linear for the given quantity of flow. If, however, the increments are fairly large, this linear relation is somewhat in error, such as for gas compressible flow. However, if the pressure drop in pipes is minor, such as in a municipality network for natural gas distribution, the Hardy Cross method can be used without significant errors [4,5,6]. Moreover, the Hardy Cross method can also be used for water pipe networks (district heating [7] and cooling networks [8]) and ventilation systems [9,10] (a related formulation is presented in Appendix).
The Hardy Cross method is an iterative method, i.e., a method using successive corrections [4]. Lobačev and Andrijašev in the 1930s, writing in Russian, offered similar methods [11,12]. Probably because of the language barrier and the political situation in Soviet Russia, Hardy Cross was not aware of Lobačev and Andrijašev’s contributions.
Today, engineers use the most improved version of the Hardy Cross method (the Δ Q method [13]; for Δ p , see [14]), which analyzes the whole looped network of pipes simultaneously [15].
As a novel approach presented for the first time here, we tested multi-point iterative methods [16,17] that can be used as a substitution for the Newton–Raphson approach used by Hardy Cross. This approach, however, did not in this case reduce the number of required iterations to reach the final balanced solution.
One example of the pipe network for distribution of gas is analyzed using the original Hardy Cross method [1] in Section 3.1, its related equivalent from Russian literature [11,12] in Section 3.2, the improved version of the Hardy Cross method [15,17,18] in Section 3.3, and finally the approach which uses multi-point iterative methods instead of the commonly used Newton–Raphson method in Section 3.4.

2. Network Piping System; Flow Distribution Calculation

2.1. Topology of the Network

The first step in solving a pipe network problem is to make a network map showing pipe diameters, lengths and connections between pipes (nodes). Sources of natural gas supply and consumption rates have to be assigned to nodes. For convenience in locating pipes, code numbers are assigned to each pipe and closed loop of pipes (represented by roman numbers for loops in Figure 1). Pipes on the network periphery are common to one loop and those in the network interior are common to two loops. Figure 1 is an example of a pipe network for distribution of natural gas for consumption in households.
The next step is to write the initial gas flow distribution through pipes in the network. This distribution must be done according to Kirchhoff’s first law. The choice of initial flows is not critical, and the criterion should satisfy Kirchhoff’s first law for every node in the network [3]. The total gas flow arriving at a node equals the total gas flow that leaves that node. The same conservation law is also valid for the whole network in total (except for gas input and output nodes that cannot be changed during calculations; see consumption nodes in Figure 1). The sum of pseudo-pressure drops along any closed path must be approximately zero for the network to be in balance according to Kirchhoff’s second law. In this paper, the flow distribution, which satisfies both of Kirchhoff’s laws, will be calculated using the Hardy Cross iterative method.

2.2. A Hydraulic Model

The Renouard formula; Equation (1) best fits a natural gas distribution system built with polyvinyl chloride (PVC) pipes [19,20]. Computed pressure drops are always less than the actual drop since the maximal consumption occurs only during extremely severe winter days [21,22].
f = Δ p ˜ 2 = p 1 2 p 2 2 = 4810 · ρ r · L · Q 1.82 D 4.82
where f is a function of pressure, ρ r is relative gas density (dimensionless), ρ r = 0.64 , L is the pipe length (m), D is the pipe diameter (m), Q is flow (m3/s), and p is pressure (Pa).
As shown in Appendix A, other formulas are used in the case of waterworks systems [23,24] and ventilation networks [7].
Regarding the Renouard formula (Equation (1)), one has to be careful since the pressure drop function, f , does not relate pressure drop, but actually the difference of the quadratic pressure at the input and the output of the pipe. This means that Δ p ˜ 2 = p 1 2 p 2 2 is not actually pressure drop despite using the same unit of measurement, i.e., the same unit is used as for pressure (Pa). The parameter Δ p ˜ 2 can be noted as a pseudo-pressure drop. In fact, the gas is actually compressed, and hence that volume of the gas is decreased, and then such a compressed volume of the gas is conveying with a constant density through the gas distribution pipeline. The operating pressure for a typical distribution gas network is 4 × 10 5 Pa abs, i.e., 3 × 10 5 Pa gauge, and accordingly the volume of the gas decreases four times compared to the volume of the gas in normal (or standard) conditions. Pressure in the Renouard formula is for normal (standard) conditions.
The first derivative f’ of the Renouard relation (Equation (2)), where the flow is treated as a variable, is used in the Hardy Cross method.
f = f ( Q ) Q = 1.82 · 4810 · ρ r · L · Q 0.82 D 4.82
First assumed gas flow in each pipe is listed in the third column of Table 1. The plus or minus sign preceding flow indicates the direction of flow through the pipe for the particular loop [18,25]. A plus sign denotes counterclockwise flow in the pipe within the loop, while the minus sign clockwise. The loop direction can be chosen to be clockwise or counterclockwise (in Figure 1, all loops are counterclockwise).

3. The Hardy Cross Method; Different Versions

The Hardy Cross method is presented here: the original approach in Section 3.1, a version of the Hardy Cross method from Russian practice in Section 3.2, the modified Hardy Cross method in Section 3.3, and finally the method that uses multi-point iterative procedures instead the Newton–Raphson method and which can be implemented in all the aforementioned methods.

3.1. The Hardy Cross Method; Original Approach

The pressure drop function for each pipe is listed in Table 1 (for initial flow pattern, in the fourth column). The sign in front of the pressure drop function shown in the fourth column is the same as for flow from the observed iteration. The fifth column of Table 1 includes the first derivatives of the pressure drop function, where the flow is treated as a variable. The column of the function of pressure drops is computed algebraically, while the column of the first derivatives is estimated numerically for each loop. Flow correction Δ Q has to be computed for each loop x (Equation (3)).
Δ Q x = ( ± f | f | ) x = ( ± 4810 · ρ r · L · Q 1.82 D 4.82 | 1.82 · 4810 · ρ r · L · Q 0.82 D 4.82 | ) x
For the network from Figure 1, flow corrections for the first iteration in each loop can be calculated using Equation (4).
( | f 1 | + | f 7 | + | f 8 | + | f 9 | + | f 10 | + | f 12 | ) · Δ Q I = f 1 + f 7 + f 8 + f 9 f 10 f 12 ( | f 2 | + | f 11 | + | f 12 | ) · Δ Q I I = f 2 f 11 + f 12 ( | f 3 | + | f 4 | + | f 10 | + | f 11 | + | f 14 | ) · Δ Q I I I = f 3 + f 4 + f 10 + f 11 f 14 ( | f 5 | + | f 9 | + | f 13 | + | f 14 | ) · Δ Q I V = f 5 f 9 + f 13 + f 14 ( | f 6 | + | f 8 | + | f 13 | ) · Δ Q V = f 6 f 8 + f 13 }
In the second iteration, the calculated correction Δ Q has to be added algebraically to the assumed gas flow (the first initial flow pattern). Further, the calculated correction Δ Q has to be subtracted algebraically from the gas flow computed in the previous iteration. This means that the algebraic operation for the first correction is the opposite of its sign, i.e., add when the sign is minus, and vice versa. A pipe common to two loops receives two corrections simultaneously. The first correction is from the particular loop under consideration, while the second one is from the adjacent loop, which the observed pipe also belongs to.
The upper sign after the second correction in Table 1 is plus if the flow direction in the mutual pipe coincides with the assumed orientation of the adjacent loop, and minus if it does not (Figure 2). The lower sign is the sign in front of correction Δ Q calculated for the adjacent loop (Figure 2).
Details of the signs of corrections were reported by Brkić [18] and Corfield et al. [25].
The algebraic operation for the second correction should be the opposite of its lower sign when its upper sign is the same as the sign in front of flow Q , and, as indicated by its lower sign, when its upper sign is opposite to the sign in front of flow Q .
The calculation procedure is repeated until the net algebraic sum of pressure functions around each loop is as close to zero as the desired degree of precision demands. This also means that the calculated corrections of flow and the change in calculated flow between two successive iterations is approximately zero. The pipe network is then in approximate balance and the calculation after the Hardy Cross can be terminated.
In the original Hardy Cross method, the corrections for the first iteration are:
Δ Q I = 1575448179.8 13987715480.9 = + 0.1126
Δ Q I I = 8424412.4 957889226.7 = 0.0088
Δ Q I I I = 170493836.7 8186058014.8 = 0.0208
Δ Q I V = 749453158.7 8402810812.8 = 0.0892
and
Δ Q V = 325325177.5 3605869136.3 = 0.0902

3.2. A Version of the Hardy Cross Method from Russian Practice

As mentioned in the Introduction, two Russian authors, Lobačev [11] and Andrijašev [12], proposed a similar method to Hardy Cross [1]. These two methods are also from the 1930s. It is not clear if Hardy Cross had been aware of the contribution of these two authors from Soviet Russia and vice versa, but most probably the answer to this question is no, for both sides. The main difference between the Hardy Cross and Andrijašev methods is that in the method of Andrijašev contours can be defined to include few loops. This strategy only complicates the situation, while the number of required iterations remains unchanged.
Further on, the Andrijašev method can be seen from the example in the paper of Brkić [3]. Here, the method of Lobačev is shown in more detail. In the Hardy Cross method, the influence of adjacent loops is neglected. The Lobačev method takes into consideration this influence (Equation (5)):
+ ( | f 1 | + | f 7 | + | f 8 | + | f 9 | + | f 10 | + | f 12 | ) · Δ Q I + | f 12 | · Δ Q I I + | f 10 | · Δ Q I I I + | f 9 | · Δ Q I V + | f 8 | · Δ Q V = f 1 + f 7 + f 8 + f 9 f 10 f 12 | f 12 | · Δ Q I ( | f 2 | + | f 11 | + | f 12 | ) · Δ Q I I | f 11 | · Δ Q I I I = f 2 f 11 + f 12 + | f 10 | · Δ Q I | f 11 | · Δ Q I I ( | f 3 | + | f 4 | + | f 10 | + | f 11 | + | f 14 | ) · Δ Q I I I | f 14 | · Δ Q I V = f 3 + f 4 + f 10 + f 11 f 14 + | f 9 | · Δ Q I | f 14 | · Δ Q I I I ( | f 5 | + | f 9 | + | f 13 | + | f 14 | ) · Δ Q I V | f 13 | · Δ Q V = f 5 f 9 + f 13 + f 14 + | f 8 | · Δ Q I | f 13 | · Δ Q I V ( | f 6 | + | f 8 | + | f 13 | ) · Δ Q V = f 6 f 8 + f 13 }
In Equation (5), signs in front of terms from the left side of the equal signs have to be determined (this is much more complex than in the Hardy Cross method). Thus, in the Lobačev method, if ( f ) x > 0 , then the sign in front of ( | f | ) x has to be positive, and vice versa (for the first iteration, this can be seen in Table 1; f I = + 1575448179.8 > 0 , f I I = 8424412.4 < 0 , f I I I = 170493836.7 < 0 , f I V = 749453158.7 < 0 , f V = 325325177.5 < 0 ). The sign for the other terms (these terms are sufficient in the Hardy Cross method) are determined using further rules and the scheme in Figure 3.
As shown in Figure 3 if ( f ) x > 0 and if the assumed flow coincides with the loop direction, then the sign of flow in the adjacent pipe is negative and, if the flow does not coincide with the loop direction, then the sign of flow in the adjacent pipe is positive. Conversely, if ( f ) x < 0 and if the assumed flow coincides with the loop direction, then the sign of flow in the adjacent pipe is positive and, if the flow does not coincide with the loop direction, then the sign of flow in the adjacent pipe is negative. This procedure determines the signs in the front of the flow corrections ( Δ Q ), which are shown in Figure 3 with black letters (and also in Figure 4 for our pipe network example).
If ( f ) x from the adjacent loop is positive, while the loop direction and assumed flow do not coincide, the flow correction from the adjacent loop changes its sign, and, conversely, if ( f ) x from the adjacent loop is positive, while the loop direction and assumed flow coincide, the flow correction from the adjacent loop does not change its sign. If ( f ) x from the adjacent loop is negative, while the loop direction and assumed flow do not coincide, the flow correction from the adjacent loop does not change its sign, and, conversely, if ( f ) x from the adjacent loop is negative, while the loop direction and assumed flow do not coincide, the flow correction from the adjacent loop changes its sign. These four parameters are connected in Figure 3 with the same colored lines. Flow corrections ( Δ Q ) shown in Figure 4 with different colors are used with the related signs in Equation (5). They are chosen in a similar way as explained in the example in Figure 3.
Thus, instead of the simple equations of the original Hardy Cross method, the system of equations has to be solved in the Lobačev method (Equation (6)).
+ 13987715480.9 · Δ Q I + 679911398.4 · Δ Q I I + 3220265516.7 · Δ Q I I I + 5245486154.8 · Δ Q I V + 1828124435.8 · Δ Q V _ = + 1575448179.8 + 679911398.4 · Δ Q I _ 957889226.7 · Δ Q I I 221537615.9 · Δ Q I I I _ = 8424412.4 + 3220265516.7 · Δ Q I _ 221537615.9 · Δ Q I I _ 8186058014.8 · Δ Q I I I 1429824980.5 · Δ Q I V _ = 170493836.7 + 5245486154.8 · Δ Q I 1429824980.5 · Δ Q I I I _ 8402810812.8 · Δ Q I V 1429824980.5 · Δ Q V _ = 749453158.7 + 1828124435.8 · Δ Q I 1429824980.5 · Δ Q I V _ 3605869136.3 · Δ Q V = 325325177.5 }
Underlined terms in Equation (6) do not exist in the Hardy Cross method.
In the Lobačev method, corrections for the first iterations are Δ Q x = Δ ( Δ Q x ) Δ , where Δ for the first iteration is (Equation (7)):
Δ = | 13987715480.9 679911398.4 3220265516.7 5245486154.8 1828124435.8 679911398.4 957889226.7 221537615.9 0 0 3220265516.7 221537615.9 8186058014.8 1429824980.5 0 5245486154.8 0 1429824980.5 8402810812.8 1429824980.5 1828124435.8 0 0 1429824980.5 3605869136.3 | = + 3.97 · 10 + 48
while ΔQx for the first iteration is (Equation (8)).
Δ ( Δ Q I ) = | 1575448179.8 8424412.4 170493836.7 749453158.7 325325177.5 679911398.4 957889226.7 221537615.9 0 0 3220265516.7 221537615.9 8186058014.8 1429824980.5 0 5245486154.8 0 1429824980.5 8402810812.8 1429824980.5 1828124435.8 0 0 1429824980.5 3605869136.3 | = 4.14 · 10 + 47
The correction for the first loop in the first iteration is (Equation (9)).
Δ Q I = Δ ( Δ Q I ) Δ = 4.14 · 10 + 47 + 3.97 · 10 + 48 = 0.1041
Other corrections in the first iteration are Δ Q I I = −0.0644, Δ Q I I I = 0.0780 , Δ Q I V = + 0.1069 and Δ Q V = 0.1824 .
The Lobačev method is more complex compared to the original Hardy Cross method. However, the number of required iterations is not reduced using the Lobačev procedure compared with the original Hardy Cross procedure.

3.3. The Modified Hardy Cross Method

The Hardy Cross method can be noted in matrix form. The gas distribution network in Figure 1 has five independent loops (Equation (10)).
[ | f I | 0 0 0 0 0 | f I I | 0 0 0 0 0 | f I I I | 0 0 0 0 0 | f I V | 0 0 0 0 0 | f V | ] x [ Δ Q I Δ Q I I Δ Q I I I Δ Q I V Δ Q V ] = [ ± f I ± f I I ± f I I I ± f I V ± f V ]
Equation (4) provides for each particular loop in the network the same corrections as Equation (10) using matrix calculation. Epp and Fowler [15] improved the original Hardy Cross method [1] by replacing some of the zeroes in the non-diagonal terms of Equation (10). For example, if pipe 8 is mutual for loop I and V, the first derivative of the pressure drop function for the observed pipe, where flow treated as a variable, will be put with a negative sign in the first column and the fifth row, and also in the fifth column and the first row (Equation (11)).
[ | f I | f 12 f 10 f 9 f 8 f 12 | f I I | f 11 0 0 f 10 f 11 | f I I I | f 14 0 f 9 0 f 14 | f I V | f 13 f 8 0 0 f 13 | f V | ] x [ Δ Q I Δ Q I I Δ Q I I I Δ Q I V Δ Q V ] = [ ± f I ± f I I ± f I I I ± f I V ± f V ]
In the modified Hardy Cross method, corrections for the first iterations are shown in Equation (12), and the solutions are listed in Table 1.
[ + 13987715480.9 679911398.4 3220265516.7 5245486154.8 1828124435.8 679911398.4 + 957889226.7 221537615.9 0 0 3220265516.7 221537615.9 + 8186058014.8 1429824980.5 0 5245486154.8 0 1429824980.5 + 8402810812.8 1429824980.5 1828124435.8 0 0 1429824980.5 + 3605869136.3 ] x [ Δ Q I Δ Q I I Δ Q I I I Δ Q I V Δ Q V ] = [ + 1575448179.8 8424412.4 170493836.7 749453158.7 325325177.5 ]
This procedure significantly reduces the number of iterations required for the solution of the problem (Figure 5).
The first two iterations for the network in Figure 1 are shown in Table 1. Pipe diameters and lengths, as well as the first, assumed, and the final calculated flow distributions for the network in balance are shown in Table 2.
The gas velocity in the network is small (can be up to 10–15 m/s). The network can be the subject of diameter optimization (as in [4]), which can also be done by using the Hardy Cross method (diameter correction Δ D should be calculated for known and locked flow, where the first derivative of the Renouard function has to be calculated for diameter as a variable). The network should stay unchanged, even if planned gas consumption on nodes 5, 6, 8 and 10 increases, as pipes 4 and 13 will be useful thanks to increased gas flow.
Similar examples, but for water flow, can be seen in [26]. Optimization of pipe diameters in a water distributive pipe network using the same approach can be seen in [6].

3.4. The Multi-Point Iterative Hardy Cross Method

The here described multipoint method can substitute the Newton–Raphson iterative procedure used in all the above described methods. Recently, we successfully used this multipoint method for acceleration of the iterative solution of the Colebrook equation for flow friction modeling [16,17]. On the contrary, for the gas network example in Figure 1, the multipoint method requires the same number of iterations as the original Newton–Raphson procedure.
For the test, we used the three-point method from Džunić et al. [27]. Flow corrections Δ Q I from Equations (10) and (11) from the first loop I should be calculated using the three-point procedure (Equation (13)):
{ Δ Q I = ( ± f I ) i ( | f I | ) i ,   w h e r e   i = 1 ; Δ Q I = ( ± f I ) i ( ± f I ) i 2 · ( ± f I ) i + 1 · ( ± f I ) i + 1 ( | f I | ) i ,   w h e r e   i = 2 ; Δ Q I = ( ± f x ) i + 2 ( | f I | ) i · [ 1 2 · ( ± f I ) i + 1 ( ± f I ) i ( ( ± f I ) i + 1 ( ± f I ) i ) 2 ] · [ 1 ( ± f I ) i + 2 ( ± f I ) i + 1 ] · [ 1 2 · ( ± f I ) i + 2 ( ± f I ) i ] ,   w h e r e   i > 2 ;
Formulas of flow corrections Δ Q I depend on the counter i. The algorithm starts from i = 1, in which the multipoint method is the same as the original Newton–Raphson procedure (Equation (13a)):
Δ Q I = ( ± f I ) i ( | f I | ) i
In the second iteration, i = 2, flow corrections Δ Q I have a little bit more complicated form (Equation (13b)):
Δ Q I = ( ± f I ) i ( ± f I ) i 2 · ( ± f I ) i + 1 · ( ± f I ) i + 1 ( | f I | ) i
The symbol ( ± f I ) i represents stored values from the first iteration, whereas ( ± f I ) i + 1 represents values from the second iteration.
For the third iteration, i = 3, flow corrections Δ Q I have the most complicated form (Equation (13c)):
Δ Q I = ( ± f x ) i + 2 ( | f I | ) i · [ 1 2 · ( ± f I ) i + 1 ( ± f I ) i ( ( ± f I ) i + 1 ( ± f I ) i ) 2 ] · [ 1 ( ± f I ) i + 2 ( ± f I ) i + 1 ] · [ 1 2 · ( ± f I ) i + 2 ( ± f I ) i ]
This iterative process can continue, as the formula from the third iteration is also used for iterations i = 4, 5, 6, 7, etc. This procedure should be done for all loops in the network separately (in our case for I, II, III, IV and V). However, to simplify calculations, derivative-free methods can be used [28,29].

4. Conclusions

Hardy Cross simplified mathematical modeling of complex problems in structural and hydraulic engineering long before the computer age. Moment distributions in indeterminate concrete structures described with differential equations were too complex for the time before computers. Hardy Cross later applied these finding from structural analysis to balancing of flow in pipe networks. He revolutionized how the profession addressed complicated problems. Today, in engineering practice, the modified Hardy Cross method proposed by Epp and Fowler [15] is used rather than the original version of the Hardy Cross method [1]. Methods proposed by Hamam and Brameller [30], as well as by Wood and Charles [31] and Wood and Rayes [32], are used in common practice [33], too. Moreover, the node-oriented method proposed by Shamir and Howard [34] is also based on the Hardy Cross method.
Professional engineers use a different kind of looped pipeline in professional software [35], but. even today, engineers invoke the name of Hardy Cross with awe. When petroleum and natural gas or civil engineers have to figure out what is happening in looped piping systems [36], they inevitably turn to what is generally known as the Hardy Cross method. The original Hardy Cross method is still extensively used for teaching and learning purpose [6]. Here, we introduced into the Hardy Cross method the multi-point iterative approach instead of the Newton–Raphson iterative approach, but it does not affect the number of required iterations to reach the final solution in our case.
The view of Hardy Cross was that engineers lived in the real world with real problems and that it was their job to come up with answers to questions in design tasks, even if initial approximations were involved. After Hardy Cross, the essential idea which he wished to present involves no mathematical relations except the simplest arithmetic.
For example, ruptures of pipes with leakage can be detected using the Hardy Cross method because every single-point disturbance affects the general distribution of flow and pressure [37,38].
This paper has the purpose of illustrating the very beginning of modeling of gas or water pipe networks. As noted by Todini and Rossman [39], many new models have been developed since the time of Hardy Cross.
Some details about the life and work of Hardy Cross are given in Appendix B.

Author Contributions

The paper is a product of the joint efforts of the authors, who worked together on models of natural gas distribution networks. P.P. has a scientific background in applied mathematics and programming while D.B. has a background in control and applied computing in mechanical and petroleum engineering. D.B. performed calculations with advice from P.P. who has extensive experience with the implementation of probabilistic gas network modeling tools.

Funding

Resources to cover the Article Processing Charge were provided by the European Commission. This article is registered as Pubsy JRC116624 in the internal system for publications of the European Commission, Joint Research Center.

Acknowledgments

We acknowledge support from the European Commission, Joint Research Centre (JRC), Directorate C: Energy, Transport and Climate, Unit C3: Energy Security, Distribution and Markets, and we especially thank Marcelo Masera and Ricardo Bolado-Lavin for their scientific supervision and approvals. We also thank John Cawley from IT4Innovations, who as a native speaker kindly checked the correctness of English expressions throughout the paper. This work was partially supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia through the project iii44006 and by the Ministry of Education, Youth and Sports of the Czech Republic through the National Programme of Sustainability (NPS II) project “IT4Innovations excellence in science-LQ1602”. Dejan Brkić acknowledges support from the mentioned Czech’s project LQ1602 for funding of his stay in Ostrava at IT4Innovations.

Conflicts of Interest

The authors declare no conflict of interest. Neither the European Commission, the VŠB—Technical University of Ostrava, or the Alfatec nor any person acting on their behalf is responsible for any use which might be made of this publication.

Nomenclature

The following symbols are used in this paper:
ρ r relative gas density (-); here ρ r = 0.64
ρ density of air (kg/m3); here ρ = 1.2 kg/m3
L length of pipe (m)
D diameter of pipe (m)
Q flow (m3/s)
Δ Q flow correction (m3/s)
p pressure (Pa)
Δ p pressure correction (Pa)
f function of pressure
f first derivative of function of pressure
λ Darcy (Moody) flow friction factor (dimensionless)
R e Reynolds number (dimensionless)
ε D relative roughness of inner pipe surface (dimensionless)
C d flow discharge coefficient (dimensionless)
A area of ventilation opening (m2)
π Ludolph number; π 3.1415
i counter

Appendix A. Hydraulic Models for Water Pipe Networks and for Ventilation Systems

To relate pressure p [40] with flow Q , instead of Equation (1), which is used for gas distribution networks in municipalities, for water distribution the Darcy–Weisbach correlation and Colebrook equation are recommended (Equation (A1)) [23,41,42,43,44,45,46,47], and for ventilation systems, the Atkinson equation (Equation (A2)) [9]:
1 λ = 2 · l o g 10 ( 2.51 R e · 1 λ + ε 3.71 · D ) Δ p = 8 · ρ · λ · L · Q 2 π 2 · D 5 }
Δ p = ρ 2 · C d 2 · A 2 · Q 2

Appendix B. The Life and Work of Hardy Cross

Hardy Cross (1885–1959) was one of America’s most brilliant engineers [48,49,50,51,52,53,54,55]. He received a BSc degree in arts in 1902 and BSc degree in science in 1903, both from Hampden-Sydney College, where he taught English and Mathematics. Hardy Cross was also awarded a BSc degree in 1908 from Massachusetts Institute of Technology and an MCE degree from Harvard University in 1911, both in civil engineering. He taught civil engineering at Brown University from 1911 to 1918. He left teaching twice to become involved in the practice of structural and hydraulic engineering, from 1908 to 1909, and from 1918 to 1921. The most creative years of Hardy Cross were spent at the University of Illinois in Champaign-Urbana where he was a professor of structural engineering from 1921 to 1937. His famous article “Analysis of flow in networks of conduits or conductors” was published in 1936 in Urbana Champaign University Illinois Bulletin; Engineering Experiment Station number 286 [1]. His name is also famous in the field of structural engineering [53,54,55]. He developed the moment distribution method for statically indeterminate structures in 1932 [56]. This method has been superseded by more powerful procedures, however the moment distribution method made possible the efficient and safe design of many reinforced concrete buildings for the duration of an entire generation. Furthermore, the solution of the here discussed pipe network problems was a byproduct of his explorations in structural analysis. Later, Hardy Cross was Chair of the Department of Civil Engineering at Yale, from 1937 to the early 1950s.
Related to the moment distribution method for statically indeterminate structures developed by Hardy Cross in 1932 [56], it need to be noted that in 1922 and 1923, Konstantin A. Čališev, emigrant from Soviet Russia, writing in Serbian, offered a similar method of solving the slope deflection equations by successive approximations [57,58,59,60]. The method of Hardy Cross is an improved version of the Čališev’s method, but with important circumstance that Hardy Cross most probably was not aware of Čališev’s contributions. As noted in [49]: “It was Hardy Cross’s genius that he recognized he could bypass adjusting rotations to get to the moment balance at each and every node.”, which was the part that Čališev did not developed.

References

  1. Cross, H. Analysis of flow in networks of conduits or conductors. Eng. Exp. Stn. 1936, 34, 3–29. Available online: http://hdl.handle.net/2142/4433 (accessed on 28 March 2019).
  2. Katzenelson, J. An algorithm for solving nonlinear resistor networks. Bell Syst. Tech. J. 1965, 44, 1605–1620. [Google Scholar] [CrossRef]
  3. Gay, B.; Middleton, P. The solution of pipe network problems. Chem. Eng. Sci. 1971, 26, 109–123. [Google Scholar] [CrossRef]
  4. Brkić, D. Iterative methods for looped network pipeline calculation. Water. Resour. Manag. 2011, 25, 2951–2987. [Google Scholar] [CrossRef]
  5. Brkić, D. A gas distribution network hydraulic problem from practice. Petrol. Sci. Technol. 2011, 29, 366–377. [Google Scholar] [CrossRef]
  6. Brkić, D. Spreadsheet-based pipe networks analysis for teaching and learning purpose. Spreadsheets Educ. (EJSIE) 2016, 9, 4646. Available online: https://sie.scholasticahq.com/article/4646.pdf (accessed on 28 March 2019).
  7. Brkić, D.; Tanasković, T.I. Systematic approach to natural gas usage for domestic heating in urban areas. Energy 2008, 33, 1738–1753. [Google Scholar] [CrossRef] [Green Version]
  8. Augusto, G.L.; Culaba, A.B.; Tanhueco, R.M. Pipe sizing of district cooling distribution network using implicit Colebrook-White Equation. J. Adv. Comput. Intell. 2016, 20, 76–83. [Google Scholar] [CrossRef]
  9. Aynsley, R.M. A resistance approach to analysis of natural ventilation airflow networks. J. Wind Eng. Ind. Aerodyn. 1997, 67, 711–719. [Google Scholar] [CrossRef]
  10. Kassai, M.; Poleczky, L.; Al-Hyari, L.; Kajtar, L.; Nyers, J. Investigation of the energy recovery potentials in ventilation systems in different climates. Facta Univ. Ser. Mech. Eng. 2018, 16, 203–217. [Google Scholar] [CrossRef]
  11. Лoбачев, В.Г. Нoвый метoд увязки кoлец при расчете вoдoпрoвoдных сетей. Санитарная техника 1934, 2, 8–12. (In Russian) [Google Scholar]
  12. Андрияшев, М.М. Техника расчета вoдoпрoвoднoй сети. Мoсква, Огиз: Сoветскoе закoнoдательствo. 1932. (In Russian) [Google Scholar]
  13. Niazkar, M.; Afzali, S.H. Analysis of water distribution networks using MATLAB and Excel spreadsheet: Q-based methods. Comput. Appl. Eng. Educ. 2017, 25, 277–289. [Google Scholar] [CrossRef]
  14. Niazkar, M.; Afzali, S.H. Analysis of water distribution networks using MATLAB and Excel spreadsheet: H-based methods. Comput. Appl. Eng. Educ. 2017, 25, 129–141. [Google Scholar] [CrossRef]
  15. Epp, R.; Fowler, A.G. Efficient code for steady flows in networks. J. Hydraul. Div. ASCE 1970, 96, 43–56. [Google Scholar]
  16. Praks, P.; Brkić, D. Choosing the optimal multi-point iterative method for the Colebrook flow friction equation. Processes 2018, 6, 130. [Google Scholar] [CrossRef]
  17. Praks, P.; Brkić, D. Advanced iterative procedures for solving the implicit Colebrook equation for fluid flow friction. Adv. Civ. Eng. 2018, 2018, 5451034. [Google Scholar] [CrossRef]
  18. Brkić, D. An improvement of Hardy Cross method applied on looped spatial natural gas distribution networks. Appl. Energy 2009, 86, 1290–1300. [Google Scholar] [CrossRef] [Green Version]
  19. Coelho, P.M.; Pinho, C. Considerations about equations for steady state flow in natural gas pipelines. J. Braz. Soc. Mech. Sci. Eng. 2007, 29, 262–273. [Google Scholar] [CrossRef] [Green Version]
  20. Bagajewicz, M.; Valtinson, G. Computation of natural gas pipeline hydraulics. Ind. Eng. Chem. Res. 2014, 53, 10707–10720. [Google Scholar] [CrossRef]
  21. Pambour, K.A.; Cakir Erdener, B.; Bolado-Lavin, R.; Dijkema, G.P.J. Development of a simulation framework for analyzing security of supply in integrated gas and electric power systems. Appl. Sci. 2017, 7, 47. [Google Scholar] [CrossRef]
  22. Praks, P.; Kopustinskas, V.; Masera, M. Probabilistic modelling of security of supply in gas networks and evaluation of new infrastructure. Reliab. Eng. Syst. Saf. 2015, 144, 254–264. [Google Scholar] [CrossRef] [Green Version]
  23. Colebrook, C.F. Turbulent flow in pipes with particular reference to the transition region between the smooth and rough pipe laws. J. Inst. Civ. Eng. 1939, 11, 133–156. [Google Scholar] [CrossRef]
  24. Brkić, D.; Praks, P. Unified friction formulation from laminar to fully rough turbulent flow. Appl. Sci. 2018, 8, 2036. [Google Scholar] [CrossRef]
  25. Corfield, G.; Hunt, B.E.; Ott, R.J.; Binder, G.P.; Vandaveer, F.E. Distribution design for increased demand. In Gas Engineers Handbook; Segeler, C.G., Ed.; Industrial Press: New York, NY, USA, 1974; Chapter 9; pp. 63–83. [Google Scholar]
  26. Brkić, D. Discussion of “Economics and statistical evaluations of using Microsoft Excel Solver in pipe network analysis” by Oke, I.A.; Ismail, A.; Lukman, S.; Ojo, S.O.; Adeosun, O.O.; Nwude, M.O. J. Pipeline Syst. Eng. 2018, 9, 07018002. [Google Scholar] [CrossRef]
  27. Džunić, J.; Petković, M.S.; Petković, L.D. A family of optimal three-point methods for solving nonlinear equations using two parametric functions. Appl. Math. Comput. 2011, 217, 7612–7619. [Google Scholar] [CrossRef]
  28. Khdhr, F.W.; Saeed, R.K.; Soleymani, F. Improving the Computational Efficiency of a Variant of Steffensen’s Method for Nonlinear Equations. Mathematics 2019, 7, 306. [Google Scholar] [CrossRef]
  29. Behl, R.; Salimi, M.; Ferrara, M.; Sharifi, S.; Alharbi, S.K. Some Real-Life Applications of a Newly Constructed Derivative Free Iterative Scheme. Symmetry 2019, 11, 239. [Google Scholar] [CrossRef]
  30. Hamam, Y.M.; Brameller, A. Hybrid method for the solution of piping networks. Proc. Inst. Electr. Eng. 1971, 118, 1607–1612. [Google Scholar] [CrossRef]
  31. Wood, D.J.; Charles, C.O.A. Hydraulic network analysis using linear theory. J. Hydraul. Div. ASCE 1972, 98, 1157–1170. [Google Scholar]
  32. Wood, D.J.; Rayes, A.G. Reliability of algorithms for pipe network analysis. J. Hydraul. Div. ASCE 1981, 107, 1145–1161. [Google Scholar]
  33. Brkić, D.; Praks, P. An efficient iterative method for looped pipe network hydraulics free of flow-corrections. Fluids 2019, 4, 73. [Google Scholar] [CrossRef]
  34. Shamir, U.; Howard, C.D.D. Water distribution systems analysis. J. Hydraul. Div. ASCE 1968, 94, 219–234. [Google Scholar]
  35. Lopes, A.M.G. Implementation of the Hardy-Cross method for the solution of piping networks. Comput. Appl. Eng. Educ. 2004, 12, 117–125. [Google Scholar] [CrossRef] [Green Version]
  36. Elaoud, S.; Hafsi, Z.; Hadj-Taieb, L. Numerical modelling of hydrogen-natural gas mixtures flows in looped networks. J. Pet. Sci. Eng. 2017, 159, 532–541. [Google Scholar] [CrossRef]
  37. Bermúdez, J.-R.; López-Estrada, F.-R.; Besançon, G.; Valencia-Palomo, G.; Torres, L.; Hernández, H.-R. Modeling and simulation of a hydraulic network for leak diagnosis. Math. Comput. Appl. 2018, 23, 70. [Google Scholar] [CrossRef]
  38. Adedeji, K.B.; Hamam, Y.; Abe, B.T.; Abu-Mahfouz, A.M. Leakage detection and estimation algorithm for loss reduction in water piping networks. Water 2017, 9, 773. [Google Scholar] [CrossRef]
  39. Todini, E.; Rossman, L.A. Unified framework for deriving simultaneous equation algorithms for water distribution networks. J. Hydraul. Eng. 2012, 139, 511–526. [Google Scholar] [CrossRef]
  40. Ghazanfari, S.A.; Wahid, M.A. Heat transfer enhancement and pressure drop for fin-and-tube compact heat exchangers with delta winglet-type vortex generators. Facta Univ. Ser. Mech. Eng. 2018, 16, 233–247. [Google Scholar] [CrossRef]
  41. Brkić, D. Review of explicit approximations to the Colebrook relation for flow friction. J. Pet. Sci. Eng. 2011, 77, 34–48. [Google Scholar] [CrossRef] [Green Version]
  42. Brkić, D. Lambert W function in hydraulic problems. Math. Balk. 2012, 26, 285–292. Available online: http://www.math.bas.bg/infres/MathBalk/MB-26/MB-26-285-292.pdf (accessed on 29 March 2019).
  43. Brkić, D.; Ćojbašić, Ž. Evolutionary optimization of Colebrook’s turbulent flow friction approximations. Fluids 2017, 2, 15. [Google Scholar] [CrossRef]
  44. Praks, P.; Brkić, D. One-log call iterative solution of the Colebrook equation for flow friction based on Padé polynomials. Energies 2018, 11, 1825. [Google Scholar] [CrossRef]
  45. Brkić, D.; Praks, P. Accurate and Efficient Explicit Approximations of the Colebrook Flow Friction Equation Based on the Wright ω-Function. Mathematics 2019, 7, 34. [Google Scholar] [CrossRef]
  46. Brkić, D. Solution of the implicit Colebrook equation for flow friction using Excel. Spreadsheets Educ. 2017, 10, 4663. Available online: https://sie.scholasticahq.com/article/4663.pdf (accessed on 29 March 2019).
  47. Olivares Gallardo, A.P.; Guerra Rojas, R.A.; Alfaro Guerra, M.A. Evaluación experimental de la solución analítica exacta de la ecuación de Colebrook-White. Ing. Investig. Y Tecnol. 2019, 20, 1–11. (In Spanish) [Google Scholar] [CrossRef]
  48. Eaton, L.K. Hardy Cross: American Engineer; University of Illinois Press: Champaign, IL, USA, 2006. [Google Scholar]
  49. Eaton, L.K. Hardy Cross and the “Moment Distribution Method”. Nexus Netw. J. 2001, 3, 15–24. [Google Scholar] [CrossRef] [Green Version]
  50. Weingardt, R.G. Hardy Cross, A man ahead of his time. Struct. Mag. 2005, 3, 40–41. [Google Scholar]
  51. Weingardt, R.G. Hardy Cross and Albert A. Dorman. Leadersh. Manag. Eng. 2004, 4, 51–54. [Google Scholar] [CrossRef]
  52. Cross, H. Engineers and Ivory Towers; McGraw-Hill: New York, NY, USA, 1952. [Google Scholar]
  53. Volokh, K.Y. On foundations of the Hardy Cross method. Int. J. Solids Struct. 2002, 39, 4197–4200. [Google Scholar] [CrossRef]
  54. Baugh, J.; Liu, S. A general characterization of the Hardy Cross method as sequential and multiprocess algorithms. Structures 2016, 6, 170–181. [Google Scholar] [CrossRef]
  55. Zweig, C.M. Hardy Cross, The Tinkerer. Civ. + Struct. Eng. Mag. 2014. Available online: https://csengineermag.com/article/hardy-cross-the-tinkerer/ (accessed on 10 April 2019).
  56. Cross, H. Analysis of continuous frames by distributing fixed-end moments. Am. Soc. Civ. Eng. Trans. 1932, 96, 1793. [Google Scholar]
  57. Fresl, K.; Gidak, P.; Hak, S. Iz povijesti razvoja iteracijskih postupaka (From the history of development of iterative procedures). Građevinar 2010, 62, 959–970. Available online: https://hrcak.srce.hr/61473 (accessed on 10 April 2019). (In Serbian).
  58. Čališev, K. Izračunavanje višestruko statički neodređenih sistema pomoću postepenih aproksimacija. Teh. List Udruženja Jugosl. Inženjera Arhit. 1923, 5, 17–21. (In Serbian) [Google Scholar]
  59. Timošenko, S. History of Strength of Materials: With a Brief Account of the History of Theory of Elasticity and Theory of Structures; McGraw-Hill: New York, NY, USA, 1953; ISSN 0486611876. [Google Scholar]
  60. Samuelsson, A.; Zienkiewicz, O.C. History of the stiffness method. Int. J. Numer. Methods Eng. 2006, 67, 149–157. [Google Scholar] [CrossRef]
Figure 1. The network of pipes for natural gas distribution for domestic consumption.
Figure 1. The network of pipes for natural gas distribution for domestic consumption.
Applsci 09 02019 g001
Figure 2. Rules for the upper and lower sign (correction from the adjacent loop; second correction).
Figure 2. Rules for the upper and lower sign (correction from the adjacent loop; second correction).
Applsci 09 02019 g002
Figure 3. Rules for terms from Lobačev equations, which do not exist in the Hardy Cross method.
Figure 3. Rules for terms from Lobačev equations, which do not exist in the Hardy Cross method.
Applsci 09 02019 g003
Figure 4. Rules for terms from Lobačev equations, which do not exist in the Hardy Cross method applied for the network from Figure 1.
Figure 4. Rules for terms from Lobačev equations, which do not exist in the Hardy Cross method applied for the network from Figure 1.
Applsci 09 02019 g004
Figure 5. The number of required iterations for the solution using the original vs. the improved Hardy Cross method.
Figure 5. The number of required iterations for the solution using the original vs. the improved Hardy Cross method.
Applsci 09 02019 g005
Table 1. Procedure for the solution of the flow problem for the network from Figure 1 using the modified Hardy Cross method (first two iterations)—First iteration.
Table 1. Procedure for the solution of the flow problem for the network from Figure 1 using the modified Hardy Cross method (first two iterations)—First iteration.
Iteration 1
LoopPipea Q b f = p 1 2 p 2 2 c | f | d Δ Q 1 e Δ Q 2 f Q 1 = Q
I1−0.3342−144518566.8787025109.2−0.0994 −0.4336
7+0.7028+859927106.72226902866.0−0.0994 +0.6034
8+0.3056+306964191.01828124435.8−0.0994−0.0532 =+0.1530
9+0.2778+800657172.45245486154.8−0.0994−0.0338 =+0.1446
10−0.1364−241342976.13220265516.7−0.0994+0.0142 ‡−0.2217
12−0.0167−6238747.4679911398.4−0.0994+0.0651 ‡−0.0511
Σ f I = +1575448179.813987715480.9
II2−0.0026−80628.956440212.4−0.0651 −0.0677
11−0.1198−14582531.0221537615.9−0.0651+0.0142 ‡−0.1707
12+0.0167+6238747.4679911398.4−0.0651+0.0994 +0.0511
Σ f I I = −8424412.4957889226.7
III3−0.2338−406110098.13161336093.1−0.0142 −0.2480
4+0.0182+1530938.1153093808.5−0.0142 +0.0040
10+0.1364+241342976.13220265516.7−0.0142+0.0994 +0.2217
11+0.1198+14582531.0221537615.9−0.0142+0.0651 +0.1707
14−0.0278−21840183.81429824980.5−0.0142−0.0338 ± −0.0757
Σ f I I I = −170493836.78186058014.8
IV5+0.0460+7523646.2297674697.0+0.0338 +0.0798
9−0.2778−800657172.45245486154.8+0.0338+0.0994 ‡−0.1446
13+0.0278+21840183.81429824980.5+0.0338−0.0532 =+0.0084
14+0.0278+21840183.81429824980.5+0.0338+0.0142 +0.0757
Σ f I V = −749453158.78402810812.8
V6+0.0182+3479197.2347919720.0+0.0532 +0.0714
8−0.3056−306964191.01828124435.8+0.0532+0.0994 ‡−0.1530
13−0.0278−21840183.81429824980.5+0.0532−0.0338 ± −0.0084
Σ f V = −325325177.53605869136.3
Iteration 2
LoopPipe Q 1 = Q f = p 1 2 p 2 2 | f | Δ Q 1 Δ Q 2 Q 2 = Q
I1−0.4336−232172997.6974431560.7−0.0058 −0.4394
7+0.6034+651439280.61965036192.1−0.0058 +0.5976
8+0.1530+87112249.41036457217.8−0.0058−0.0178 =+0.1294
9+0.1446+243990034.43070921097.1−0.0058−0.0098 =+0.1290
10−0.2217−584137977.54795666298.0−0.0058+0.0018 ‡−0.2257
12−0.0511−47725420.61700518680.1−0.0058−2.1·10−5 ± −0.0569
Σ f I = +118505168.713543031045.9
II2−0.0677−30372941.9816962908.0+2.1·10−5 −0.0676
11−0.1707−27780459.9296182372.8+2.1·10−5+0.0018 ‡−0.1689
12+0.0511+47725420.61700518680.1+2.1·10−5+0.0058 +0.0569
Σ f I I = −10427981.22813663960.8
III3−0.2480−451970989.43317464222.8−0.0018−0.2497
4+0.0040+99061.244589235.4−0.0018+0.0023
10+0.2217+584137977.54795666298.0−0.0018+0.0058 +0.2257
11+0.1707+27780459.9296182372.8−0.0018−2.1·10−5 =+0.1689
14−0.0757−135261698.03251481942.9−0.0018−0.0098 ± −0.0873
Σ f I I I = +24784811.311705384072.0
IV5+0.0798+20483898.1467437803.0+0.0098 +0.0896
9−0.1446−243990034.43070921097.1+0.0098+0.0058 ‡−0.1290
13+0.0084+2454799.0534076127.2+0.0098−0.0178 =+0.0004
14+0.0757+135261698.03251481942.9+0.0098+0.0018 +0.0873
Σ f I V = −85789639.27323916970.2
V6+0.0714+41857166.91067095933.1+0.0178 +0.0892
8−0.1530−87112249.41036457217.8+0.0178+0.0058 ‡−0.1294
13−0.0084−2454799.0534076127.2+0.0178−0.0098 ± −0.0004
Σ f V = −47709881.52637629278.1
a Pipe lengths, diameters and initial flow distribution are shown in Table 2 and Figure 1; b f calculated using the Renouard Equation (1); c f calculated using the first derivative of the Renouard, Equation (2), where flow is variable; d calculated using the matrix Equation (10) and entering Δ Q with the opposite sign (using the original Hardy Cross method for Iteration 1: Δ Q I = +0.1126; Δ Q I I = −0.0088; Δ Q I I I = −0.0208; Δ Q I V = −0.0892; Δ Q V = −0.0902; using the Lobačev method for Iteration 1: Δ Q I = −0.1041; Δ Q I I = −0.0644; Δ Q I I I = −0.0780; Δ Q I V = +0.1069; Δ Q V = −0.1824); e   Δ Q 2 is Δ Q 1 from the adjacent loop; f the final calculated flow in the first iteration is used for the calculation in the second iteration, etc.; g if Q and Q 1 have a different sign, this means that the flow direction is opposite to that in the previous iteration, etc. (this occurs with the flow in pipe 13 between Iteration 3 and 4).
Table 2. Pipe diameters and lengths, flows, and velocities of gas within pipes.
Table 2. Pipe diameters and lengths, flows, and velocities of gas within pipes.
a Pipe NumberDiameter (m)Length (m)b Assumed Flows (m3/h)c Calculated Flows (m3/h)Gas Velocity (m/s)
10.3051127.81203.21583.61.5
20.203609.69.2245.20.5
30.203853.4841.6899.71.9
40.203335.365.67.50.01
50.203304.8165.6320.20.7
60.203762.065.6322.70.7
70.203243.82530.02149.64.6
80.203396.21100.0462.41.0
90.152304.81000.0465.01.8
100.152335.3491.2813.53.1
110.254304.8431.2609.10.8
120.152396.260.0204.80.8
130.152548.6100.0d−2.6−0.009
140.152548.6100.0312.71.2
a Network from Figure 1 (flows are for normal pressure conditions; real pressure in the network is 4 × 10 5 Pa abs, i.e., 3 × 10 5 Pa); b chosen to satisfy Kirchhoff’s first law for all nodes (dash arrows in Figure 1); c calculated to satisfy Kirchhoff’s first law for all nodes and Kirchhoff’s second law for all closed path formed by pipes (full errors in Figure 1); d the minus sign means that the direction of flow is opposite to the initial pattern for assumed flows.

Share and Cite

MDPI and ACS Style

Brkić, D.; Praks, P. Short Overview of Early Developments of the Hardy Cross Type Methods for Computation of Flow Distribution in Pipe Networks. Appl. Sci. 2019, 9, 2019. https://doi.org/10.3390/app9102019

AMA Style

Brkić D, Praks P. Short Overview of Early Developments of the Hardy Cross Type Methods for Computation of Flow Distribution in Pipe Networks. Applied Sciences. 2019; 9(10):2019. https://doi.org/10.3390/app9102019

Chicago/Turabian Style

Brkić, Dejan, and Pavel Praks. 2019. "Short Overview of Early Developments of the Hardy Cross Type Methods for Computation of Flow Distribution in Pipe Networks" Applied Sciences 9, no. 10: 2019. https://doi.org/10.3390/app9102019

APA Style

Brkić, D., & Praks, P. (2019). Short Overview of Early Developments of the Hardy Cross Type Methods for Computation of Flow Distribution in Pipe Networks. Applied Sciences, 9(10), 2019. https://doi.org/10.3390/app9102019

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop