A Study on the Analysis of Incompressible and Looped Flow Network Using Topological Constitutive Matrix Equation

위상구성행렬식을 이용한 비압축성 순환망 형태의 유로망 해석에 관한 연구

  • Yoo, Seong-Yeon (BK21 Mechatronics Group at Chungnam National University) ;
  • Kim, Bum-Shin (Power Generation Lab, Korea Power Research Institute)
  • 유성연 (충남대학교 BK21 메카트로닉스사업단) ;
  • 김범신 (한전전력연구원 수화력발전연구소)
  • Received : 2010.05.12
  • Published : 2010.08.10

Abstract

Topological matrix which reflects characteristics of network connectivity has been widely used in efficient solving for complicated flow network. Using topological matrix, one can easily define continuity at each node of flow network and make algorithm to automatically generate continuity equation of matrix form. In order to analyze flow network completely it is required to satisfy energy conservation in closed loops of flow network. Fundamental cycle retrieving algorithm based on graph theory automatically constructs energy conservation equation in closed loops. However, it is often accompanied by NP-complete problem. In addition, it always needs fundamental cycle retrieving procedure for every structural change of flow network. This paper proposes alternative mathematical method to analyze flow network without fundamental cycle retrieving algorithm. Consequently, the new mathematical method is expected to reduce solving time and prevent error occurrence by means of simplifying flow network analysis procedure.

Keywords

References

  1. WIKIPEDIA, http://en.wikipedia.org/wiki/Flow_ network.
  2. Hardy Cross, 1936, Analysis of flow in networks of conduits or conductors, University of Illinois bulletin, Vol. XXXIV No. 22.
  3. Don J. W. and Carl O. A. Charles, 1972, Hydraulic network analysis with linear theory, Journal of Hydraulic Division Proceedings of ASCE, pp. 1157-1170.
  4. Ma, Z., Jeter, S. M., and Abdel-Khalik, S. I., 2002, Flow network analysis application in fuel cells, Journal of Power Sources 4708, pp. 1-7.
  5. Kailash Jha, 2007, Automatic minimal loop extraction and initialization for water pipe network analysis, International Journal of Simulation, Vol. 8, No. 2, pp. 8-19.
  6. Stephen A. C., 1971, The complexity of theorem- proving procedures, In STOC '71 : Proceedings of the third annual ACM symposium on Theory of computing, pp. 151-158.
  7. Mohtar, R. H., Bralts, V. F., Shayya, and W. H., 1991, A finite element model for the analysis and optimization of pipe networks, ASAE, Vol. 34, No. 2, pp. 393-401.