A gradient algorithm for the analysis of pipe networks
Computer applications in water supply: vol. 1---systems analysis and simulation
Extended gradient method for fully non-linear head and flow analysis in pipe networks
Integrated computer applications in water supply (vol. 1)
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
A Parallel Direct/Iterative Solver Based on a Schur Complement Approach
CSE '08 Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering
Short communication: Topological clustering for water distribution systems analysis
Environmental Modelling & Software
Sensitivity analysis to assess the relative importance of pipes in water distribution networks
Mathematical and Computer Modelling: An International Journal
Environmental Modelling & Software
Position paper: Characterising performance of environmental models
Environmental Modelling & Software
Environmental Modelling & Software
Automatic generation of water distribution systems based on GIS data
Environmental Modelling & Software
Environmental Modelling & Software
Hi-index | 0.00 |
The Schur complement domain decomposition method is used for solution of large linear systems. The algorithm is based on the subdivision of the domain into smaller ones and the solution of those sub-domains independently. Regarding water distribution systems modeling, the hydraulic simulation could be formulated as a sequence of systems of linear equations. Therefore, this paper utilizes the domain decomposition method to accelerate the simulation process further. The method is evaluated using a large scale real-world system with 63,616 junctions and 64,200 pipes as case study. The case study shows that the methodology could improve the performance of hydraulic simulation app. by a factor of 8 without losing accuracy at a suitable level of domain decomposition. Although the optimal level of decomposition is case specific, considerable speedup might still be achievable by decomposing a large system into only a few subsystems.