Refine
Departments, institutes and facilities
Document Type
- Article (2)
- Conference Object (1)
Language
- English (3)
Has Fulltext
- no (3)
Keywords
- globally convergent solvers (3) (remove)
The general method of topological reduction for the network problems is presented on example of gas transport networks. The method is based on a contraction of series, parallel and tree-like subgraphs for the element equations of quadratic, power law and general monotone dependencies. The method allows to reduce significantly the complexity of the graph and to accelerate the solution procedure for stationary network problems. The method has been tested on a large set of realistic network scenarios. Possible extensions of the method have been described, including triangulated element equations, continuation of the equations at infinity, providing uniqueness of solution, a choice of Newtonian stabilizer for nearly degenerated systems. The method is applicable for various sectors in the field of energetics, including gas networks, water networks, electric networks, as well as for coupling of different sectors.
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 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.