### Refine

#### Departments, institutes and facilities

#### Document Type

- Conference Object (6)
- Article (2)
- Part of a Book (1)

#### Language

- English (9)

#### Has Fulltext

- no (9)

#### Keywords

- Non-linear systems (3)
- modeling of complex systems (3)
- applications (2)
- gas transport networks (2)
- globally convergent solvers (2)
- topological reduction (2)
- Application in electrochemistry (1)
- Applications in Energy Transport (1)
- Clean Energy and Power Systems (1)
- Complex Systems Modeling and Simulation (1)

The paper presents the topological reduction method applied to gas transport networks, using contraction of series, parallel and tree-like subgraphs. The contraction operations are implemented for pipe elements, described by quadratic friction law. This allows significant reduction of the graphs and acceleration of solution procedure for stationary network problems. The algorithm has been tested on several realistic network examples. The possible extensions of the method to different friction laws and other elements are discussed.

It is shown that the electrochemical kinetics of alkaline methanol oxidation can be reduced by setting certain fast reactions contained in it to a steady state. As a result, the underlying system of Ordinary Differential Equations (ODE) is transformed to a system of Differential-Algebraic Equations (DAE). We measure the precision characteristics of such transformation and discuss the consequences of the obtained model reduction.

Further development on globally convergent algorithms for solution of stationary network problems is presented. The algorithms make use of global non-degeneracy of Jacobi matrix of the system, composed of Kirchhoff's flow conservation conditions and transport element equations. This property is achieved under certain monotonicity conditions on element equations and guarantees an existence of a unique solution of the problem as well as convergence to this solution from an arbitrary starting point. In application to gas transport networks, these algorithms are supported by a proper modeling of gas compressors, based on individually calibrated physical characteristics. This paper extends the modeling of compressors by hierarchical methods of topological reduction, combining the working diagrams for parallel and sequential connections of compressors. Estimations are also made for application of topological reduction methods beyond the compressor stations in generic network problems. Efficiency of the methods is tested by numerical experiments on realistic networks.

The formulation of transport network problems is represented as a translation between two domain specific languages: from a network description language, used by network simulation community, to a problem description language, understood by generic non-linear solvers. A universal algorithm for this translation is developed, an estimation of its computational complexity given, and an efficient application of the algorithm demonstrated on a number of realistic examples. Typically, for a large gas transport network with about 10K elements the translation and solution of non-linear system together require less than 1 sec on the common hardware. The translation procedure incorporates several preprocessing filters, in particular, topological cleaning filters, which accelerate the solution procedure by factor 8.

Solving transport network problems can be complicated by non-linear effects. In the particular case of gas transport networks, the most complex non-linear elements are compressors and their drives. They are described by a system of equations, composed of a piecewise linear ‘free’ model for the control logic and a non-linear ‘advanced’ model for calibrated characteristics of the compressor. For all element equations, certain stability criteria must be fulfilled, providing the absence of folds in associated system mapping. In this paper, we consider a transformation (warping) of a system from the space of calibration parameters to the space of transport variables, satisfying these criteria. The algorithm drastically improves stability of the network solver. Numerous tests on realistic networks show that nearly 100% convergence rate of the solver is achieved with this approach.