Power System Load Flow Analysis

202 Pages·2005·5.089 MB·English

by  Lynn Powell

PowerS ystem
LoadF low
Analysis
1
This page intentionally left blank
PowerS ystem
LoadF low
Analysis
LynnP owell
McGraw-Hill
New York ChicagoS anF ranciscLoi sbonL ondon
MadridM exicCoi tyM ilanN ew DelhiS anJ uan
SeoulS ingaporSey dneyT oronto
111
The McGraw·Hll1 Compani�s
Copyrig©h 2t0 05b yT heM cGraw-HiClolm panieIsn,cA .l lr ighrtess ervEexdc.e pats p ermitted
undert heU niteSdt atCeosp yrigAhctto f1 976n,o p arotf th isp ublicamtaiyob ne r eproduocre d
distribiunat neydfo rm orb ya nym eanso,rs torienda d atabaosrre e triesvyaslt ewmi,t hothuet p rior
writtpeenr missoifto hne p ublisher.
ISBN9:7 8-0-07-178261-6
MHID:0 -07-178261-3
Them ateriinat lh iesB ooakl saop pearisn t hep rivnetr siooftn h itsi tIlSeB:N 9:7 8-0-07-144779-9,
MHID:0 -07-144779-2.
Allt rademaarrkets r ademaorfkt sh eriers pectoiwvnee rRsa.t hetrh apnu ta trademarsky mboalft er
everoyc curreonfac t er ademarnkaemde w,e u sen ameisn a ne ditorfaisahli oonn lya,n dt oth e benefit
oft het rademaorwnke rw,i tnho i ntentoifio nnfr ingemoefnt th etr ademarWkh.e rseu cdhe signations
appeairnt hibso okt,h ehya vbee epnr intweidth i nitciaapls .
McGraw-HielBlo okasr ea vailaabtls ep eciqaula ntidtiys coutnotu ss ea sp remiumasn ds ales
promotioonrfos r,u sei nc orportraatien ipnrgo graTmosc .o ntaac rte presentpalteiavese-e m auisla t
[email protected].
Informaticoonn tainiendt hiwso rkh asb eeno btainbeyd T heM cGraw-HiClolm panieIsn,c .
("McGraw-Hifrlolm" s)o urcbeesl ievteod bree liabHloew.e vern,e ithMecrG raw-Hinlolri ts
authogrusar anteteh ea ccuracoyr c ompletenoefas nsy i nformatipounb lishheedr eiannd neither
McGraw-Hniolril t asu thosrhsa blelr esponsfoirba lneye rroormsi,s sioonrds a,m ages aroiusotif nugs e
oft his informTahtiiwsoo nr.ki sp ubliswhietdh untdheer standtihnaMgtc Graw-Hainldli tasu thoarrse
supplying infobrumtaa rtein oonta ttempttiorn egn deenrg ineeroiron tgh eprr ofessiosnearlv icIefs .
sucshe rviacreers e quirtehdea, s sistoafna cnea pproprpiraotfees siosnhaolu lbdes ought.
TERMSO F USE
Thisi sa copyrighwtoerdk a ndT he McGraw-HiClolm paniesI,n c(." McGrawHilaln"di) t s
licensroersse ravlerl i ghitnsa ndt oth e workU.s eo ft hiwso rki ss ubjetcotht e set ermEsx.c epats
permitutnedde trh Ceo pyriAgchtto f1 976a ndt hreigthots toraen dr etrioenvece o poyf t hweo rky,o u
mayn otd ecompidlies,a ssemrbelvee,re sneg inereerp,r odumcoed,i fyc,r eadteer ivawtoirvkebs a sed
upont,r ansmdiits,tr ibudties,s eminsaetlepl,u, b liosrhs ublicethnes weo rko ra nyp arotf i tw ithout
McGraw-Hiplrli'ocsro nseYnotu.m ayu set hew orkfo r youorw nn oncommercainadpl e rsonuasle ;
anyo theurs eo ft hew orki ss tricptrloyh ibiYtoeudrr. i ghttou set hew orkm ayb et erminatiefyd o u
failt oc omplwyi tthh estee rms.
THE WORK IS PROVIDED" AS IS."Mc GRAW-HILLA ND ITSL ICENSORSM AKE NO
GUARANTEES OR WARRANTIES AS TO THE ACCURACY, ADEQUACY OR
COMPLETENESSO F OR RESULTS TO BE OBTAINED FROM USING THE WORK,
INCLUDINGA NY INFORMATIONT HAT CAN BE ACCESSEDT HROUGH THE WORK
VIA HYPERLINKO R OTHERWISE,A ND EXPRESSYL DISCLAIMA NY WARRANTY,
EXPRESSO R IMPLIEDI,N CLUDINGB UT NOT LIMITEDT O IMPLIEDW ARRANTIES OF
MERCHANTABILITOY R FITNESSF OR A PARTICULARP URPOSE.M cGraw-Hialnldi ts
licensdoor nso tw arraonrtg uarantteheat th efu nctiocnosn tainientd h ew orkw ilmle ety our
requiremoernt thsa itt osp eratwiiolnbl e u ninterruorpe trerdofr re e.N eithMecrG raw-Hinlolri ts
licenssohrasl ble liabtloey ouo ra nyoneel sfoer anyi naccuraecryr,oo rr o missiorne,g ard­
lesosf c ausien,t hew orko rfo r anyd amagerse sulttihnegr efroMmc.G raw-Hihlalsn or esponsi­
bilifotry t hec onteonfta nyi nformatiaocnc esstehdr outghhe w orkU.n denro c ircumstasnhcaelsl
McGraw-Hanid/lolr i tlsi censboelr isa bfolrea nyi ndirienccti,d enstpaelc,ip auln,i ticvoen,s equential
ors imildaarm agetsh arte sufrlotm thues eo fo ri nabitloiu tys et hew orke,v einf a nyo ft hemh asb een
advisoefdt hpeo ssibiolfsi utyc dha mageTsh.i lsi mitaotfiloina bislhiaatylp lp ltyoa nyc laiomrc ause
whatsoewvheert hseurc chl aiomrc ausaer isiencs o ntractto,ro tro therwise.
ToS andraf,o rh ers upport,
here ncouragemaenndt,a, b ovael lh,e rp atience
v
This page intentionally left blank
Contents
Prefacex i
Introductixoini i
Chapte1r. S ystemR epresentation 1
1.1I ntroduction 3
1.2T heP er-Unit System 4
1.3P er-UnTirta nsformReerp resentation 6
1.4P er-UnPiotw erS ystemR epresentation 8
Chapte2r. T heL oad-FlPorwo blem 13
2.1P hysicSatla temeonftt heP roblem 15
2.2M athematiSctaalt emeonftt heP roblem 16
2.3R epresentaotfiS oyns teEml ements 19
2.3.L1i neasn dc ables 19
2.3.G2e nerators 20
2.3.T3r ansformers 20
2.3.L4o ads 20
2.3.S5h unte lements 20
Chapte3r. R eferenScyes tem 21
3.1I ntroduction 23
3.2S ysteCmo nfiguration 23
3.3F ormulatoifoS ny stem Admittance Matrix 23
Chapte4r. J acobMie thod 29
4.1I ntroduction 29
4.2D evelopmeonftt heA lgorithm 29
4.3J acobMie thoSdo lutifoonrR eferenScyes tem 32
Chapte5r. G auss-SeiMdeetlh od 37
5.1I ntroduction 39
5.2D evelopmeonftt heA lgorithm 39
vii
viii Contents
5.3G auss-SeiSdoellu tifoonrR eferenScyes tem 41
5.4A cceleration 43
Chapte6r.Z -MatrMiext hods 47
6.1I ntroduction 49
6.2D evelopmeonftt heM ethod 49
6.3Z -MatrMiext hod: AlgofroirBt lhomc Sku bstitution 51
6.4Z -Matr(iBxl ocSku bstitution) fSoorlR uetfieorne nScyes tem 53
6.5Z -Matrix Method: AflogrFo orriwtahrSmdu bstitution 56
6.6Z -Matr(iFxo rwaSrudb stitutSioolnu)t ifoonrR eferenScyes tem 56
Chapte7r.N ewton-RaphMseotnh ods 63
f(x)
7.1S olutioofnE quatiyon= 65
7.2S olutioofnM ultivariNaobnllei neEaqru ations 66
7.3N ewton-Raphsoann dt heL oad-FlPorwo blem 68
Chapte8r.N ewton-RaphMseotnh oUds inCga rtesiCaono rdinates 71
8.1D evelopmeonftt heA lgorithm 73
8.2N ewton-Raphs(oCna rtesCioaonr dinates)
SolutifoonrR eferenScyes tem 76
Chapte9r.N ewton-RaphMseotnh oUds inPgo laCro ordinates 83
9.1D evelopmeonftt heA lgorithm 85
9.2N ewton-Raphs(oPno laCro ordinatSeosl)u tifoonrR eferenScyes tem 92
O.
Chapte1r FastD ecouplMeedt hod 97
10.1I ntroduction 99
10.2D ecoupleNde wton-RaphsMoent hod 101
10.3D evelopmeonftt heF astD ecoupleMde thod 101
10.4D evelopmeonftt heA lgorithm 104
10.5F astD ecoupled SolfuotrRi eofne renScyes tem 104
Chapte1r1 .D C LoadF low 111
11.1I ntroduction 113
11.2D evelopmeonftt heM ethod 114
11.3D evelopmeonftt heA lgorithm 116
11.4D C Load-FlSoowl utifoonrR eferenScyes tem 116
Chapte1r2 .V oltaCgoen tr(o1l): Generators 119
12.1I ntroduction 121
12.2P erformancoefa SynchronoMuasc hine 121
12.3G eneratRoerp resentaitnit ohneL oad-FlPorwo blem 125
12.4S olutifoonrR eferenScyes temI ncludian Gge neratBours bar 127
Contents ix
Chapt13e.rV oltaCgoen t(r2oO)ln: - LoTaadp -Changing
(OLTTCr)a nsformers 133
13.1I ntroduction 135
13.2D evelopmeonftT ransforEmqeuri valeCnitr cufiotrT apC hanging 136
13.3T ransformTeaprC hanginIgl:l ustrEaxtaimvpel e 139
13.4C hangeisn A dmittanMcaet riRxe sultifnrgo mT apC hanging 140
13.5 TapC hanginwgi thitnh eL oad-FloPwr ocess 143
13.6R eferenScyes temI ncludiOnLgT CT ransformers 145
137. Gauss-SeiSdoellu tifoonrM odifiReedf erenScyes tem 147
Chapt14e.rR esults Output 151
14.1I ntroduction 153
14.2O riginRaelf erenScyes tem 153
14.2.1B usbacro nditions 153
14.2.2L inef lows 155
14.3R eferenScyes temI ncludiGnegn erator 157
14.3.1B usbacro nditions 158
14.3.2L inef lows 158
14.4R eferenScyes temI ncludiOnLgT CT ransformers 159
14.4.1B usbacro nditions 159
14.4.2L inef lows 159
Chapt15e.rS olutDiioffni culties 161
15.1I ntroduction 163
15.2C ommon Considerations 163
15.2.C1 onditioning 163
15.2.2S parsity 164
15.2.3S toragoefm atriexl ements 165
15.2.4U seo fi mplicit functions 165
15.2.5O rdereedl iminatainodnm atriixn version 166
15.3S tarting Conditions 166
Appendix 169
References1 73
FurthReera ding 175
Index 177