
X
5
NUMtRlCAL
SIMLiLATION
OF
THI
FLOW
33
1
The main characteristics of some up-to date and
in
practice widely uscd programs
are listed
in
Table
8.5
-3
after Coacher
(1
969),
Goldwate:
c'r
ul.
(1
976)
and Tihanyi
(1980).
No mention is made in the Table of the General Electric's (USA) fairly
successful
GE Simulator program, since its characteristic data are not available.
This latter, similarly to CAP and ENSMP solves the differential equations
by
the
implicit method, whereas PIPETRAN and SATAN use the explicit method. As
a
matter of fact SATAN is the combinaiion
of
CAP and PIPETRAN. The three-
stage operation provides the program with high flexibility (see later).
For solving the basic equations the PAN algorithm uses the Crank-Nicholson
method. The program was tested partly by results obtained by the CAP method,
and partly by data telemechanically measured
in
a gas transmission network. The
correspondence was sufficiently good
in
both
of
the cases.
For solving the
differential equations the TGFS program uses a hybrid method that combines the
speed of the explicit and the stability of the implicit methods. Its principle is that at
each
At
time-step for the determination of the change in pressure at the nodes
it
calculates explicit and implicit steps respectively according to a previously defined
order. For an example as to the structure of a program simulating a complex gas
transmission system, let
us
consider that of SATAN.
The program consists of three main units, which may be run separately
if
so
desired.
-
Phase
1.
Calculation of the steady state. Quite often,
it
is necessary to
compare only the steady-state operation of various system configurations,
or
to
furnish initial conditions for the transient calculation.
In
that case, running this
program separately, one may examine up
to
I0
variants
in
succession.
At
the end of
each run, in addition to the printout of the desired results, all data required for the
transient calculation except the boundary conditions are stored
in
the background
memory from where
it
may be called in as and when required.
-
Phase
2.
This is the
connecting phase in which the transient model is built up step by step out
of
the
results of one
or
more variants of the previous phase, judged to be the most
interesting, and out of the boundary conditions fed into the machine. The results are
once more relegated to the background memory. Up to ten dynamic-model variants
may be stored also in this case.
-
Phase
3.
Transient analysis. The computer calls
in
the intermediate results, calculated in the foregoing phases, of one
or
several
preferred variants, and calculates the transient flow rates and pressures.
The block diagram of the program is given after Coacher in
Fig.
8.5-2. The
program structure is such that routines providing higher accuracy,
or
a faster
solution,
or
a more economical use of storage space can be introduced into the
program without changing its structure, merely by exchanging certain segments.
(d)
Programs solvable by simulation
In
the prefatory parts of the Sections
8.3
and
8.4
the application fields of the
steady state and transient flow simulation were discussed in general. The speediness
of the computerized design makes
it
possible that the programs, already known,
could be used for solving an ever increasing number of different problems. The next