2014
DOI: 10.1061/(asce)hy.1943-7900.0000849
|View full text |Cite
|
Sign up to set email alerts
|

Parameter Identification in Pipeline Networks: Transient-Based Expectation-Maximization Approach for Systems Containing Unknown Boundary Conditions

Abstract: The simulation of hydraulic transients within fluid line networks is important for many ap-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
6
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 16 publications
(2 reference statements)
0
6
0
Order By: Relevance
“…Figure 1 shows the graph of a general tree network. To clearly describe the network components and properties, a tree network is represented by a connected graph T(V, E) (Che et al, 2022;Zecchin et al, 2014), which includes the node set (i.e., all vertexes) V = {(v 1 ), (v 2 ), …, (v N )} and the pipe set (i.e., all edges) E = {[e 1 ], [e 2 ], …, [e P ]}, where v n = ID number of the nth node in V and e p = ID number of the pth pipe in E. Node set V can be further classified according to the direct connectivity of a node with boundaries (e.g., reservoirs, valves, and dead ends) -that is internal node set V in , where different pipe ends meet, and external node set V ex , where a pipe connects to a boundary, such that V = V in ∪ V ex , where ∪ = union operator (Karney & McInnis, 1992). An external node links only one pipe, whereas an internal node connects at least two pipes.…”
Section: Nomenclature Of Tree Networkmentioning
confidence: 99%
“…Figure 1 shows the graph of a general tree network. To clearly describe the network components and properties, a tree network is represented by a connected graph T(V, E) (Che et al, 2022;Zecchin et al, 2014), which includes the node set (i.e., all vertexes) V = {(v 1 ), (v 2 ), …, (v N )} and the pipe set (i.e., all edges) E = {[e 1 ], [e 2 ], …, [e P ]}, where v n = ID number of the nth node in V and e p = ID number of the pth pipe in E. Node set V can be further classified according to the direct connectivity of a node with boundaries (e.g., reservoirs, valves, and dead ends) -that is internal node set V in , where different pipe ends meet, and external node set V ex , where a pipe connects to a boundary, such that V = V in ∪ V ex , where ∪ = union operator (Karney & McInnis, 1992). An external node links only one pipe, whereas an internal node connects at least two pipes.…”
Section: Nomenclature Of Tree Networkmentioning
confidence: 99%
“…The network admittance matrix method (NAMM) proposed by Zecchin, Simpson, Lambert, White, and Vitkovsky (2009) is a frequency-domain model that organizes the transient governing equations for each link of a network in a laplacian matrix form. Its elegant structure makes this model appealing for the analysis of the response of complex systems to transients and for their diagnosis (Zecchin, Lambert, Simpson, and White, 2014).…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, the use of fluid transients has been extended to non-invasively assess the condition of the pipe wall. Zecchin et al 33,34 studied general pipeline parameter identification using fluid transient waves but only limited to numerical analysis. Stephens et al 35,36 were the first to apply the inverse transient analysis (ITA) to detect degradation of the pipe wall in a mild steel cement mortar–lined (MSCL) pipeline.…”
Section: Introductionmentioning
confidence: 99%