000			03088nam a2200421 4500
005			20260817162344.0
008			120598 th eng
035			_a.b10081173
099		9	_aAIT Thesis no. WA-79-5
100	1		_aChu, Pao-chi
245	1	0	_aAnalysis of flow solutions in pipe networks
260			_aBangkok : _bAsian Institute of Technology, _c1980
300			_aix, 74 p.
490	1		_aThesis ; _vno. WA-79-5
500			_aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
502			_aThesis (M.Eng.) - Asian Institute of Technology, 1980
520			_aFour well-known numerical methods developed for solving flow in pipe networks namely: Hardy Cross, selected loop, accelerations factor and node iteration technique are analyzed together with a numerical method proposed in the present study. No direct literature has been made to describe clearly the feasibility and applicability of each method when used in solving flow in pipe networks of different sizes and hydraulic characteristics. The present study has contributed the knowledge on the numerical characteristic of each method through the comparison of results of six different pipe networks in terms of the number of iterations and computation time elapsed. It has been discovered that for a network with pipes of uniform or nearly uniform resistance, the acceleration factor method proves to be the best. While in the network in which the pipes have highly nonuniform resistances, the selected loop method shows its superiority above the others. The combination of the selected loop method and the acceleration factor method when applied to the network with highly nonuniform resistances can further reduce the computation time and consequently number of iterations involved.
650		0	_aWater-pipes
650		0	_aWater _xDistribution
700	0		_aTawatchai Tingsanchali, _eChairperson
700	1		_aGupta, Ashim Das, _eExamination Committee
700	1		_a Huynh Ngoc Phien, _eExamination Committee
710	2		_aRepublic of China, _eScholarship Donor
810	2		_aAsian Institute of Technology. _tThesis ; _vno. WA-79-5
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B22149
907			_a.b10081173 _bmnait _cs
902			_a250523
998			_b2 _c951012 _dm _ea _fs _g0
945			_lmnait
945			_lmnait
945			_lmnarc
942			_c20
942			_c40
909			_aBarcode : 30050003068276 _bCREATED : 1995-10-13 _cRECORD # : i10083029 _dLPATRON : 1024813 _eLCHKIN : 2014-07-25 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 0
909			_aBarcode : 30050003068268 _bCREATED : 1995-10-13 _cRECORD # : i10083030 _dLPATRON : 1015075 _eLCHKIN : 2003-03-12 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 1
909			_aBarcode : 30050160040308 _bCREATED : 2016-01-15 _cRECORD # : i12868012 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c4772 _d4772