Matrix methods for pipe network analysis: Observations on partitioning and cut methods

O. Houache, L. Khezzar, M. H. Benhamza

Research output: Contribution to journalArticle

Abstract

The paper reviews the application of diakoptics and graph theory in the analysis of compressible flow in complex pipe network systems. A new method for partitioning the network based on alternative methods of cutting branches leads to an extension of the diakoptics theory which results, in practical terms, in a more computationally efficient solution for the simulation of pipe flows. An algorithm for re-referencing nodes and branches results in regular sparse matrices that are easily obtained from a branch-node connection list. The resulting matrices contain only non-zero elements. The computational advantages of the new cut method have been demonstrated by comparing them to other cut methods when applied to a range of pipe network simulation examples.

Original languageEnglish
Pages (from-to)321-328
Number of pages8
JournalChemical Engineering Research and Design
Volume74
Issue number3
Publication statusPublished - 1996

Fingerprint

Electric network topology
Electric network analysis
Pipe
Compressible flow
Graph theory
Pipe flow

Keywords

  • Cut methods
  • Diakoptics
  • Networks
  • Pipes

ASJC Scopus subject areas

  • Polymers and Plastics

Cite this

Matrix methods for pipe network analysis : Observations on partitioning and cut methods. / Houache, O.; Khezzar, L.; Benhamza, M. H.

In: Chemical Engineering Research and Design, Vol. 74, No. 3, 1996, p. 321-328.

Research output: Contribution to journalArticle

@article{5bbaed317e174f85be30e89e6d573aaa,
title = "Matrix methods for pipe network analysis: Observations on partitioning and cut methods",
abstract = "The paper reviews the application of diakoptics and graph theory in the analysis of compressible flow in complex pipe network systems. A new method for partitioning the network based on alternative methods of cutting branches leads to an extension of the diakoptics theory which results, in practical terms, in a more computationally efficient solution for the simulation of pipe flows. An algorithm for re-referencing nodes and branches results in regular sparse matrices that are easily obtained from a branch-node connection list. The resulting matrices contain only non-zero elements. The computational advantages of the new cut method have been demonstrated by comparing them to other cut methods when applied to a range of pipe network simulation examples.",
keywords = "Cut methods, Diakoptics, Networks, Pipes",
author = "O. Houache and L. Khezzar and Benhamza, {M. H.}",
year = "1996",
language = "English",
volume = "74",
pages = "321--328",
journal = "Chemical Engineering Research and Design",
issn = "0263-8762",
publisher = "Institution of Chemical Engineers",
number = "3",

}

TY - JOUR

T1 - Matrix methods for pipe network analysis

T2 - Observations on partitioning and cut methods

AU - Houache, O.

AU - Khezzar, L.

AU - Benhamza, M. H.

PY - 1996

Y1 - 1996

N2 - The paper reviews the application of diakoptics and graph theory in the analysis of compressible flow in complex pipe network systems. A new method for partitioning the network based on alternative methods of cutting branches leads to an extension of the diakoptics theory which results, in practical terms, in a more computationally efficient solution for the simulation of pipe flows. An algorithm for re-referencing nodes and branches results in regular sparse matrices that are easily obtained from a branch-node connection list. The resulting matrices contain only non-zero elements. The computational advantages of the new cut method have been demonstrated by comparing them to other cut methods when applied to a range of pipe network simulation examples.

AB - The paper reviews the application of diakoptics and graph theory in the analysis of compressible flow in complex pipe network systems. A new method for partitioning the network based on alternative methods of cutting branches leads to an extension of the diakoptics theory which results, in practical terms, in a more computationally efficient solution for the simulation of pipe flows. An algorithm for re-referencing nodes and branches results in regular sparse matrices that are easily obtained from a branch-node connection list. The resulting matrices contain only non-zero elements. The computational advantages of the new cut method have been demonstrated by comparing them to other cut methods when applied to a range of pipe network simulation examples.

KW - Cut methods

KW - Diakoptics

KW - Networks

KW - Pipes

UR - http://www.scopus.com/inward/record.url?scp=0030125124&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030125124&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030125124

VL - 74

SP - 321

EP - 328

JO - Chemical Engineering Research and Design

JF - Chemical Engineering Research and Design

SN - 0263-8762

IS - 3

ER -