Masader Book 1 Page 1 49

ELECTRICAL POWER SYSTEM ANALYSIS

ABOUT THE BOOK
THIRD EDITION
Comprehensive treatment.
Copyright © 2011. Laxmi Publications Pvt Ltd. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses
 Detailed graph theory and application to power system.
 Detailed discussion of estimation of load flow methods with flowcharts and
algorithms.
 Indepth treatment of Z Bus formation, with and without mutual coupling.
 Detailed discussion of symmetrical and unsymmetrical fault analysis.
 Each concept is explained with ample solved numerical problems.

 Short questions & answers and also objective type questions are provided to help the
readers for self analyzing their conceptual understanding.
ABOUT THE AUTHORS

Dr. S. Sivanagaraju, is graduated in 1998, Masters in 2000 from IIT, Kharagpur and did
his Ph.D from J.N.T. University in 2004. Working as Associate Professor in the
ELECTRICAL
Department of Electrical Engineering, University College of Engg. (Autonomous),
Kakinada, Andhra Pradesh since November 2006. He has received two National awards
(Pandit Madan Mohan Malaviya memorial prize award and Best Paper Prize award) from
POWER SYSTEM
the Institute of Engineers (India) for the year 2003–2004. He is Referee for IEE
Proceedings - Generation Transmission and Distribution and International Journal of
Emerging Electric Power System. About 75 publications in National and International
Journals and Conferences to his credit. His areas of interest are in Power Systems,
ANALYSIS
Distribution Automation, Genetic Algorithm applications to distribution systems and power
system.
B.V. Rami Reddy, is graduated in 1999, Masters in 2004 and doing his Ph.D in J.N.T.
University. His areas of interest are power system, distribution system and electrical
machines. Two papers published in National and International Conferences. Presently, he
is working as Associate Professor in the Department of Electrical Engg., Sri Kottam
permitted under U.S. or applicable copyright law.

Thulasi Reddy Memorial College of Engg., Kurnool, Andhra Pradesh.
ISBN: 978-93-80386-91-1
9789380386911- 0625
M.R.P. ` 625.00
An ISO 9001:2015 Company UEP-9514-625-ELEC POWER SYS ANALYSIS-SIV
EBSCO Publishing : eBook Academic Collection (EBSCOhost) - printed on 11/3/2019 2:12 AM via THE RESEARCH COUNCIL
AN: 2228663 ; Sivanagaraju, S., Reddy, Rami B. V..; Electrical Power System Analysis
Account: ns240708
Copyright © 2011. Laxmi Publications Pvt Ltd. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S. or applicable
copyright law.
Account: ns240708
Electrical Power System Analysis

copyright law.
Account: ns240708
copyright law.
Account: ns240708
Electrical Power
System Analysis
By
D
DRR
DR. S SIVANAGARAJU
R. S. S VANAGA
SIVANAGARA
G RAJU
U B V R
B.V.
.V. AMI REDDY
RAMI Y
M.Tech., (Ph.D.) M.Tech., (Ph.D.)
Assistant Professor Associate Professor
Department of Electrical Engineering Department of Electrical Engineering
J.N.T.U. College of Engineering Sri Kottam Thulasi Reddy Memorial
Anantapur, Andhra Pradesh College of Engineering
Mahaboob Nagar, Andhra Pradesh
UNIVERSITY SCIENCE PRESS

(An Imprint of Laxmi Publications Pvt. Ltd.)
An ISO 9001:20ϭϱ Company
BENGALURU Ɣ CHENNAI Ɣ GUWAHATI Ɣ HYDERABAD Ɣ JALANDHAR
KOCHI Ɣ KOLKATA Ɣ LUCKNOW Ɣ MUMBAI Ɣ RANCHI Ɣ NEW DELHI
BOSTON (USA) Ɣ NAIROBI (KENYA)
copyright law.
Account: ns240708
Copyright © 2011. Laxmi Publications Pvt Ltd. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S.
ΞďǇ>ĂǆŵŝWƵďůŝĐĂƟŽŶƐ;WͿ>ƚĚ͘
ůů ƌŝŐŚƚƐ ƌĞƐĞƌǀĞĚ ŝŶĐůƵĚŝŶŐ ƚŚŽƐĞ ŽĨ ƚƌĂŶƐůĂƟŽŶ ŝŶƚŽ ŽƚŚĞƌ ůĂŶŐƵĂŐĞƐ͘ /Ŷ ĂĐĐŽƌĚĂŶĐĞ ǁŝƚŚ ƚŚĞ ŽƉǇƌŝŐŚƚ ;ŵĞŶĚŵĞŶƚͿ Đƚ͕ ϮϬϭϮ͕
ŶŽƉĂƌƚŽĨƚŚŝƐƉƵďůŝĐĂƟŽŶŵĂǇďĞƌĞƉƌŽĚƵĐĞĚ͕ƐƚŽƌĞĚŝŶĂƌĞƚƌŝĞǀĂůƐǇƐƚĞŵ͕ŽƌƚƌĂŶƐŵŝƩĞĚŝŶĂŶǇĨŽƌŵŽƌďǇĂŶǇŵĞĂŶƐ͕ĞůĞĐƚƌŽŶŝĐ͕
ŵĞĐŚĂŶŝĐĂů͕ƉŚŽƚŽĐŽƉǇŝŶŐ͕ƌĞĐŽƌĚŝŶŐŽƌŽƚŚĞƌǁŝƐĞ͘ŶǇƐƵĐŚĂĐƚŽƌƐĐĂŶŶŝŶŐ͕ƵƉůŽĂĚŝŶŐ͕ĂŶĚŽƌĞůĞĐƚƌŽŶŝĐƐŚĂƌŝŶŐŽĨĂŶǇƉĂƌƚŽĨƚŚŝƐ
ďŽŽŬǁŝƚŚŽƵƚƚŚĞƉĞƌŵŝƐƐŝŽŶŽĨƚŚĞƉƵďůŝƐŚĞƌĐŽŶƐƟƚƵƚĞƐƵŶůĂǁĨƵůƉŝƌĂĐǇĂŶĚƚŚĞŌŽĨƚŚĞĐŽƉǇƌŝŐŚƚŚŽůĚĞƌ͛ƐŝŶƚĞůůĞĐƚƵĂůƉƌŽƉĞƌƚǇ͘/Ĩ
ǇŽƵǁŽƵůĚůŝŬĞƚŽƵƐĞŵĂƚĞƌŝĂůĨƌŽŵƚŚĞďŽŽŬ;ŽƚŚĞƌƚŚĂŶĨŽƌƌĞǀŝĞǁƉƵƌƉŽƐĞƐͿ͕ƉƌŝŽƌǁƌŝƩĞŶƉĞƌŵŝƐƐŝŽŶŵƵƐƚďĞŽďƚĂŝŶĞĚĨƌŽŵƚŚĞ
ƉƵďůŝƐŚĞƌƐ͘
WƌŝŶƚĞĚĂŶĚďŽƵŶĚŝŶ/ŶĚŝĂ
Typeset att ^ŚƵďŚĂŵŽŵƉŽƐĞƌ͕ĞůŚŝ
&ŝƌƐƚĚŝƟŽŶ͗ϮϬϬϳ͖ZĞƉƌŝŶƚ͗ϮϬϬϵ͖^ĞĐŽŶĚĚŝƟŽŶ͗ϮϬϭϬ͕Third ĚŝƟŽŶ͗ϮϬϭ9
ISBN ͗ϵϳϴͲϵϯͲϴϬϯϴϲͲϵϭͲϭ
Limits of Liability/Disclaimer of Warranty: dŚĞƉƵďůŝƐŚĞƌĂŶĚƚŚĞĂƵƚŚŽƌŵĂŬĞŶŽƌĞƉƌĞƐĞŶƚĂƟŽŶŽƌǁĂƌƌĂŶƟĞƐǁŝƚŚƌĞƐƉĞĐƚƚŽƚŚĞ

ĂĐĐƵƌĂĐǇŽƌĐŽŵƉůĞƚĞŶĞƐƐŽĨƚŚĞĐŽŶƚĞŶƚƐŽĨƚŚŝƐǁŽƌŬĂŶĚƐƉĞĐŝĮĐĂůůǇĚŝƐĐůĂŝŵĂůůǁĂƌƌĂŶƟĞƐ͘dŚĞĂĚǀŝĐĞ͕ƐƚƌĂƚĞŐŝĞƐ͕ĂŶĚĂĐƟǀŝƟĞƐ
ĐŽŶƚĂŝŶĞĚŚĞƌĞŝŶŵĂǇŶŽƚďĞƐƵŝƚĂďůĞĨŽƌĞǀĞƌǇƐŝƚƵĂƟŽŶ͘/ŶƉĞƌĨŽƌŵŝŶŐĂĐƟǀŝƟĞƐĂĚƵůƚƐƵƉĞƌǀŝƐŝŽŶŵƵƐƚďĞƐŽƵŐŚƚ͘>ŝŬĞǁŝƐĞ͕ĐŽŵŵŽŶ
ƐĞŶƐĞĂŶĚĐĂƌĞĂƌĞĞƐƐĞŶƟĂůƚŽƚŚĞĐŽŶĚƵĐƚŽĨĂŶǇĂŶĚĂůůĂĐƟǀŝƟĞƐ͕ǁŚĞƚŚĞƌĚĞƐĐƌŝďĞĚŝŶƚŚŝƐďŽŽŬŽƌŽƚŚĞƌǁŝƐĞ͘EĞŝƚŚĞƌƚŚĞƉƵďůŝƐŚĞƌ
ŶŽƌƚŚĞĂƵƚŚŽƌƐŚĂůůďĞůŝĂďůĞŽƌĂƐƐƵŵĞƐĂŶǇƌĞƐƉŽŶƐŝďŝůŝƚǇĨŽƌĂŶǇŝŶũƵƌŝĞƐŽƌĚĂŵĂŐĞƐĂƌŝƐŝŶŐŚĞƌĞĨƌŽŵ͘dŚĞĨĂĐƚƚŚĂƚĂŶŽƌŐĂŶŝǌĂƟŽŶ
ŽƌtĞďƐŝƚĞŝĨƌĞĨĞƌƌĞĚƚŽŝŶƚŚŝƐǁŽƌŬĂƐĂĐŝƚĂƟŽŶĂŶĚͬŽƌĂƉŽƚĞŶƟĂůƐŽƵƌĐĞŽĨĨƵƌƚŚĞƌŝŶĨŽƌŵĂƟŽŶĚŽĞƐŶŽƚŵĞĂŶƚŚĂƚƚŚĞĂƵƚŚŽƌŽƌ
ƚŚĞƉƵďůŝƐŚĞƌĞŶĚŽƌƐĞƐƚŚĞŝŶĨŽƌŵĂƟŽŶƚŚĞŽƌŐĂŶŝǌĂƟŽŶŽƌtĞďƐŝƚĞŵĂǇƉƌŽǀŝĚĞŽƌƌĞĐŽŵŵĞŶĚĂƟŽŶƐŝƚŵĂǇŵĂŬĞ͘&ƵƌƚŚĞƌ͕ƌĞĂĚĞƌƐ
ŵƵƐƚďĞĂǁĂƌĞƚŚĂƚƚŚĞ/ŶƚĞƌŶĞƚtĞďƐŝƚĞƐůŝƐƚĞĚŝŶƚŚŝƐǁŽƌŬŵĂǇŚĂǀĞĐŚĂŶŐĞĚŽƌĚŝƐĂƉƉĞĂƌĞĚďĞƚǁĞĞŶǁŚĞŶƚŚŝƐǁŽƌŬǁĂƐǁƌŝƩĞŶ
ĂŶĚǁŚĞŶŝƚŝƐƌĞĂĚ͘
ůů ƚƌĂĚĞŵĂƌŬƐ͕ ůŽŐŽƐ Žƌ ĂŶǇ ŽƚŚĞƌ ŵĂƌŬ ƐƵĐŚ ĂƐ sŝďŐǇŽƌ͕ h^W͕ ŵĂŶĚĂ͕ 'ŽůĚĞŶ ĞůůƐ͕ &ŝƌĞǁĂůů DĞĚŝĂ͕ DĞƌĐƵƌǇ͕ dƌŝŶŝƚǇ͕ >Ăǆŵŝ
ĂƉƉĞĂƌŝŶŐ ŝŶ ƚŚŝƐ ǁŽƌŬ ĂƌĞ ƚƌĂĚĞŵĂƌŬƐ ĂŶĚ ŝŶƚĞůůĞĐƚƵĂů ƉƌŽƉĞƌƚǇ ŽǁŶĞĚ ďǇ Žƌ ůŝĐĞŶƐĞĚ ƚŽ >Ăǆŵŝ WƵďůŝĐĂƟŽŶƐ͕ ŝƚƐ ƐƵďƐŝĚŝĂƌŝĞƐ Žƌ
ĂĨĮůŝĂƚĞƐ͘EŽƚǁŝƚŚƐƚĂŶĚŝŶŐƚŚŝƐĚŝƐĐůĂŝŵĞƌ͕ĂůůŽƚŚĞƌŶĂŵĞƐĂŶĚŵĂƌŬƐŵĞŶƟŽŶĞĚŝŶƚŚŝƐǁŽƌŬĂƌĞƚŚĞƚƌĂĚĞŶĂŵĞƐ͕ƚƌĂĚĞŵĂƌŬƐŽƌ
ƐĞƌǀŝĐĞŵĂƌŬƐŽĨƚŚĞŝƌƌĞƐƉĞĐƟǀĞŽǁŶĞƌƐ͘
& ĞŶŐĂůƵƌƵ ϬϴϬͲϮϲϳϱϲϵϯϬ

& ŚĞŶŶĂŝ ϬϰϰͲϮϰϯϰϰϳϮϲ͕ ϮϰϯϱϵϱϬϳ
& 'ƵǁĂŚĂƟ ϬϯϲϭͲϮϱϰϯϲϲϵ͕ Ϯϱϭϯϴϴϭ
& ,ǇĚĞƌĂďĂĚ ϬϰϬͲϮϳϱϱϱϯϴϯ͕ Ϯϳϱϱϱϯϵϯ
Branches
& :ĂůĂŶĚŚĂƌ ϬϭϴϭͲϮϮϮϭϮϳϮ

& <ŽĐŚŝ ϬϰϴϰͲϮϯϳϳϬϬϰ͕ ϰϬϱϭϯϬϯ
& <ŽůŬĂƚĂ ϬϯϯͲϮϮϮϳϰϯϴϰ
& >ƵĐŬŶŽǁ ϬϱϮϮͲϮϮϬϵϵϭϲ
& DƵŵďĂŝ ϬϮϮͲϮϰϵϯϭϮϲϭ
PUBLISHED IN INDIA BY & ZĂŶĐŚŝ ϬϲϱϭͲϮϮϬϰϰϲϰ
UNIVERSITY SCIENCE PRESS

(An Imprint of Laxmi Publications Pvt.Ltd.)
Ŷ/^KϵϬϬϭ͗ϮϬϭϱŽŵƉĂŶǇ
or applicable copyright law.
ϭϭϯ͕'K>E,Kh^͕Zz'E:͕
Et>,/ͲϭϭϬϬϬϮ͕/E/
dĞůĞƉŚŽŶĞ͗ϵϭͲϭϭͲϰϯϱϯϮϱϬϬ͕ϰϯϱϯϮϱϬϭ
&Ăǆ͗ϵϭͲϭϭͲϮϯϮϱϮϱϳϮ͕ϰϯϱϯϮϱϮϴ C—
ǁǁǁ͘ůĂǆŵŝƉƵďůŝĐĂƟŽŶƐ͘ĐŽŵ ŝŶĨŽΛůĂǆŵŝƉƵďůŝĐĂƟŽŶƐ͘ĐŽŵ Printed at:
Account: ns240708
Contents
CHAPTER 1 : Power System Network Matrices ... 1

,QWURGXFWLRQ
'HILQLWLRQV
7\SHV RI ,QFLGHQFH 0DWULFHV
&RQVWUXFWLRQ RI 1HWZRUN 0DWULFHV
1HWZRUN 0DWULFHV
&RQVWUXFWLRQRI3ULPLWLYH1HWZRUN(OHPHQW
1HWZRUN0DWUL[)RUPDWLRQ
6LQJXODU 7UDQVIRUPDWLRQ 0HWKRG
1RQ6LQJXODU 7UDQVIRUPDWLRQ 0HWKRG
'LUHFW ,QVSHFWLRQ 0HWKRG IRU 'HWHUPLQDWLRQ RI µ<%XV¶
'LUHFW ,QVSHFWLRQ 0HWKRG IRU 'HWHUPLQDWLRQ RI µ=/RRS¶
CHAPTER 2 : Load Flow Studies ... 66

,QWURGXFWLRQ
1HFHVVLW\ RI /RDG )ORZ 6WXGLHV
'DWDIRU/RDG)ORZ6WXGLHV
6WDWLF /RDG )ORZ (TXDWLRQV
*DXVV 6HLGHO 0HWKRG
1HZWRQ5DSKVRQ¶V 0HWKRG
'HFRXSOHG /RDG )ORZ 0HWKRG
)DVW 'HFRXSOHG /RDG )ORZ 0HWKRG
&RPSDULVRQ RI *DXVV6HLGHO DQG 1HZWRQ5DSKVRQ¶V 0HWKRG
&RPSDULVRQ RI 'HFRXSOHG 0HWKRG DQG )DVW 'HFRXSOHG 0HWKRG ZLWK 15 0HWKRG
&DOFXODWLRQRI/LQH)ORZV
'HULYDWLRQRI'&3RZHU)ORZ
CHAPTER 3 : Per Unit System ... 138

,QWURGXFWLRQ
2QH/LQH'LDJUDPV
3HU 8QLW 4XDQWLWLHV
6HOHFWLRQ RI %DVH9DOXHV
CHAPTER 4 : Symmetrical Components ... 165

,QWURGXFWLRQ
3KDVH 6HTXHQFH
6\PPHWULFDO &RPSRQHQWV RI DQ 8QEDODQFHG 7KUHH 3KDVH 6\VWHP
2SHUDWRU µD¶
v
copyright law.
Account: ns240708
vi Contents
5HSUHVHQWDWLRQ DQG 5HODWLRQVKLS EHWZHHQ 3KDVRUV

3RZHU LQ 6\PPHWULFDO &RPSRQHQWV
6HTXHQFH ,PSHGDQFHV RI /LQHV
6HTXHQFH ,PSHGDQFHV DQG 1HWZRUNV RI D 6\QFKURQRXV *HQHUDWRU
=HUR 6HTXHQFH ,PSHGDQFH DQG 1HWZRUN
CHAPTER 5 : Building of Network Matrices ... 194

,QWURGXFWLRQ
%XV ,PSHGDQFH 0DWUL[
$OJRULWKP IRU =%XVV )RUPXODWLRQ
0XWXDOO\ &RXSOHG %UDQFKHV LQ =%XV
5HPRYDORI(OHPHQWV
7KUHH3KDVH 1HWZRUNV
6WDWLRQDU\ (OHPHQWV
5RWDWLQJ (OHPHQWV
7KUHH3KDVH %DODQFHG 1HWZRUN (OHPHQWV
7UDQVIRUPDWLRQ 0DWULFHV LQ 6\PPHWULFDO &RPSRQHQW )RUP
$OJRULWKP IRU 7KUHHSKDVH %XV ,PSHGDQFH 0DWUL[
CHAPTER 6 : Symmetrical Fault Analysis ... 254

,QWURGXFWLRQ
6\PPHWULFDO )DXOWV RQ 3KDVH 6\VWHP
7UDQVLHQWV 'XH WR 6KRUW &LUFXLW LQ 7UDQVPLVVLRQ /LQH
7UDQVLHQW 'XH WR 6KRUW &LUFXLW LQ 3KDVH$OWHUQDWRU
&XUUHQW:DYH )RUP RI WKH$OWHUQDWRU XQGHU 6KRUW &LUFXLW &RQGLWLRQ
/LPLWDWLRQV WR )DXOW &XUUHQW
3HUFHQWDJH 5HDFWDQFH
3HUFHQWDJH 5HDFWDQFH DQG %DVH N9$
6KRUW&LUFXLW09$
,QILQLWH %XV
6WHSV)ROORZHG IRU6\PPHWULFDO)DXOW&DOFXODWLRQV
6HOHFWLRQRI&LUFXLW%UHDNHUV
5HDFWRUV
6\PPHWULFDO)DXOW$QDO\VLV8VLQJ%XV ,PSHGDQFH 0DWUL[
CHAPTER 7 : Unsymmetrical Fault Analysis ... 297

,QWURGXFWLRQ
6HTXHQFH 9ROWDJHV RI D *HQHUDWRU
9ROWDJHRIWKH1HXWUDO
6LQJOH/LQHWR*URXQG)DXOW/*
/LQHWR/LQH)DXOW//
'RXEOH/LQHWR*URXQG)DXOW//*
7KUHH 3KDVH 6KRUW &LUFXLW )DXOW
)DXOWV 7KURXJK ,PSHGDQFH
8QV\PPHWULFDO )DXOWV$QDO\VLV 8VLQJ %XV ,PSHGDQFH 0DWUL[
copyright law.
Account: ns240708
Contents vii
CHAPTER 8 : Power System Stability ... 350

,QWURGXFWLRQ
7\SHV RI 6WDELOLW\
6WDELOLW\/LPLWV
(VVHQWLDO )DFWRUV LQ WKH 6WDELOLW\ 3UREOHP
([SUHVVLRQ IRU 6WHDG\ 6WDWH 3RZHU
3RZHU$QJOH &XUYH
6ZLQJ (TXDWLRQ
6ZLQJ &XUYHV
&RQVWDQWV RI WKH 5RWDWLQJ 0DFKLQHV 0 DQG +
6WHDG\ 6WDWH 6WDELOLW\
0HWKRGV WR ,PSURYH 6WHDG\ 6WDWH 6WDELOLW\
7UDQVLHQW 6WDELOLW\
7\SHV RI 7UDQVLHQW 'LVWXUEDQFHV DQG $SSOLFDWLRQ RI (TXDO $UHD &ULWHULRQ
0HWKRGV WR ,PSURYH 7UDQVLHQW 6WDELOLW\
$XWR 5HFORVLQJ &LUFXLW %UHDNHUV
$XWR5HFORVHUV
6ROXWLRQ RI 6ZLQJ (TXDWLRQ E\ 3RLQW E\ 3RLQW 0HWKRG
,QGH[ ...
copyright law.
Account: ns240708
copyright law.
Account: ns240708
Contents xi
Preface to the Third Edition
7KHDXWKRUVIHHOH[WUHPHO\KDSS\IRUWKHRYHUZKHOPLQJUHVSRQVHRIWKHVHFRQGHGLWLRQRIWKLVERRN
ZKLFKJDYHXVHQRXJKHQWKXVLDVPWREULQJVHFRQGHGLWLRQ
7KHSUHVHQWWKLUGHGLWLRQLVDQRXWFRPHRIWKHYDULRXVVXJJHVWLRQVJLYHQE\PDQ\UHDGHUVDQGWKH
FROOHDJXHV7KHDXWKRUVIHHOKLJKO\LQGHEWHGWRWKHPIRUWKHLUXVHIXODQGYDOXDEOHVXJJHVWLRQVIURP
WLPHWRWLPHDQGILQGSOHDVXUHLQLQFOXGLQJWKHLUVXJJHVWLRQVLQWKHSUHVHQWHGLWLRQ7KHDXWKRUVKDYH
DOVRXSGDWHGLQPRVWRIWKHFKDSWHUVZLWKQHZWRSLFVDQGVXSSOHPHQWHGZLWKW\SLFDOQXPHULFDOH[DP
SOHVWRLOOXVWUDWHFRQFHSWVRUWHFKQLTXHVWRLQWURGXFHQHZZD\VRIWKLQNLQJDERXWWKHSUREOHPVDVDGG
RQWRJLYHDEURDGVSHFWUXPRIFRYHUDJHLQWKHVXEMHFW
6RPHSULQWLQJHUURUVLQWKHVHFRQGHGLWLRQKDYHEHHQUHPRYHGZLWKIXOO\XSWRGDWHLQWURGXFWLRQWR
FXUUHQWYHUVLRQLVGRQHDQGLQFDVHVWLOOVRPHHUURUVPLJKWEHWKHUH7KHDXWKRUVZLOOEHLQGHHGJUDWHIXO
LIVXFKDPELJXLWLHVDUHEURXJKWWRRXUQRWLFH
)LQDOO\WKHDXWKRUVRQFHDJDLQZLVKWRWKDQNDOOWKRVHZKRKDYHPDGHFRQWULEXWLRQWKURXJKWKHLU
XVHIXODQGYDOXDEOHVXJJHVWLRQVLQEULQJLQJRXWWKHWKLUGHGLWLRQRIWKHERRN
²$87+256
(ix
i )
copyright law.
Account: ns240708
Preface to the First Edition
7KLV ERRN KDV EHHQ ZULWWHQ IRU XQGHUJUDGXDWH VWXGHQWV RI ,QGLDQ XQLYHUVLWLHV ,W FRYHUV WKH YDULRXV
PRGHOLQJ DVSHFWV RI SRZHU V\VWHP FRPSRQHQWV DQG FRPSXWHU PHWKRGV IRU VROYLQJ SRZHU V\VWHP
SUREOHPV VXFK DV ORDG IORZ VWXGLHV VKRUW FLUFXLW VWXGLHV DQG VWDELOLW\ VWXGLHV 7KLV ERRN KDV EHHQ
ZULWWHQ WR KHOS WKRVH LQWHUHVWHG LQ OHDUQLQJ DERXW 3RZHU 6\VWHP$QDO\VLV 7KH ERRN RUJDQL]DWLRQ
UHIOHFWV WKH GHVLUH RQ RXU SDUW WR SURYLGH WKH UHDGHU ZLWK D WKRURXJK XQGHUVWDQGLQJ RU WKH EDVLF
SULQFLSOHVDQGWHFKQLTXHVRISRZHUV\VWHPV7KLVERRNKDVEHHQZULWWHQZLWKWKHJRDORIPDNLQJLW
HDV\IRUVWXGHQWVWROHDUQLQGHSHQGHQWO\7KLVERRNLVZULWWHQLQDVLPSOHVWZD\DQGZHDUHVXUHWKDWLW
ZLOO EH XVHIXO IRU OHDUQLQJ SRZHU V\VWHPV IRU DQ\ OHYHO RI VWXGHQWV$ QXPEHU RI VROYHG H[DPSOHV
VKRUWTXHVWLRQVDQGDQVZHUVREMHFWLYHTXHVWLRQVDQGH[HUFLVHVDUHLQFOXGHG
7KHERRNLVGLYLGHGLQWRHLJKWFKDSWHUV&KDSWHULVSRZHUV\VWHPQHWZRUNPDWULFHVZLWKDSSOLFD
WLRQRIJUDSKWKHRU\
&KDSWHUGHDOVZLWKGLIIHUHQWORDGIORZWHFKQLTXHVWKHLUDOJRULWKPVDQGIORZFKDUWV&KDSWHUV
DQG GHDO ZLWK SHU XQLW V\VWHP DQG V\PPHWULFDO FRPSRQHQWV ZLWK VHTXHQFH QHWZRUNV &KDSWHU
GHDOVZLWKEXLOGLQJDOJRULWKPIRUEXVLPSHGDQFHPDWUL[ZLWKRXWDQGZLWKPXWXDOLPSHGDQFHRISRZHU
V\VWHPHOHPHQWV
&KDSWHUVDQGGLVFXVVDERXWWKHV\PPHWULFDODQGXQV\PPHWULFDOIDXOWDQDO\VLVZLWKVKRUWFLUFXLW
FDOFXODWLRQVVHOHFWLRQRIFLUFXLWEUHDNHUGLIIHUHQWW\SHVRIXQV\PPHWULFDOIDXOWFXUUHQWFDOFXODWLRQV
V\PPHWULFDODQGXQV\PPHWULFDOIDXOWDQDO\VLVXVLQJ=EXV DOJRULWKP
&KDSWHUGHDOVZLWKGLIIHUHQWW\SHRIVWDELOLWLHVVWDELOLW\OLPLWVDQGWKHLULPSURYLQJPHWKRGV
$OWKRXJKJUHDWFDUHKDVEHHQH[HUFLVHGWRFKHFNWKHVFULSWVRPHHUURUVLQWKHWH[WPLJKWKDYHFUHSW
LQ:HZRXOGOLNHWRJHWVXJJHVWLRQVIRULPSURYHPHQWRIWKLVERRNDQGZHZRXOGYHU\PXFKDSSUHFLDWH
KHDULQJIURPXVHUVRIWKLVERRN$Q\FRPPHQWVDQGFULWLFLVP\RXPLJKWKDYHZRXOGEHPRVWKHOSIXO
7KLVERRNFDQEHXVHGIRUTXLFNUHIHUHQFHE\DOO%(%7HFKDQG$0,(VWXGHQWV7KHGLDJUDPV
H[DPSOHV DQG VPDOO TXHVWLRQV DQG DQVZHUV XVHG LQ WKLV ERRN ZLOO EULQJ \RX D FOHDU LGHD DERXW WKH
FRQFHSWV
7KHDXWKRUVH[SUHVVVLQFHUHWKDQNVWR3URI66DW\DQDUD\DQD+HDG'HSDUWPHQWRI(OHFWULFDODQG
(OHFWURQLFV(QJJ6W$QQ¶V&ROOHJHRI(QJJ&KLUDOD
7KH DXWKRUV H[SUHVV ZKROHKHDUWHG JUDWHIXOQHVV WR WKH FROOHDJXHV RI WKH 'HSDUWPHQW RI (OHFWULFDO
DQG(OHFWURQLFV(QJLQHHULQJZKRKDYHGLUHFWO\RULQGLUHFWO\KHOSHGWKHDXWKRUVWREULQJWKLVERRNLQWKH
SUHVHQW IRUP
²$87+256
x
(x)
copyright law.
Account: ns240708
Copyright © 2011. Laxmi Publications Pvt Ltd. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S. or

CHAPTER
Power System Network

Matrices
1.1 INTRODUCTION
Graphs are very useful in the several fields like engineering, physical and social, etc. Many
applications of several electrical components such as machines and power system component
characteristics are representing in a simple way in graph form and for analysis of electrical circuits
also it plays very important role. For small circuit analysis based on nodal and meshed equation
methods by using Kirchhoff’s law and Ohm’s law are sufficient. But for complex networks these
methods are difficult and take more time for solving the equations. In this chapter brief discussions on
graph theory and the applications of graph theory in power system networks are going to be presented
in detail.
1.2 DEFINITIONS
Graph Theory
When the elements like resistors, inductors, capacitors and voltage sources [shown in Fig. 1.1(a)] in
a network are replaced by lines. This type of network is called the ‘graph’ is shown in Fig. 1.1(b) and
the line segments are joined by means of nodes. The rank of the graph is ‘n–1’, where n is number of
nodes of the graph. The graph thus obtained is also known as undirected graph. While drawing graph,
series elements can be replaced by a single edge in the graph.
applicable copyright law.
Fig. 1.1(a) Network Fig. 1.1(b) Equivalent graph
Account: ns240708
2 Electrical Power System Analysis
Oriented Graph
A graph whose branches are oriented is called oriented graph and is shown in Fig. 1.2. It is also called
as directed graph.
Oriented graph
Node
The meeting point of the two or more elements in the graph is called as ‘node’ and denoted by ‘n’. It
is also called as vertex.
Element (Edge)
An element is a line segment representing one network element or a combination of elements
connected between two nodes. The number of elements is represented by ‘e’.
Ex. : From Fig. 1.2,
Number of nodes n = 2,
Number of elements e = 3.
Degree: The number of elements connected to a node is called degree.
Sub-graph
It is a subset of branches and nodes of a graph. The sub-graph is said to be proper if it consists of
strictly less than all the branches and nodes of the graph.
Tree
A tree is a connected sub-graph of a connected graph containing all the nodes of the graph but
containing no closed paths or loops. If the graph consisting ‘n’ number of node, the number of
branches of a tree is (n – 1). It can also be referred in this context as spanning tree since it spansover
all the vertices of the graph.
A tree has the following properties :
1. Tree is a sub-graph containing all the vertices of the original graph.
2. Tree is a connected graph.
3. Tree does not containing any loop.
4. Every connected graph has at least one tree.
5. Each tree has (n – 1) branches and rank is also (n – 1).
6. The elements in the spanning tree are called branches or twigs.

Therefore the number of tree branches ‘b’ = (n – 1).
Account: ns240708
Power System Network Matrices 3
Co-tree
It is a sub-graph formed with all the links of the graph or, in other words co-tree is a complement of
a tree. The number of links of any co-tree will be ‘e – b = e – (n – 1)’.
where e = number of elements
b = number of tree branches
n = number of nodes
Twigs
These are the branches of a tree.
Links
The elements that are not on a tree or elements of the co-tree are called links or chords. The number
of links is represented by ‘l’. Number of links, l = e – n + 1.
where e = number of elements
n = number of nodes
Cut-set
It is a minimal set of elements of a connected graph, such that the removal of these elements from
graph isolated at least one vertex. The number of cut sets are equal to the number of twigs.
Tie-set
A fundamental tie-set of a graph with respect to a tree is a loop formed by only one link associated
with other twigs. Since for each link of the tree their corresponding to a fundamental loop, the
number of fundamental loops is equal to the number of links in the given tree. Number of fundamental
loops or links, l = e – n + 1
where e = number of elements of graph,
n = number of nodes of a graph.
The number of tie sets are equal to the number of links.
1.3 TYPES OF INCIDENCE MATRICES

1. Element node incidence matrix [A]
2. Bus incidence matrix [A]
3. Branch path incidence matrix [K]
4. Basic cut-set incidence matrix [B]
5. Augmented cut-set matrix [B]
6. Basic loop incidence matrix [C]
7. Augmented loop incidence matrix [C]
1.3.1 Element Node Incidence Matrix

The incidence of elements to nodes in a connected graph is given by element node incidence matrix
and it is denoted by A.
Account: ns240708
To determine the elements of A matrix for the Fig. 1.3 as follows

aij = 1, If the ith element is incidence and oriented away from the jth node.
aij = – 1, If the ithh element is incidence and oriented towards the jthh node.
aij = 0, If the ith element is not incident to the jthh node.
The size of the matrix is (e n)
where e = number of elements,
n = number of node in the graph
e/n 0 1 2 3
1 Ë1 –1 0 0Û
2 ÌÌ 1 0 –1 0 ÜÜ
A = 3 Ì1 0 0 1Ü
Ì Ü
4 Ì0 1 –1 0Ü
5 Ì0 0 1 –1Ü
Ì Ü
6 ÍÌ 0 0 1 –1ÝÜ
It is observed from the elements of the matrix that
Fig. 1.3
3
Ça
j 0
ij = 0, for i = 1, 2, ..., 6
i.e. The sum of elements in row wise should be equals to zero.

It can be inferred that the column of A is linearly independent and the rank of A is less than ‘n’.
1.3.2 Bus Incidence Matrix

Any node of a connected graph can be selected as the reference node. Then the variable of the other
nodes, referred to as buses, can be measured with respect to the assigned reference. The matrix obtained
from the element-incidence matrix (A) by eliminating the column corresponding to the reference node
is the bus incidence matrix ‘A’. The order of the matrix is [e (n – 1)] and the rank is (n – 1).
Selecting node (0) as reference node in the graph shown in Fig. 1.3.
e / bus 1 2 3
1 Ë –1 0 0Û
2 ÌÌ 0 –1 0 ÜÜ
? A= 3Ì 0 0 –1Ü
$b FG IJ
Ì
4Ì 1 –1 0Ü
Ü $l H K
5Ì 0 1 –1Ü
Ì Ü
6 ÌÍ 0 1 –1ÜÝ
where Ab = matrix formed by twigs.
LM 1 0 0 OP
Ab = 1 0
MM 00 PP
N 0 –1 Q
Account: ns240708
Al = matrix formed by links.

Ë1 –1 0Û
Al = Ì 0 1 – 1ÜÜ
Ì
ÍÌ 0 1 – 1ÝÜ
1.3.3 Branch Path Incidence Matrix

The branch path incidence matrix shows the incidence of branches to paths in a tree, where a path is
oriented from a bus to the reference node.
We can determine the elements of this matrix as follows:
Kij = 1, if the ithh branch is in the path from the jthh bus to reference and is oriented in the
same direction.
Kij = – 1, if the ith branch is in the path from the jth bus to reference and is oriented in
the opposite direction.
Kij = 0, if the ithh branch is not in the path from the jthh bus to reference with node ‘0’ as
reference.
The branch path incidence matrix associated with the tree shown in Fig. 1.4 is
branch/path (1) (2) (3)

1 Ë 1 0 0Û
K 2 ÌÌ 0 1 0ÜÜ
3 ÌÍ 0 0 1ÜÝ
The non-singular square matrix with rank (n – 1)

l = 3 [4, 5, 6]
b = 3 [ 1, 2, 3]
The branch path incidence matrix and the sub matrix Ab relate
the branches to paths and branches to buses, respectively. Since
there is one to one correspondence between paths and buses.
Fig. 1.4
Ab KT = U
KT = Ab–1.
where U is an Identities or Unit matrix.
1.3.4 Basic Cut-Set Incidence Matrix

The cut-set is a minimal set of branches of the graph, removal of which cuts the graph into two parts. It
separates the nodes of the graph into two groups, each being in one of the two parts is shown in Fig. 1.5.
We can determine the elements of this matrix as follows:
Bij = 1, when the ithh branch is in the cut-set j, and orientation coincides.
= – 1, when the ith branch is in the cut-set j, and orientation does coincide.
= 0, when the ith branch is not/the cut-set j.
Account: ns240708
The basic cut-set incidence matrix of dimensions (e b) for the graph shown in Fig. 1.5 is
Basic cut-sets
e/b a b c
1 LM 1 0 0 OP
2
B= 3
MM 00 1 0
0 1
PP
4
MM– 1 1 0P
P
5 MM 0 –1 1P
6 N0 1 1Q
P
The matrix ‘B’ can be partitioned into sub matrix Ub and
Bl, where the rows of Ub correspond to branches and the rows
of Bl to links. Fig. 1.5
The partitioned matrix is
Basic cut-set
a b c
1Ë 1 0 0Û
Ì
2Ì 0 1 0 ÜÜ
È Ub Ø
3Ì 0 0 1Ü É Ù
B= Ì Ü É Ù
4 Ì– 1 1 0Ü
Ê Bl Ú
5Ì 0 –1 1Ü
Ì Ü
6 ÌÍ 0 1 1ÜÝ
where Ub = unit matrix formed by twigs
F1 0 0 I
GG 0 1 0 JJ
H0 0 1 K
Bl = matrix formed by links
F– 1 1 0 I
GG 0 –1 1J
J
H0 1 1K
The identity matrix Ub shows the one to one correspondence of the branches and basic cut-sets.
The sub matrix Bl can be obtained from the bus incidence matrix ‘A’. The incidence of links to
buses is given by the sub matrix Al and the incidence of elements to buses is given by the sub-matrix
‘Ab’. Since there is a one to one correspondence of the elements and basic cut-sets, Bl Ab gives the
incidence of links to buses,
i.e., Bl A b = Al
Bl = Al Ab–1
Bl = Al KT (since Ab–1 = KT)
Account: ns240708
1.3.5 Augmented Cut-Set Incidence Matrix

The number of cut-sets is equal to the number of tree branches in the basic cut-set incidence matrix.
The number of cut-sets can be made equal to the number of elements by introducing fictitious or
imaginary cut-sets called tie cut-sets. Each tie cut-set containing only one link of the connected
graph.
Adjoining to the basic cut-set incidence matrix columns corresponding to tie cut-set additionally
forms an augmented cut-set incidence matrix (B). Just as in the case of basic cut-sets here too, the tie
cut-set is oriented in the same directions as the associated link the augmented cut-set incidence matrix
for the system.
The ‘B’ is a square matrix of size (e e). The B matrix for Fig. 1.6 is given below
FG FG
H H
Fig. 1.6
Basic cut-set tie cut-sets

e e a b c d e f g
È Ø
É Ù
É Ù
É Ù %DVLF FX W VHW WLH FX WVHWV
B =
ÉÉ ÙÙ 8b
É Ù %l 8l
É Ù
É Ù
ÉÊ ÙÚ
1.3.6 Basic Loop Incidence Matrix

A basic loop is obtained whenever a link is added to a tree, which is a closed path.
The basic loop incidence matrix gives the incidence of elements to basic loops of a connected
graph. It is denoted by ‘C’.
The elements of this matrix can be formed as follows
Cij = 1, when the element ‘i’ is in basic loop ‘‘j’ and their directions coincide.
= – 1, when the element ‘i’ is in basic loop ‘‘j’ and their directions do not coincide.
= 0, when the element is not in the jthh basic loop.
Account: ns240708
The size of matrix ‘C’ is (e l). The C matrix for Fig. 1.7 as given below
e/l e f g
1 F0 1 0 I
2 GG 1 1 1 JJ
3 G 1 0 1J
F I
GG Cb JJ
4 G 1 0J
C=
0
G
5 G 1 0 0J
J GG Ul JJ
6 GG 0 1 0JJ
H K
G
7 H 0 0 1K
J
where Cb = the matrix formed by twigs Fig. 1.7
F0 1 0 I
Cb
G 1
=G
1 1J
J
GG 1 0 1J
J
H 1 0 0K
Ul = unit matrix formed by links

F1 0 0 I
U = G0
l
GH 0 1 0 JJ
0 1 K
The matrix ‘C’ can partition into sub-matrix ‘Cb’ and ‘Ul’, where the rows of ‘Cb’ correspond to
branches and the rows of ‘Ul’ to links.
1.3.7 Augmented Loop Incidence Matrix

The number of loops in a connected graph is equal to the number of links. The total number of loops
is equal to the number of links, let (e – l) loops corresponding to the branches, designated as open
loop. An open loop, then defined as the path between adjacent nodes connected by branch. The open
loops for the graph given in Fig. 1.8, the orientation of an open loop are the same as that for the
associated branch. It is denoted by C.
This matrix C for the graph shown in Fig. 1.8 given below
Open loops basic loops
e/e a b c d e f g
1 È1 0 0 0 0 1 0Ø
2 É0 1 0 0 1 1 1Ù È Ø
É Ù
3 É0 0 1 0 1 0 1Ù É U b Cb Ù
C = =É Ù
4 É0 0 0 1 1 0 0Ù É 0 Ul Ù
É Ù É Ù
0Ù Ê Ú
5 É0 0 0 0 1 0
É Ù
6 É0 0 0 0 0 1 0Ù
7 ÉÊ 0 0 0 0 0 0 1ÙÚ Fig. 1.8
Account: ns240708
It is a square matrix of size (e e) and is non-singular. The use of these augmented incidence
matrix will be seen when non-singular method of obtaining network matrices are discussed.
1.4 CONSTRUCTION OF NETWORK MATRICES

Power system network consists of number of components, (generators, transformeter, transmission
lines, etc.)which are interconnected normally. Either manufacturer or design office supplies the
details of individual components.
The information giving the characteristics of individual components are represented by ‘primitive
network’.
Primitive network is a set of unconnected elements represented either impedance form or
admittance form.
To develop the network matrices, the effect of interconnection between the elements are included
by suitable transformation.
1.5 NETWORK MATRICES

The mathematical model of the networks can be developed in three different forms and these are
1. Bus frame of reference
2. Branch frame of reference
3. Loop frame of reference
1.5.1 Bus Frame of Reference

The bus current and voltage vector equations of a network can be written as
I Bus = Y Bus V Bus (Admittance form) ...(1.1)
an 1f 1 an 1f a n 1f a n 1f 1
V Bus = Z Bus I Bus (Impedance form) ...(1.2)
a n 1f 1 a n 1f an 1f a n 1f 1
FI I 1
GG I JJ 2
where I Bus = Vector of impressed bus currents matrix = G

G .. JJ
an 1f 1 GG .... JJ
GH I JK n 1
FV 1 I
GG V 2
JJ
V Bus = Vector of bus voltages measured with respect to reference bus G .. JJ
a n 1f 1 GG .. JJ
GH V n 1 K
Y = Bus admittance matrix
Bus
a n 1f a n 1f
Z Bus = Bus impedance matrix
a f a
n 1 n 1 f
Account: ns240708
Consider 3-bus system as shown in Fig. 1.9, the Z Bus and YBus matrices are given below
FY 11 Y12 Y13 I
YBus = GY Y22 Y23 JJ
GH Y 21
Y32 Y33 K
31
FZ 11 Z12 Z13 I
= GZ Z 22 Z 23 JJ
Bus
GH Z 21
Z 32 Z33 K
31
principal diagonal elements are called driving point

impedance or admittance of bus and the off
diagonal elements are called transfer impedance or A 3-bus power system network
admittance of the bus.
1.5.2 Branch Frame of Reference

The equations are written in branch currents and branch voltages
I Br = Y Br V Br (Admittance form) ...(1.3)
b g n 1 1 b g b g
n 1 n 1 b g n 1 1
V Br = Z Br I Br (Impedance form) ...(1.4)

b g n 1 1 b g b g
n 1 n 1 b g
n 1 1
where I Br = Column vector of branch current

a n 1f 1
V Br = Column vector of branch voltage
an 1f 1
Y Br = Branch admittance matrix
a n 1f a n 1f
Z Br = Branch impedance matrix
an 1 n 1 f a f
1.5.3 Loop Frame of Reference
The following equations are written for loop currents and loop voltages
I Loop = Y Loop V Loop ...(1.5)
a
e n1 1 f a f a
e n1 e n 1 f a f
e n 1 1
V Loop = Z Loop I Loop (Impedance form) ...(1.6)

c
e n 1 1 h c h
e n 1 e– n 1 c h a
e n 1 1f
where I Loop = Vector of loop current
a
e n1 1 f
V Loop
a
e n 1 1 f
Y Loop = Loop admittance matrix

a
e n 1 e n 1 f a f
Z Loop
a
e n 1 e n1 f a f
Account: ns240708
1.6 CONSTRUCTION OF PRIMITIVE NETWORK ELEMENT

Primitive network is a set of unconnected elements represented either impedance form or admittance
form.
There are two types of representation for primitive networks and they are
1. Impedance form
2. Admittance form
1.6.1 Impedance Form

Consider the network having two nodes ‘a’’ and ‘b’ is shown in Fig. 1.10, the equations of primitive
network in impedance form can be written as
Fig. 1.10
vab = ea – eb
ea + eab – zab iab = eb
ea – eb + eab = zab iab
vab + eab = zab iab
v + e = [z] i ...(1.7)
where vab = voltage across element ‘a – b’
eab = voltage source in series with element ‘a – b’
iab = current through the element ‘a – b’
zab = impedance matrix of element ‘a – b’.
1.6.2 Admittance Form

Consider the network shown in Fig. 1.11, the equations of primitive network in admittance form can
be written as
iab + jab = yab vab

i + j = [[y] v ...(1.8)
where jab = current source between nodes a – b

yab = admittance matrix of branch a – b.
Account: ns240708
1.7 NETWORK MATRIX FORMATION

The admittance matrix Y and impedance matrix Z can be determined by using the following methods:
1. Based on the incidence matrices
(a) Singular transformation method
(b) Non-singular transformation method
2. Based on the network analysis equations
By direct inspection method.
1.8 SINGULAR TRANSFORMATION METHOD

By using singular transformation, we can derive bus, branch and loop impedance matrix as well as
admittance matrix for the primitive netwok.
1.8.1 Determination of Bus Impedance and Bus Admittance Matrices
The bus impedance matrix ZBus and bus admittance matrix YBus can be determined by using the bus
incidence matrix ‘A’ to related variable parameters of the primitive network quantities of the inter-
connected network.
From the primitive network equation (1.8)
i + j = [[y] v ...(1.9)
Pre-multiplying the both sides with A T
AT i + AT j = AT [y[ ]v ...(1.10)
According to Kirchhoff’s current law, the algebraic sum of currents meets at any node is equal to
zero.
i.e., sum of currents meeting at a node = AT i = 0 ...(1.11)
T
Similarly A j = sum of current sources of element incidence at a node and is equal to impressed
bus current. It is a column vector
AT j = IBus ...(1.12)
Substituting the equations (1.11) and (1.12) in equation (1.10), we get
IBus = AT [y
[ ]v ...(1.13)
* T
Power into the network = [I Bus] VBus
[ * ]T v
= the sum of powers in the primitive network, i.e., [j
Therefore, [I* Bus]T VBus = [j
[ *]T v ...(1.14)
Taking conjugate transpose of equation (1.12), it is modified as
[AT]*T [j
[ *]T = [I*Bus]T ...(1.15)
But A is a real matrix so A* = A,
From matrix property [AT]T = A
Applying these two conditions in equation (1.15), we get
[I*Bus]T = A[j
[ * ]T ...(1.16)
Substituting the equation (1.16) in equation (1.14) and simplify
[ *]T VBus = [j
A[j [ * ]T v
A VBus = v ...(1.17)
Substituting the ‘v’ from equation (1.17) in equation (1.13)
Account: ns240708
? IBus = AT [[y] A VBus ...(1.18)

Bus frame reference of admittance form as
IBus = [YBus] VBus
Equating the equations (1.1) and (1.18), we get
[YBus] = AT [[y] A ...(1.19)
And ZBus can be determined by
[ZBus] = [YBus]–1 = {AT [[y] A}–1 ...(1.20)
1.8.2 Determination of Branch Impedance and Branch Admittance

Matrices
The branch impedance matrix ‘ZBr’ and the branch admittance matrix ‘Y Br’ are to be determined by
using the branch incidence matrix ‘B’ to related variable parameters of the primitive network
quantities of the interconnected network.
From the primitive network equation (1.8) in admittance form is
i + j = [[y] v ...(1.21)
Pre-multiplying the both sides with ‘BT’
BT i + BT j = BT [[y] v ...(1.22)
According to Kirchhoff’s current law (the algebraic sum of currents at any node is equal to zero)
BT i = sum of currents passing through the elements that are connected to basic
cut-set
? BT i = 0 ...(1.23)
T
B j = sum of current sources of element incidence to the basic cut-set and
represents the total source current in parallel with a branch. It is a
column vector
? BT j = IBr ...(1.24)
Substituting these two conditions in equation (1.22), then
? IBr = BT [[y] v ...(1.25)
* T
Power into the network is given by ([I Br] VBr) and this is equal to the sum of powers in the
primitive network, i.e., [ j*]T v. Since power is invariant.
Power in the primitive network = power in the interconnected network
[I*Br]T VBr = [j
[ *]T v ...(1.26)
Taking conjugate transpose of equation (1.25) it is modified as
[BT]*T [j
[ *]T = [I*Br] T (∵ BT[y
[ ]V = BTj) ...(1.27)
But ‘B’ is a real matrix so, B * = B,
From matrix property [BT]T = B
Applying these two conditions in equation (1.27), then

[I*Br]T = B [[j*]T ...(1.28)
Account: ns240708
From the equations (1.26) and (1.28)

[ *]T VBr = [j
B [j [ * ]T v
B VBr = v ...(1.29)
Finally substituting ‘v = B VBr’ from equation (1.29), in equation (1.25)
IBr = BT [[y] B VBr ...(1.30)
The branch frame reference of admittance form can be written as
IBr = [YBr] VBr ...(1.31)
Comparing the equations (1.30) and (1.31)
[YBr] = BT [[y] B ...(1.32)
After calculating ‘[YBr]’ next from this expression we can calculate ‘[ZBr]’
i.e., [ZBr] = [YBr]–1 = {BT [[y] B}–1 ...(1.33)
1.8.3 Determination of Loop Impedance and Loop Admittance Matrices

The loop impedance matrix ‘Z Loop’ and loop admittance matrix ‘Y Loop’ are to be determined by using
the loop incidence matrix ‘C’ to relate variable parameters of the primitive network quantities of the
interconnected network.
From the primitive network equation (1.7) in impedance form is
+ e = [z] i
V ...(1.34)
Pre-multiplying the both sides with ‘CT’
CT V + CT e = CT [z] i ...(1.35)
According to Kirchhoff’s voltage law (the algebraic sum of voltage in a closed loop is equal to
zero)
CT v = sum of voltages in a closed loop = 0
CT e = sum of voltage sources around each basic loop. It is a column vector
VLoop = [CT] e ...(1.36)
Substituting these two values in equation (1.35) then
? CT e = VLoop ...(1.37)
From power invariance condition for the loop and the primitive networks is given by ‘[I*Loop]T
VLoop’ and this is equal to the power in the primitive network, i.e., ‘i*T e’.
Power in the interconnected network = power in the primitive network
[I*Loop]T VLoop = [i*]T e ...(1.38)
In equation (1.38), substituting VLoop = [C]T e
[I*Loop]T [C]T e = [i*]T e ...(1.39)
Eliminating ‘e’ and taking transpose and also conjugate the equation (1.39), it is modified as
i = [C*] [ILoop] ...(1.40)
But ‘C’ is a real matrix, C* = C,

i = [C] [ILoop] ...(1.41)
Account: ns240708
Substituting equation (1.41) in equation (1.37)

VLoop = [CT] [z] [C] ILoop ...(1.42)
The loop frame reference of impedance form is
VLoop = [ZLoop] ILoop ...(1.43)
Comparing the equations (1.42) and (1.43)
[ZLoop] = CT [[z] C ...(1.44)
After calculating ‘[ZLoop]’ next from this expression we can calculate ‘[YLoop]’.
This is given by
[YLoop] = [ZLoop]–1 = {CT [z
[ ] C}–1
1.9 NON-SINGULAR TRANSFORMATION METHOD

By using non-singular transformation we can determine branch and loop impedance matrix and
admittance matrix for the primitive network. But in this section, we discuss about the branch
impedance and admittance matrices only.
1.9.1 Determination of Branch Admittance and Impedance Matrices
Consider the augmented incidence matrix, the augmented network is obtained by connecting a
fictitious branch in series with each link of the original network.
Fig. 1.12
The admittance of each fictitious branch cannot allow altering inter-connected network, its
admittance is set to zero. The current source of fictitious branch carries the same current as the
current source of the link so that the voltage across the fictitious branch is zero. A tie cut-set, can be
treated as a fictitious branch in series with cut-set containing a link.
From the branch frame reference form of performance equation
[IBr] = [YBr] [VBr] ...(1.45)
The performance of primitive network is given by the equation (1.7) as
i + j = [y
[ ]V ...(1.46)
T
Pre-Multiply the above equation on both sides with [B] , we get
[B]T i + [B]T j = [B]T [y
[ ]V ...(1.47)
We know, B =
LMU b 0OP
NB l UQ
l
Substituting this in equation (1.47), we get

LMUb OP Li O LMU
B lT b b OP L j O = LMU
B lT b b OP [[y] . [V]
B lT
N0 l
MP
U Q Ni Q N 0
l l
M P N0
U Q Nj Q l U Ql
...(1.48)
Account: ns240708
LMU i B i OP + LMU j B j OP LMU B OP [[y] . [V]

b b
T
l 1 b b
T
l l b
T
l
...(1.49)
N 0Ui Q N 0U j Q N 0U Q
l l l l l
But [Ub] ib = ib, Ul il = il
[Ub] jb = jb, Ul jl = jl
Substituting these values in equation (1.49)
LMi
B lT il
b OP LM
j B lT jl
+ b =
Ub B lT OP LM
[ ] [V]
[y
OP ...(1.50)
N il Q N jl 0 Ul Q N Q
where ib + BlT il = [BT] i = 0 ...[1.51 (a)]
jb + BlT jl = [BT] j = IBr ...[1.51 (b)]
Substituting equations [1.51 (a), (b)] in equation (1.50)
LM0OP LMI OP = LMU
Br b OP [[y] [V]
B lT
...(1.52)
Ni Q N j Q N 0
l l U Ql
LM I OP = LMU
Br b B O
T
P [y[ ] [V]
l
...(1.53)
Ni j Q N 0
l l UQ l
LM I OP = I
Br
Br ...(1.54)
Ni j Q
l l
where I
LMU
Br
b B lT OP
[[y] [V] ...(1.55)
N0 Ul Q
il + jl is the total source currents of a fictitious branch and its associated link.
? I Br = [BT] [[y] [V] ...(1.56)
and voltage across fictitious branch is zero. So the voltage vector of the augmented network is V Br
...(1.57)
And the voltage across original network is
V = [B] [VBr] = [B] V Br ...(1.58)
Substituting equation (1.58) in equation (1.56) then
I Br = [B]T [[y] [B] V Br ...(1.59)
The performance equation of the augmented network is
I Br = Y Br c h cV h Br ...(1.60)
Comparing equations (1.59) and (1.60)
Y Br ]T [ y] [BT] ...(1.61)
The equation (1.61) can also write as follows :
LMY A YB UbOP LM OP Ë y y Û LU 0 O
B lT bb bl b
y ÜÝ MN B U PQ
= Ì ...(1.62)
NY Q N
C YD 0 U Q Íy
l lb ll l l
[ ]= M
Ly bb y O
bl
y PQ
[y = Primitive admittance matrix
Ny lb ll
Account: ns240708
[[ybb] = Primitive admittance matrix formed by branches

[ ll] = Primitive admittance matrix formed by links
[y
[ bl] = [[ylb]T = Mutual admittance matrix formed by branches and links
[y
LMYA YBOP Ë y B lT ylb
= Ì bb
ybl BlT yll Û ËU b
ÜÌ
0Û
Ü
NYC YD Q ÍÌ ylb yll ÝÜ Í Bl Ul Ý
LMY
A Y O
B
P
ËË y
= ÌÍ
bb BTl ycb ybl Bl BlT yll Bl ÛÝ Ë ybl BlT yll Û Û
Í ÝÜ
NY
C Y Q
D ÌÍ ylb yll B yll ÜÝ
? YA = ybb + Bl ylb + ybll Bl + BlT ((yll) [Bl]
T
...(1.63)
YB = ybl + BlT yll ...(1.64)
YC = ylb + ylll B ...(1.65)
YD = yll ...(1.66)
But from singular transformation method,
[YBr] = [BT] [[y] [B]
Ëy ybl Û ËU b Û
= ËÍ U b B Tl ÛÝ Ì bb
Í ylb yll ÜÝ ÌB Ü
Í lÝ
ËU b Û
= ÍË ybb B lT ylb ybl B lT yll ÝÛ Ì Ü
Í Bl Ý
= ybb BTl ylb ybl B l BlT yll B l ...(1.67)
From equations (1.63) and (1.67)
[YA] = [YBr] ...(1.68)
The branch impedance can be determined by
[ZBr] = [YBr]–1 = [YA]–1 ...(1.69)
1.10 DIRECT INSPECTION METHOD FOR DETERMINATION OF ‘YBUS’

By direct inspection of the network, YBus can be obtained for any network, if there is no mutual
impedances between elements.
Apply the Kirchhoff’s current law at every bus for developing the bus admittance matrix. In this
way, systematic nodal equations are developed for every node except for the reference bus, which is
normally taken as ground bus. However, if there is any voltage source with series impedance in the
network that is replaced by an equivalent current source with shunt impedance. Let us write the nodal
equations using Kirchhoff’s current law for the network shown in Fig. 1.13.
Fig. 1.13
Account: ns240708
Here ‘I1’ and ‘I3’ are the external current sources at the bus ‘1 and 3’. In the nodal formulation, all
the voltage sources with the series impedance, which is usually the case in the power system network,
are replaced by the equivalent current sources with shunt impedance by the following method.
The two sources are equivalent if
(i) Eg = Is Zs
(ii) Zg = Zs
Fig. 1.14 Ideal voltage source Fig. 1.15 Ideal current source
Now consider Fig. 1.13 and applying Kirchhoff’s current law at the buses 1, 2 and 3. We will
obtain the following nodal equations
I1 = V1 y1 + (V1 – V2) y12 ...[1.70(a)]
0 = V2 y2 + (V2 – V3) y23 + (V2 – V1) y12 ...[1.70(b)]
I3 = V3 y3 + (V3 – V2) y23 ...[1.70(c)]
where V1, V2 and V3 are the voltages of bus 1, 2 and 3, respectively with respect to the reference bus
‘0’ and these are also known as bus voltages.
The admittances yij = yji, i.e., y12 = y21 since network elements are linear and bilateral.
Rearranging equation (1.70) and separating co-efficient of bus voltage variables (V1, V2 and V3),
I1 = ((y1 – y12) V1 – y12 V2 ...[1.71(a)]
0 = – y21 V1 + ((y12 + y2 + y23) V2 – y23 V3 ...[1.71(b)]
I3 = – y32 V2 + ((y23 + y3) V3 ...[1.71(c)]
Let y1 + y12 = Y11 ...[1.72(a)]
y12 + y2 + y23 = Y22 ...[1.72(b)]
y23 + y3 = Y33 ...[1.72(c)]
From the above equations it is clear that
Diagonal elements = Sum of the admittances of the elements that are creating the node.
Off-diagonal elements = Negative sign of admittance between the adjacent nodes.
i.e., Y12 = – y12, Y23 = – y23 and Y13 = – y13 ...[1.72(d)]
Diagonal elements are called self-admittances of the node or driving point admittances. The off
diagonal elements are called mutual admittances or transfer admittances.
Substituting equation (1.72) in equation (1.71)
I1 = Y11 V1 + Y12 V2 ...[1.73(a)]

0 = Y21 V1 + Y22 V2 + Y23 V3 ...[1.73(b)]
I3 = Y32 V2 + Y33 V3 ...[1.73(c)]
Account: ns240708
These equations can be written in the following matrix form as

LMI OP
1 Y12 LM Y
0 V1 11 OP LM OP
MM 0 PP
21 Y22 MMY
Y23 V2 PP MM PP ...(1.74)
3 NI Q N 0
Y32 Y33 V3 QN Q
From the above discussions we can write the ‘Y Bus’ general form for any power system network
with ‘n’ buses (n + 1 nodes) as follows
Ë I1 Û
Ì Ü
LM
Y11 Y12 Y1n V1 OP LM OP
Y Y22 Y2 n V2
ÌI 2 Ü = 21 MM PP MM PP ...(1.75)
Ì Ü
Ì Ü
ÍI n Ý
MN
Yn1 Yn 2 Ynn Vn
PQ MN PQ
The elements of bus admittance matrix can be form as follows :
Yii = Sum of the admittances of the elements that are creating the node at bus ‘i’
Yij = Negative sign of admittance between the adjacent busses ‘i’ and ‘j
‘’
LMY 11 Y12 Y1n OP

Y Y22 Y2 n
=M PP
21
YBus ...(1.76)
MM
PQ
NYn1 Yn 2 Ynn
Note : (i) The ‘YBus’ matrix can be found by direct inspection method provided mutual coupling between
the elements of the given power system network is neglected.
(ii) The ‘YBus’ matrix can be developed by direct inspection method, but not in the case of ‘Z Bus’ matrix.
1.11 DIRECT INSPECTION METHOD FOR DETERMINATION OF ‘ZLOOP’

In this method the elements of loop incidence matrix (Z Loop) can be calculated directly by inspection
and hence ‘ZLoop’ has direct correspondence with the given primitive network.
Let us take the one example for solving ‘ZLoop’ by using direct inspection method.
The elements of ‘ZLoop’ matrix are developed by applying Kirchhoff’s voltage law and writing
loop equations of the given power system network. However if there is any current sources in the
network that is replaced by equivalent voltage source with series impedance.
Fig. 1.16
Account: ns240708
Writing the loop equation by using Kirchhoff’s voltage law for Fig. 1.16.
E1 – E2 = I1 Z1 + (I1 – I2) Z2 + (I1 – I3) Z4 ...[1.77(a)]
E2 – E3 = (I2 – I1) Z2 + I2 Z3 + (I2 – I3) Z5 ...[1.77(b)]
0 = (I3 – I1) Z4 + (I3 – I2) Z5 + I3 Z6 ...[1.77(c)]
Separating the coefficients of loop currents I1, I2 and I3, we get
E1 – E2 = (Z1 + Z2 + Z4) I1 – Z2 I2 – Z3 I3 ...[1.78(a)]
E2 – E3 = – Z1 I1 + (Z2 + Z3 + Z5) I2 – Z5 I3 ...[1.78(b)]
0 = – Z4 I1 – Z5 I2 + (Z3 + Z5 + Z6) I3 ...[1.78(c)]
Let the impedances
Z11 = Z1 + Z2 + Z4 ...[1.79(a)]
Z22 = Z2 + Z3 + Z5 ...[1.79(b)]
Z33 = Z4 + Z5 + Z6 ...[1.79(c)]
Z12 = Z21 = – Z2 ...[1.79(d)]
Z13 = Z31 = – Z4 ...[1.79(e)]
Z23 = Z32 = – Z5 (f )]
...[1.79(f
The resultant loop voltage sources in loop ‘1’ is
V1 = E1 – E2 ...(1.80)
The resultant loop voltage sources in loop ‘2’ is
V2 = E2 – E3 ...(1.81)
By using above assumptions, equation (1.78) can be modified as follows:
V1 = Z11 I1 + Z12 I2 + Z13 I3 ...[1.82(a)]
V2 = Z21 I1 + Z22 I2 + Z23 I3 ...[1.82(b)]
0 = Z31 I1 + Z32 I2 + Z33 I3 ...[1.82(c)]
Write equation (1.82) in matrix form
LM V OP
1 LM Z
Z12 Z13 I1
11 OP F I
2 MMV0 PP
21 MMZ
Z22 Z 23 I 2 PP GG JJ ...(1.83)
N Q
31 NZ
Z32 Z33 I 3 QH K
From above discussions we can write the elements of loop impedance matrix as follows :
Zii =Sum of the impedances of the elements forming the loop ‘i’ = Diagonal elements
Zijj =Negative sign of impedance that are common to the loops ‘i’ and ‘j
‘ ’ = Off-diagonal elements
LM Z11 Z12 OP
Z1n
Z Z22 Z2 n
? ZLoop = M
21
MM P
P ...(1.84)
NZ Zn 2 Z Q
P
n1 nn
Diagonal elements are called self impedances of the loop or driving point impedances. The off
diagonal elements are called mutual impedances or transfer impedances.
Account: ns240708
SOLVED PROBLEMS
¢ A, B¢¢, B, C¢¢, C, K
Problem 1.1. For network shown in Fig. 1.17 draw the graph, from that find A¢,
5
1 2
3 4
Sol. For Fig. 1.17(a)

Number of elements, e= 9
Number of nodes, n=5+1=6
Number of branches, b=5
Number of links, l=4
Fig. 1.17 (a) Graph
Element node incidence matrix (A ) elements can be obtained from Fig. 1.17 (a) as follows :
aij = 1, if the ithh element is incidence and oriented away from the jth node.
aij = – 1, if the ith element is incidence and oriented towards the jthh node.
aij = 0, if the ith element is not incidence to the jth node.
Node
Element 0 1 2 3 4 5
1 1 –1 0 0 0 0
2 0 1 –1 0 0 0
3 1 0 0 –1 0 0
4 1 0 0 0 –1 0
A = 5 0 0 0 0 1 –1
6 0 0 0 –1 1 0
7 0 0 1 –1 0 0
8 0 0 1 0 0 –1
9 0 0 0 1 0 –1
Account: ns240708
For obtaining bus incidence matrix (A), eliminate the reference node column in A.
Bus incidence matrix (A)
Node
Element 1 2 3 4 5
1 –1 0 0 0 0
2 1 –1 0 0 0
3 0 0 –1 0 0
4 0 0 0 –1 0
A= 5 0 0 0 1 –1
6 0 0 –1 1 0
7 0 1 –1 0 0
8 0 1 0 0 –1 Fig. 1.17 (b) Tree
9 0 0 1 0 –1
Branch path incidence matrix (K) elements are obtained from Fig. 1.17 (b).
Path
Branch (1) (2) (3) (4) (5)
1 –1 –1 0 0 0
2 0 –1 0 0 0
K= 3 0 0 –1 0 0
4 0 0 0 –1 –1
5 0 0 0 0 –1
Basic cut-set (B)
The elements in this matrix can be found as follows from Fig. 1.17 (c)
5 E
8 9 5
2 4
1
2 7 3 6
B C
4 D
1 3
A
Fig. 1.17 (c) Cut-set
Bij = 1, if the ithh element is incidence to and oriented in the same direction as the jth basic cut-set
Bijj = – 1, if the ithh element is incidence to and oriented in the opposite direction as the jthh basic cut-set
Bij = 0, if the ithh element is not incidence with the jthh basic cut-set
Account: ns240708
Cut-set
Branch A B C D E
1 1 0 0 0 0
2 0 1 0 0 0
3 0 0 1 0 0
4 0 0 0 1 0
B= 5 0 0 0 0 1
6 0 0 1 –1 0
7 –1 –1 1 0 0
8 –1 –1 0 1 1
9 0 0 –1 1 1
Augmented cut-set matrix (B)
Cut-set
Element A B C D E F G H I
1 1 0 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0 0
3 0 0 1 0 0 0 0 0 0
4 0 0 0 1 0 0 0 0 0
B = 5 0 0 0 0 1 0 0 0 0
6 0 0 1 –1 0 1 0 0 0
7 –1 –1 1 0 0 0 1 0 0
8 –1 –1 0 1 1 0 0 1 0
9 0 0 –1 1 1 0 0 0 1
Basic loop incidence matrix (C)
The elements can be found as follows from Fig. 1.17 (d) d
Cij = 1, if the element is incidence to and oriented in the same direction as the jth basic loop
Cij = – 1, if the element is incidence to and oriented in the opposite direction as the jthh basic loop
Cij = 0, if the element is not incidence to the jthh basic loop
G : 1, 2, 7, 3 7 as link
I : 9, 5, 4, 3 9 as link
H : 1, 2, 8, 5, 4 8 as link
F : 3, 4, 6 6 as link
Fig. 1.17 (d)
Account: ns240708
Loop
Element F G H I
1 0 1 1 0
2 0 1 1 0
3 –1 –1 0 1
4 1 0 –1 –1
C= 5 0 0 –1 –1
6 1 0 0 0
7 0 1 0 0
8 0 0 1 0
9 0 0 0 1
d
Augmented loop incidence matrix (C) elements are is obtained from Fig. 1.17 (d)
Loop
Element A B C D E F G H I
1 1 0 0 0 0 0 1 1 0
2 0 1 0 0 0 0 1 1 0
3 0 0 1 0 0 –1 –1 0 1
4 0 0 0 1 0 1 0 –1 –1
C = 5 0 0 0 0 1 0 0 –1 –1
6 0 0 0 0 0 1 0 0 0
7 0 0 0 0 0 0 1 0 0
8 0 0 0 0 0 0 0 1 0
9 0 0 0 0 0 0 0 0 1
Problem 1.2. For the network shown in Fig. 1.18 draw the graph and tree. Also determine the ‘Y
YBus’
matrix by direct inspection method. All the mentioned values are impedances in p.u.
+ j20
+ j10 + j5 + j20
20 Ð 60° A + j10 + j5 + j20 + j10 20 Ð 30° A
Fig. 1.18
Account: ns240708
Sol.
Fig. 1.19 (a) Graph Fig. 1.19 (b) Tree
From the graph shown in Fig. 1.19 (a)

Number of nodes, n=5
Number of elements, e=8
Number of tree branches, b = n – 1 = 5 – 1 = 4
Number of links, l=e–n+1=8–5+1=4
Therefore ‘YBus’ has the dimension of ‘4 4’
Given values are impedances and are given in p.u. quantities. We can determine admittance values
and then form the ‘YBus’.
The elements of ‘YBus’ can calculate as follows:
Yii = Sum of the admittances of the elements that are creating the node at bus ‘i’
Yij = Negative sign of admittance between the adjacent busses ‘i’ and ‘j
‘’
For i, j = 1, 2, 3 and 4
? Diagonal elements:
Y11 = j0.1 + j0.1 + j0.05 = j0.25 p.u.
Y22 = j0.1 + j0.2 + j0.2 = j0.5 p.u.
Y33 = j0.1 + j0.2 + j0.05 = j0.35 p.u.
Y44 = j0.05 + j0.05 + j0.05 = j0.15 p.u.
Off-diagonal elements:
Y12 = Y21 = – j0.1 p.u.
Y13 = Y31 = 0.0 p.u.
Y14 = Y41 = – j0.05 p.u.
Y23 = Y32 = – j0.2 p.u.
Y24 = Y42 = 0 p.u.
Y34 = Y43 = – j0.05 p.u.
Account: ns240708
LM j 0.25 j 0.1 0 – j 0.05 OP

j 0.1 j 0.5 j 0.2 0
? YBus =M PP
MM 0 j 0.2 j 0.35 j 0.05
PQ
N j 0.05 0 j 0.05 j 0.15
Problem 1.3. For problem 1.2, determine the elements of ‘Z
ZLoop’ by direct inspection method.
Sol. Here we have to replace the current sources into equivalent voltage sources when applying the
direct inspection method.
The elements of loop impedance matrix as follows :
Zii = Sum of the impedances of the elements forming the loop ‘i’
Zijj = Negative sign of impedance that are common to the loops ‘i’ and ‘j
‘’
? Diagonal elements are
Z11 = + j25 p.u.
Z22 = + j30 p.u.
Z33 = + j50 p.u.
Z44 = + j55 p.u.
and off-diagonal elements are
Z12 = Z21 = – j5 p.u.
Z13 = Z31 = 0 p.u.
Z14 = Z41 = – j10 p.u.
Z23 = Z32 = – j10 p.u.
Z24 = Z42 = – j5 p.u.
Z34 = Z43 = – j20 p.u.
Ë+ j 25 – j5 0 – j10 Û
Ì – j 5 j 30 – j10 – j 5 ÜÜ
? ZLoop = Ì
Ì 0 – j10 j 50 – j 20 Ü
Ì Ü
Í – j10 – j 5 – j 20 j 55 Ý
Problem 1.4. Determine the incidence matrices A, B, B , C, C and K. From that verify the
following relations shown in Fig. 1.20. Take 1 as ground bus.
(i) Cb = – BlT (ii) C B T = U
(iii) Ab KT = U and (iv) Bl = Al KT
3 4
1 2
Fig. 1.20
Account: ns240708
Sol. Number of nodes, n = 4

3 3 4
Number of tree branches, b = n – 1
=4–1=3
Number of links, l=e–n+1 2 4
= 4 – 4 + 1 = 1.
Assume node (1) as reference
1 1 2
From Fig. 1.20 (b), Bus incidence matrix [A]
Fig. 1.20 (a) Graph

e 2 3 4
1 –1 0 0 U|
A= 2 0 –1 0 V| A b
3 0 1 –1 W (3) 3 3 4
4 1 0 –1 pA l
LM 1 0 0 OP 2 (2) 4
? Ab = 0 –1 0
MM 0 PP
N 1 1 Q
Al = 1 0 1 1
1 2
From Fig. 1.20 (b), Branch path matrix (K) (1)
Path Fig. 1.20 (b) Tree

Branch (1) (2) (3)
1 –1 0 0
K= 2 0 –1 –1
3 0 0 –1
C
From Fig. 1.20 (c), Basic cut-set incidence matrix (B) 3 3 4
C
Cut-set B
Element A B C
2 4
1 1 0 0 U|
B= 2 0 1 0 V| B b
3 0 0 1 W 1 1 2
4 –1 1 1 pB l
Fig. 1.20 (c)
A
LM1 0 0 OP
? Bb = 0 1 0
MM0 PP
N 0 1 Q
and Bl =
Account: ns240708
d Augmented cut-set incidence matrix (B )

From Fig. 1.20 (d),
Cut-set C
3 3 4
Elementt A B C D
B
1 1 0 0 0
B = 2 0 1 0 0 =
LMU b 0OP 2 4 D
3 0 0 1 0
NB l UQ l
4 –1 1 1 1 1 1 2
A
? Bl = [– 1 1 1]
and Ul = [1] Fig. 1.20 (d)
From Fig. 1.20 (e), Basic loop incidence matrix (C)

Loop 3 C 4
Element D
3
1 1
U|
C= 2 –1
V| C b B 2 D 4
3 –1
W
4 1 pC l
1
1
A 2
LM 1OP Fig. 1.20 (e)
? Cb = –1
MM– 1PP
N Q
Cl = [1]
From Fig. 1.20 (e), Augmented loop incidence matrix (C)
Loop
Element A B C D
1 1 0 0 1
C = 2 0 1 0 –1 =
LMU b Cb OP
3 0 0 1 –1
N0 Ul Q
4 0 0 0 1
LM 1OP
? Cb = 1
MM 1PP
N Q
(i) Cb = – BlT
From the matrices Cb and Bl values
C b = – Bl T
Account: ns240708
(ii) CBT = U
LM 1 0 0 1OP
0 1 0 –1
C = M
MM0 0 1 –1PPP
N0 0 0 1Q
LM 1 0 0 0OP
0 1 0 0
B = M
MM 0 0 1 0PPP
N 1 1 1 1Q
LM 1 0 0 1OP
0 1 0 1
B = M
MM0 0 1 1PPP
T
N0 0 0 1Q
LM 1 0 0 1OP LM 1 0 0 –1 OP
0 1 0 –1 0 1 0 1
C(B) = M
MM0 0 1 –1PPP MMM0 P
T
0 1 1P
N0 0 0 1Q N0 0 0 1Q
P
LM1 0 0 0OP
0 1 0 0
=M
MM0 0 1 0PPP
N0 0 0 1 Q
? C (B)T = U
(iii) Ab KT = U
LM 1 0 0 OP
Ab = 1
MM 00 0
PP
N 1 1 Q
LM 1 0 0O
P T
LM 1 0 0OP
1 1 K = 0 1
MM 00 1PQ
P MM 0 1 0
PP
N 0 N 1 Q
T
LM 1 0 0O L 1
P0P MM 0 1 0OPP
0 0
.K = 0 1
b MM 0 1QP NM 0 1 1PQ
N 1
Account: ns240708
LM1 0 0 OP
= 0 1 0
MM0 PP
N 0 1 Q
? Ab KT = U
(iv) Bl = AlKT
Al = 1 0 1
LM 1 0 0 OP
KT = 1
MM 00 0
PP
N 1 1 Q
T
0 0 LM 11 OP LM OP
lK = 1 0 1 1
0 = 1 = Bl
MM 00 PP MM PP
1 1 N 1 Q N Q
Problem 1.5. For the graph shown in Fig. 1.21, form the necessary incidence matrices and hence
verify the following relations : 3
(i) Ab KT = U (ii) Bl = Al KT
(iii) Cb = – BlT (iv) C (B)T = U 1
4 5
3
2
Sol. Number of branches, b = n – 1
b=4–1
1 2
=3
Number of links =e–n+1
=5–4+1=2
From Fig. 1.21, Bus incidence matrix (A) 0
e b 1 2 3 Fig. 1.21 Graph

1 –1 0 0 U|
2 0 0 –1 V| A b
A= 4 1 –1 0 W 3
3 1 0 –1 UV A l
5 0 –1 1 W 1
4 2 5
3
LM 1 0 0OP (2)
?
MM 1 01 01PP
A = 0
b
(1) 1 2 (3)
N Q
A =M
L 1 0 1OP
l
N0 1 1Q
0
From Fig. 1.21 (a), Branch path matrix (K)
Fig. 1.21 (a) Tree
Account: ns240708
Path
b (1) (2) (3)
1 –1 –1 0
K= 2 0 0 –1 3
4 0 –1 0
C
From Fig. 1.21 (b), Basic cut-set incidence matrix (B) 1 3
4 2 5
Cut-set
e A B C B
1 1 0 0 U| 1 2
2 0 1 0 V| U b
B= 4 0 0 1 W A
3 –1 1 0 UV B
l
5 1 –1 1 W
0
L 1
B =M
1 0 O Fig. 1.21 (b)
1PQ
? l
N1 1
From Fig. 1.21 (b), Augmented cut-set incidence matrix (B)
Cut-set
e A B C D E
1 1 0 0 0 0
2 0 1 0 0 0 Ub LM 0 OP
B = 4 0 0 1 0 0 = B
3 –1 1 0 1 0
l N Ul Q
5 1 –1 1 0 1
Bl =
LM– 1 1 0OP
N1
–1 1Q 3
From Fig. 1.21 (c), Basic loop incidence matrix (C)
L
Loop 1 3
e D E 4 2 5
1 1 –1 U| E D
2 –1 1 Cb V|
C= 4 0 –1 1 2
W
3 1 0
5 0 1
UV U l
W
LM 1 1 OP 0
Cb = 1 1
MM 0 PP Fig. 1.21 (c)
N 1 Q
c), Augmented loop incidence matrix (C)
Account: ns240708
Loop
e A B C D E
1 1 0 0 1 –1
2 0 1 0 –1 1
4 0 0 1 0 –1 =
LMU b Cb OP
3 0 0 0 1 0
N0 Ul Q
5 0 0 0 0 1
Verification:
(i) Ab KT = U
LM 1 0 0OP
A = 0
MM 1 01 01PP
b
N Q
LM 1 0 1OP LM 1 0
T
0 OP
MM 00 01 01PP K = MM 01 01 0
PP
N Q N 1 Q
T
LM 1 0 0OP LM 1 0 0OP
K =
b MM 01 01 10PP MM 10 01 10PP
N QN Q
L1 0 0 O
= M0 1 0P = U = Unit matrix.
MM0 0 1PP
T
N Q
(ii) B = A K
l l
R.H.S. A =M
L1 1 1OP
l
N0 1 0 Q
LM 1 0 0OP
T
K =
MM 10 10 10PP
N Q
LM1 0 1OP LM 10 01 00OP = LM 1 1 0OP = B
N0 1 0Q MMN 1 0 1PPQ N 1 1 1Q l
R.H.S. = L.H.S.
T
(iii) Cb = – Bl
Bl =
LM 1 1 0 OP
N1 1 1 Q
LM 1 OP
1
T
– Bl = 1 1 = Cb .
MM 0 PP
N 1 Q
Account: ns240708
(iv) C (B)T = U
LM1 0 0 1 OP 1
0 1 0 1 1
M
C = M0 0 1 0
PP 1
MM0 0 0 1 0P
P
MN0 0 0 0 1PQ
LM1 0 0 1 1O
0 1 0 1 1P
(B) = M0
T
M 0 1 0 1P
P
MM0 0 0 1 0P
P
MN0 0 0 0 1PQ
LM 1 0 0 1 1O L1 0 0 1 1O
M 0 1 0 1 P
P M
1 0 1 0
M 1 1P
P
C(B) = M0
T
0 1 0 1P M0 0 1 0 1P
MM0 0 0
PM
1 0 P M0 0 0 1 0P
P
MN0 0 0 0 1PQ MN0 0 0 0 1PQ
LM1 0 0 0 0O
0 1 0 0 0P
= M0
M 0 1
P
0 0P = U = Unit matrix.
0 0
MM0 1 0P
P
0 0 MN0 0 1PQ
Problem 1.6. The incidence matrix is given below. From that, draw the oriented graph.
Branches

1 2 3 4 5 6 7 8

nodes 1 1 0 0 0 1 0 0 1
T
A = 2 0 1 0 0 –1 1 0 0
3 0 0 1 0 0 –1 1 –1
4 0 0 0 1 0 0 –1 0
8
7 4
Sol. 1
5 2 6 3
1 2 3 4
Fig. 1.22
Account: ns240708
Problem 1.7. For Fig. 1.23, the impedance data is given in Table 1.1. All the impedance values
are in p.u. values. Determine YBus matrices by Singular Transformation method.
8
7 4
1
5 2 6 3
1 2 3 4
Fig. 1.23
Table 1.1
Element Bus Code Self-impedance

in p.u.
1 0 — 1 0.1
2 0 — 2 0.2
3 0 — 3 0.25
4 0 — 4 0.5
5 1 — 2 0.1
6 2 — 3 0.4
7 3 — 4 0.3
8 1 — 3 0.6
Sol. From Fig. 1.23, the Bus incidence matrix A is

LM
1 0 0 0 OP
MM00 1
0
0
1
0
0P
P
MM0 0 0 1P
P
A=
MM1 1 0 0P
P
MM0 1 1 0P
1P
MM01 0 1
0 PQ
P
Primitive impedance matrix is
N 0 1
Elements | 1 2 3 4 5 6 7 8

1 0.1 0 0 0 0 0 0 0
2 0 0.2 0 0 0 0 0 0
3 0 0 0.25 0 0 0 0 0
z= 4 0 0 0 0.5 0 0 0 0
5 0 0 0 0 0.1 0 0 0
6 0 0 0 0 0 0.4 0 0
7 0 0 0 0 0 0 0.3 0
8 0 0 0 0 0 0 0 0.6
Account: ns240708
Primitive admittance is given by

[ ]–1
y = [z
1
LM0.1 0 0 OP
MM 00 0.2
0
0
0.25
PP
M0 PP
y= M
0 0 0.5
MM 0 0 0 0 0.1 PP
MM 0 0 0 0 0 0.4 PP
MM 00 0 0 0 0 0 0.3
0.6PQ
P
N 0 0 0 0 0 0
Ë10 Û
Ì Ü
Ì0 5 Ü
Ì0 0 4 Ü
Ì Ü
0 0 0 2
? y= Ì Ü
Ì0 0 0 0 10 Ü
Ì Ü
Ì0 0 0 0 0 2.5 Ü
Ì0 0 0 0 0 0 3.33 Ü
Ì Ü
ÌÍ 0 0 0 0 0 0 0 1.67 ÜÝ
T
YBus = [A ] [[y] [A]
Ë10 0 0 0 0
0 Û 0 0 Ë1 0 0 0Û
Ì Ü Ì Ü
Ì0 5 0 0 0 0 0 0 Ü Ì0 1 0 0Ü
Ì0 0 4 0 0 0 0 0 Ü Ì0 0 1 0Ü
Ì Ü Ì Ü
0 0 0 2 0 0 0 0 Ü Ì0 0 0 1Ü
[ ] [A] = Ì
[y
Ì0 0 0 0 10 0 0 0 Ü Ì1 1 0 0Ü
Ì Ü Ì Ü
Ì0 0 0 0 0 2.5 0 0 Ü Ì0 1 1 0Ü
Ì0 0 0 0 0 0 3.33 0 Ü Ì0 0 1 1Ü
Ì Ü Ì Ü
ÍÌ 0 0 0 0 0 0 0 1.67 ÝÜ ÍÌ 1 0 1 0 ÝÜ
Ë 10 0 0 0Û
Ì Ü
Ì 0 5 0 0Ü
Ì 0 0 4 0Ü
Ì Ü
Ì 0 0 0 2Ü
=
Ì 10 10 0 0Ü
Ì Ü
Ì 0 2.5 2.5 0Ü
Ì 0 0 3.33 3.33Ü
Ì Ü
ÌÍ 1.67 0 1.67 0 ÜÝ
Account: ns240708
Ë 10 0 0 0 Û
Ì Ü
Ì 0 5 0 0 Ü
LM 1 0 0 0 1 0 0 1 OP Ì 0
Ì
0 4 0 Ü
Ü
0 1 0 0 1 1 0 0 Ì 0 0 0 2 Ü
[A ] [[y] [A] = M
T P
MM0 0 1 0 0 1 1 1P
P
Ì 10 –10
Ì
0 0 Ü
Ü
N0 0 0 1 0 0 1 0Q Ì 0
Ì 0
2.5 – 2.5 0 Ü
0 3.33 – 3.33Ü
Ì Ü
ÍÌ1.67 0 –1.67 0 ÝÜ
Ë10 10 1.67 10 1.67 0 Û
Ì Ü
= Ì
10 5 10 2.5 2.5 0 Ü
Ì
Ì
1.67 2.5 4 2.5 3.33 1.67 3.33 Ü
Ü
ÌÍ 0 0 3.33 2 3.33ÜÝ
Ë 21.67 10 1.67 0 Û
Ì 10 17.5
Ì 2.5 0 ÜÜ
? YBus =
Ì 1.67 2.5 12.5 3.33Ü
Ì Ü
Í 0 0 3.33 5.33 Ý
Problem 1.8. For the system shown in Fig. 1.24, construct Y Bus by Singular Transformation
method. The parameters of various elements are given in Table 1.2. Take node ‘6’ as referenece node.
1 2 3
6 5 4
Fig. 1.24
Table 1.2
Element Reactances in p.u.

1 — 2 0.04
1 — 6 0.06
2 — 4 0.03
2 — 3 0.02
3 — 4 0.08
4 — 5 0.06
5 — 6 0.05
Account: ns240708
Sol.
1 1 2 4 3 1 1 2 4 3
2 3 5 2 3 5
6 5 5 6 4 6 7 5 6 4
Fig. 1.24 (a) Oriented graph Fig. 1.24 (b) Tree
Element node incidence matrix (A)

n
e 1 2 3 4 5 6
1 1 –1 0 0 0 0
2 1 0 0 0 0 –1
A = 3 0 1 0 –1 0 0
4 0 1 –1 0 0 0
5 0 0 1 –1 0 0
6 0 0 0 1 –1 0
7 0 0 0 0 1 –1
From the element node incidence matrix bus incidence matrix can be determined, i.e., by deleting
the row corresponding to reference node (6).
Bus incidence matrix (A) is
n
e 1 2 3 4 5
1 1 –1 0 0 0
2 1 0 0 0 0
A= 3 0 1 0 –1 0
4 0 1 –1 0 0
5 0 0 1 –1 0
6 0 0 0 1 –1
7 0 0 0 0 1
The bus incidence matrix (A) is rearranged by separating branches and links as follows :
n
e 1 2 3 4 5
1 1 –1 0 0 0 U|
2 1 0 0 0 0 |
4 0 1 –1 0 0 V|
A b (Branch)
6 0 0 0 1 –1 ||
W
3 0 1 0 –1 0 UV A l ( Link)
5 0 0 1 –1 0 W
Account: ns240708
Primitive impedance matrix is
LM j 0.04 OP
j 0.06
MM 00 0 j 0.03
PP
z=
MM 0 0 0 j 0.02
PP
MM 0 0 0 0 j 0.08 PP
MM 0 0 0 0 0 j 0.06 P
N 0 0 0 0 0 0 j 0.05PQ
y = [[z]–1
Ë j 25 Û
Ì Ü
Ì 0 j16.67 Ü
Ì 0 0 j 33.33 Ü
Ì Ü
y= Ì 0 0 0 j 50 Ü
Ì 0 0 0 0 j12.5 Ü
Ì Ü
Ì 0 0 0 0 0 j16.67 Ü
Ì 0 0 0 0 0 0 j 20 Ü
Í Ý
YBus = [AT] [[y] [A]
LM25 OP
Ë 1
Ì
1 0 0 0 0 0Û
Ü
MM 00 16.67
0 33.33
PP
Ì 1 0 1 1 0 0 0Ü
MM 0 PP
[A]T [[y] = – j Ì 0 0 0 1 1 0 0Ü 0 0 50
Ì Ü
Ì 0 0 1 0 1 1 0Ü MM 0 0 0 0 12.5 PP
Ì 0 1 1ÜÝ
Í 0 0 0 0 MM 0 0 0 0 0 16.67 P
N0 0 0 0 0 0 20PQ
LM 25 16.67 0 0 0 0 0OP
– 25 0 33.33 50 0 0 0
M
=–j M 0 0 0 50 12.5 0 0P
P
MM 0 0 33.33 0 12.5 16.67 0P
P
MN 0 0 0 0 0 16.67 20PQ
LM 1 1 0 0 0 OP
LM 25 16.67 0 0 0 0 0 OP MM01 0 0 0 0
PP
– 25 0 33.33 50 0 0 0 1 0 1 0
M
[A ] [[y] [A]= – j M 0
T
0 0 50 12.5 0 0
PP MM0 1 1 0 0P
P
MM 0 PP
0 33.33 0 12.5 16.67 0 MM0 0 1 1 0P

NM 0 0 0 0 0 16.67 20QP MM0 0 0 1 1P
P
N0 0 0 0 1PQ
Account: ns240708
Ë25 16.67 25 0 0 0 Û
Ì Ü
Ì 25 25 33.33 50 50 33.33 0 Ü
YBus = – j Ì 0 50 50 12.5 12.5 0 Ü
Ì Ü
Ì 0 33.33 12.5 33.33 12.5 16.67 16.67 Ü
Ì 0 0 0 16.67 16.67 20ÝÜ
Í
LM41.67 25 0 0 0 OP
25 108.33 50 33.33 0
? YBus
M
=–j M 0 50 62.5 12.5 0 P
P
MM 0 33.33 12.5 62.5 16.67P
P
MN 0 0 0 16.67 36.67 PQ
Problem 1.9. Determine the YBus matrix by Singular Transformation method for the network shown
in Fig. 1.25. The parameters are given in Table 1.3.
Table 1.3
Element Self impedance in p.u. Mutual impedance in p.u.

Bus Code Impedance Bus Code Impedance
p–q Zpq – pq r–s Zpq – rs
1 1 – 2 (1) 0.2 — —
2 1–3 0.4 1–2 (1) 0.05
3 3–4 0.5 — —
4 1 – 2 (2) 0.25 1–2 (1) 0.1
5 2–4 0.2 — —
3 4
3
2 5
4 2
1 1
1 2
Fig. 1.25
Sol. Number of elements, e = 5

Number of branches, b=n–1=4–1=3
Number of links, l=e–n+1=5–4+1=2
Account: ns240708
Element-node incidence matrix (A)

n
e 1 2 3 4
1 1 –1 0 0
2 1 0 –1 0
A = 3 0 0 1 –1
4 1 –1 0 0
5 0 1 0 –1
Bus-incidence matrix (A)
n
e 2 3 4
1 –1 0 0
A= 2 0 –1 0
3 0 1 –1 (' 1 is reference node)
4 –1 0 0
5 1 0 –1
LM 1 0 OP
0
0 1 0
M
A= M 0 1 1
PP
MM 1 0 0P
P
MN 1 0 1PQ
Primitive impedance matrix [z]
e/e 1 2 3 4 5
1 LM 0.2 0.05 0 0.1 0 OP
z=
2
3
MM0.005 0.4
0
0
0.5 0
0 0
0P
P
4
MM 0.1 0 0 0.25 0P
P
5 MN 0 0 0 0 0.2PQ
–1
Primitive admittance matrix y = [z]
1
LM 0.2 0.05 0 0.1 0 OP
0.05 0.4 0 0 0
y = [z]–1
M
=M 0 0 0.5 0 0P
P
MM 0.1 0 0 0.25 0P
P
MN 0 0 0 0 0.2PQ
To calculate z–1 there are two methods:
Method 1:
1
LM 0.2 0.05 0 0.1 0 O
0.05 0.4 0 0 0P
M P
y = [z] –1
=M 0 0 0.5 0 0P
MM 0.1 0 0 0.25 0P
P
MN 0 0 0 0 0.2PQ
Account: ns240708
Step 1. Interchange rows 3 and 4

1
LM 0.2 0.05 0 0.1 0 OP
0.05 0.4 0 0 0
M
y= M 0.1 0 0 0.25 0P
P
MM 0 0 0.5 0 0P
P
MN 0 0 0 0 0.2 PQ
Step 2. Interchange columns 3 and 4
1
LM 0.2 0.05 0.1 0 0 OP
0.05 0.4 0 0 0
M
y= M 0.1 0 0.25 0 0P
P =
LMA 1 A2 OP
MM 0 0 0 0.5 0P
P NA 3 A4 Q
MN 0 0 0 0 0.2 PQ
Step 3. Above matrix can divide into 4 submatrices
LM
0.2 0.05 0.1 OP
A1 = 0.05 0.4 0
MM PP
0.1 N0 0.25 Q
LM0 0OP L0 0 0 O
2 = 0 0
MM0 0PP A = MN0 0 0PQ
3
N Q
A4 =M
L0.5 0 OP
N 0 0.2Q
LM 6.5 0.81 2.6OP
A1–1 = 0.81
MM 2.6 02.33.6 05.33.0PP
N Q
A4–1 =M
L2 0OP
N0 5Q
Step 4.
y =
LMA A OP
–1
1 2
–1
NA A Q
3 4
LM 6.5 0.81 2.6 0 0 OP

0.81 2.6 0.33 0 0
M P
y = M 2.6 0P
MM 0 0.330 5 0
0 2 0P
P
MN 0 0 0 0 5PQ
Account: ns240708
Step 5. Interchange columns 3 and 4
LM 6.5 0.81 0 2.6 0 OP

0.81 2.6 0 0.33 0
M
y = M 2.6 0.33 0 5 0P
P
MM 0 0 2 0 0P
P
MN 0 0 0 0 5PQ
Step 6. Interchange rows 3 and 4
LM 6.5 0.81 0 2.6 0 OP

0.81 2.6 0 0.33 0
–1
]=M
M 0P
P
y = [[z
MM 2.06 0 2
0.33 0
0
5 0P
P
MN 0 0 0 0 5PQ
Limitations: This method is applicable if only the matrices A2 and A3 are having the elements
zero’s only. Otherwise it is not applicable.
Method 2:
1
LM 0.2 0.05 0 0.1 0 OP
0.05 0.4 0 0 0
y = [[z–1
M
]=M 0 0 0.5 0 0P
P =
LMA 1 A2 OP 1
MM 0.1 0 0 0.25 0P
P NA 3 A4 Q
MN 0 0 0 0 0.2PQ
Let
1
LMA 1 A2 OP =
LMB 1 B2 OP
NA 3 A4 Q NB 3 B4 Q
The values of matrices B 1, B2, B3 and B4 are
B1 = [A1 – (A2 A4–1 A3)]–1
1
A4–1
L0.25 0 OP = LM4 0OP
=M
N 0 0.2Q N0 5Q
LM0.1 0OP
A2 = 0 0
MM 0 0PP
N Q
A3 =M
L0.1 0 0OP
N 0 0 0Q
LM0.1 0OP L4 0O L0.1 0 0O

A2 A4–1 A3 = 0 0 M
MM 0 0PP N0 5PQ MN 0 0 0PQ
N Q
Account: ns240708
LM0.4 0OP LM0.1 0 0OP

=
MM 00 00PP MM 00 00 00PP
N QN Q
LM0.04 0 0OP
= 0
MM 0 00 00PP
N Q
1
R|L 0.2 0.05 0 O L0.04 0 0 OPU|
= SM0.05 0.4
[A1 – (A2 A4–1 A3)]–1
M|M 0 0 00.5PPP MMM 00 0 0 PPV|
TN Q N 0 0 QW
1
L0.16 0.05 0 OP
= M0.05 0.4
MM 0 0 00.5PP
N Q
LM 6.5 0.81 0OP
? B1 = 0.81 2.6
MM 0 0 02PP
N Q
B2 = – B1 A2 A4–1
LM 6.5 0.81 0 OP LM0.1 0OP L4 0O
= 0.81
MM 0 2.6 0
PP MM 00 0
PP MN0 5PQ
N 0 2 QN 0 Q
L 6.5 0.81 0 O L 0.4 0O
= M 0.81 2.6 0P M 0 0P
MM 0 PM
2 PQ MN 0
P
0 PQ
N 0
LM 2.6 0 OP
? B = 0.324 0
2 MM 0 PP
N 0 Q
3 = B2T =
LM 2.6 0.324 0OP
N 0 0 0Q
–1
B4 = A – dA A B i
4
1
4 3 2
–1 L 4 0 O L0.1 0 0 O M
L 2.6 0 OP
=M
A4 A 3 B 2
N0 5PQ MN 0 0 0PQ MMN0.324 0
0
0
PP
Q
LM0.4 0 0OP LM0.3242.6 0 O
0P
Q MN 0 0PPQ
M
N 0 0 0
Account: ns240708
=
LM 1.04 0OP
N 0 0Q
B4 = A4–1 – (A4–1 A3 B2)
LM4 0OP – LM 1.04 0OP = LM5.04 0OP
=
N0 5 Q N 0 0 Q N 0 5 Q
LM 6.5 0.81 0 2.6 0 OP
0.81 2.6 0 0.324 0
y=z = M
L
–1B B O 1
M
M 0 0
2
0P
P
?
NB B PQ = MM 2.6 0.324
2 0
3 4
0 5.04 0P
P
MN 0 0 0 0 5PQ
Next after calculating primitive admittance matrix,
YBus = [AT] [y
[ ] [A]
LM 0.6 0.81 0 2.6 0OP LM 1 0 0 OP

LM 1 0 0 1 1OP MM 00.81
2.6 0 0.33 0
P M 0 1 0
P
YBus = 0 1
MM 0 0 11 00 01PP MM 2.60 2 0 0 PP MM 0 1 1P
P
N Q 0.33 0 0 0P M 1 0 0P
MN 0 0 0 0 5PQ MN 1 0 1PQ
LM 1 0 0OP
LM 0.6 2.6 0.81 0.33 0 2.6 5 OP M 0 1 0P
2.6 2 0.33 0 M 0 1 1P
=
MM 0.081 P M
5PQ M 1
P
N 0 2 0 0 0P
MN 1 0 1PQ
LM 1 0 0OP
LM 2 0.48 0 2.6 5 OP M 0 1 0P
= 0.81 2.6 2 0.33 0 M 0
MM PP M 1 01 01PP
N 0 0 2 0 5Q M
MN 1 0 1PPQ
LM 0.4 0.48 5OP
= 0.48
YBus
MM 5 4.62 72PP
N –1 T
Q –1
ZBus = [Y ] = {[A ] [[y] [A]}
Bus
LM 0.4 0.48 5OP

= 0.48
MM 5 4.62 72PP
N Q
LM 0.25 0.116 0.208OP

ZBus = 0.116 0.193 0.028
MM 0.208 0.028 0.014PP
N Q
Account: ns240708
Problem 1.10. Determine YBus matrix for problem 1.7 by direct inspection method.
Sol. Diagonal elements
1 1
Y11 = = 10 + 10 + 1.67 = 21.67
0.1 0.1 0.6
1 1 1
Y22 = = 5 + 10 + 2.5 = 17.5
0.2 0.1 0.4
1 1 1
Y33 = = 4 + 2.5 + 3.33 = 9.83
0.25 0.4 0.3
1 1
Y44 = = 2 + 3.33 = 5.33.
0.5 0.3
Off-diagonal elements
1
Y12 = Y21 = – = – 10
0.1
1
Y13 = Y31 = – = – 1.67
0.6
Y14 = Y41 = 0
1
Y23 = Y32 = – = – 2.5
0.4
Y24 = Y42 = 0
1
Y34 = Y43 = – = –3.33
0.3
LM 21.67 10 1.67 0 OP
10 17.5 2.5 0
YBus = M PP
MM– 1.67 2.5 9.83 3.33
P
N 0 0 3.33 5.33 Q
Problem 1.11. The network shown in Fig. 1.26. Draw graph and tree. Determine the Y Bus by
direct inspection method and verify YBus by nodal equation analysis. The admittance values are given
in p.u. quantities.
– j20
– j10 – j5 – j20
20––60° – j10 – j5 – j20 – j10 20––30°
Fig. 1.26
Account: ns240708
Sol.
Fig. 1.26 (a) Graph Fig. 1.26 (b) Tree

By Direct Inspection Method
Diagonal elements
Y11 = – j10 + (– j10) + (– j20) = – j40
Y22 = – j5 + (– j5) + (– j10) = – j20
Y33 = – j5 + (– j20) + (– j20) = – j45
Y44 = – j20 + (– j20) + (– j10) = – j50
Off-diagonal elements
Y21 = Y12 = – (– j10) = + j10
Y13 = Y31 = 0
Y14 = Y41 = – (– j20) = j20
Y23 = Y32 = – (– j5) = j5
Y24 = Y42 = 0
Y34 = Y43 = – (– j20) = j20
LM j 40 j10 0 j 20 OP
j10 j 20 j5 0
? YBus =M P
MM 0 j5 j 45 j 20 P
P
N j20 0 j 20 j 50 Q
Verification by Nodal Analysis Method
1 2 – j20 3 4
– j10 – j5 – j20
20Ð– 60°A – j10 – j5 – j20 – j10 20Ð– 30°A
0
Fig. 1.26 (c)
Account: ns240708
Let voltages at node 1 = V1

node 2 = V2
node 3 = V3
node 4 = V4
Writing nodal equations for Fig. 1.26 (c)
At node 1
(V1 – 0) (– j10) + (V1 – V2) (– j10) + (V1 – V4) (– j20) = 20 ²– 60°
V1 [– j10 – j10 – j20) + V2 (j ( 20) = 20 ²– 60°
( 10) + V4 (j
– j40 V1 + j10 V2 + j20 V4 = 20 ²– 60° ...(1.85)
At node 2
(V2 – V1) (– j10) + (V2 – V3) (– j5) + (V2 – 0) (– j5) = 0
j10 V1 + (– j10 – j5 – j5) V2 + j5 V3
j10 V1 + (– j20) V2 + j5 V3 = 0 ...(1.86)
At node 3
(V3 – V2) (– j5) + (V3 – 0) (– j20) + (V3 – V4) (– j20) = 0
j5 V2 + (– j5 – j20 – j20) V3 + j20 V4 = 0
j5 V2 + (– j45) V3 + j20 V4 = 0 ...(1.87)
At node 4
V2 (– j10) + (V4 – V1) (– j20) + (V4 – V3) (– j20) = 20 ²– 30°
+ j20 V1 + j20 V3 + (– j10 – j20 – j20) V4 = 20 ²– 30°
+ j20 V1 + j20 V3 + (– j50) V4 = 20 ²– 30° ...(1.88)
Writing the equations (1.85), (1.86), (1.87) and (1.88) in matrix form.
LM20 ² – 60OP LM j 40 j10 0 j 20 OP LM V OP

1
j 20 V
MM 00 PP = MM j100 j5
j5
j 45
0
P M
j 20 P M V P
2 P
3
MN20 ² – 30PQ MN j20 0 j 20
PM P
j 50 Q NV Q 4
[IBus] = [YBus] [VBus]
LM j 40 j10 0 j 20 OP
j10 j 20 j5 0
? YBus =M P
MM 0 j5 j 45 j 20 P
P
N j20 0 j 20 j 50 Q
Problem 1.12. For the graph given in Fig. 1.27, draw the tree and corresponding co-tree. Choose
a tree and hence write the basic cut-set schedule. (April/may 2005, 2007)
Account: ns240708

7
2 3
1 3
2 4 5
6 4
1
Fig. 1.27
Sol. Tree of Fig. 1.27 is shown in Fig. 1.28(a)

7
2 2 3
1 3
4 5
6
1 4
Fig. 1.28(a)
Corresponding co-tree is shown in Fig. 1.28(b)

7
1 3
2 2 3 4 5
1 4
Cut-set schedule: 7
2 D
D
1 3
2 B 3 4 5
A
6
1 4
C
Fig. 1.28(c)
Account: ns240708

Cut-set
Element A B C D
1 1 0 0 0
2 1 –1 0 0
3 0 –1 1 –1
4 0 0 1 0
5 0 0 0 1
6 0 1 0 0
7 0 0 –1 0
Problem 1.13. For the given network shown in Fig. 1.29, draw the graph and tree. Write the cut-set
schedule. (April 2005)
3
5 3 6
0
1 2
1 2
4
Fig. 1.29
Sol. Graph of Fig. 1.29 is shown in Fig. 1.30(a)

5
2
1 3
4 6
1 2 3
Fig. 1.30(a)
Tree of Fig. 1.30(a) is shown in Fig. 1.30(b)

5
2
1 3
4 6
B
C
1 2 3
Fig. 1.30(b)
Account: ns240708

Masader Book 1 Page 1 49

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Masader Book 1 Page 1 49

Uploaded by

Copyright:

Available Formats

ELECTRICAL POWER SYSTEM ANALYSIS

ELECTRICAL POWER SYSTEM ANALYSIS

 Each concept is explained with ample solved numerical problems.

ABOUT THE AUTHORS

permitted under U.S. or applicable copyright law.

Electrical Power System Analysis

UNIVERSITY SCIENCE PRESS

ELECTRICAL POWER SYSTEM ANALYSIS

Limits of Liability/Disclaimer of Warranty: dŚĞƉƵďůŝƐŚĞƌĂŶĚƚŚĞĂƵƚŚŽƌŵĂŬĞŶŽƌĞƉƌĞƐĞŶƚĂƟŽŶŽƌǁĂƌƌĂŶƟĞƐǁŝƚŚƌĞƐƉĞĐƚƚŽƚŚĞ

& ĞŶŐĂůƵƌƵ ϬϴϬͲϮϲϳϱϲϵϯϬ

& :ĂůĂŶĚŚĂƌ ϬϭϴϭͲϮϮϮϭϮϳϮ

UNIVERSITY SCIENCE PRESS

CHAPTER 1 : Power System Network Matrices ... 1

CHAPTER 2 : Load Flow Studies ... 66

CHAPTER 3 : Per Unit System ... 138

CHAPTER 4 : Symmetrical Components ... 165

 5HSUHVHQWDWLRQ DQG 5HODWLRQVKLS EHWZHHQ 3KDVRUV 

CHAPTER 5 : Building of Network Matrices ... 194

CHAPTER 6 : Symmetrical Fault Analysis ... 254

CHAPTER 7 : Unsymmetrical Fault Analysis ... 297

CHAPTER 8 : Power System Stability ... 350

Preface to the Third Edition

Preface to the First Edition

Power System Network

Fig. 1.1(a) Network Fig. 1.1(b) Equivalent graph

2 Electrical Power System Analysis

6. The elements in the spanning tree are called branches or twigs.

Power System Network Matrices 3

1.3 TYPES OF INCIDENCE MATRICES

1.3.1 Element Node Incidence Matrix

4 Electrical Power System Analysis

To determine the elements of A matrix for the Fig. 1.3 as follows

i.e. The sum of elements in row wise should be equals to zero.

1.3.2 Bus Incidence Matrix

Power System Network Matrices 5

Al = matrix formed by links.

1.3.3 Branch Path Incidence Matrix

branch/path (1) (2) (3)

The non-singular square matrix with rank (n – 1)

1.3.4 Basic Cut-Set Incidence Matrix

6 Electrical Power System Analysis

Power System Network Matrices 7

1.3.5 Augmented Cut-Set Incidence Matrix

Basic cut-set tie cut-sets

1.3.6 Basic Loop Incidence Matrix

8 Electrical Power System Analysis

Ul = unit matrix formed by links

1.3.7 Augmented Loop Incidence Matrix

Power System Network Matrices 9

1.4 CONSTRUCTION OF NETWORK MATRICES

1.5 NETWORK MATRICES

1.5.1 Bus Frame of Reference

where I Bus = Vector of impressed bus currents matrix = G

10 Electrical Power System Analysis

principal diagonal elements are called driving point

1.5.2 Branch Frame of Reference

V Br = Z Br I Br (Impedance form) ...(1.4)

where I Br = Column vector of branch current

V Loop = Z Loop I Loop (Impedance form) ...(1.6)

Y Loop = Loop admittance matrix

Power System Network Matrices 11

1.6 CONSTRUCTION OF PRIMITIVE NETWORK ELEMENT

1.6.1 Impedance Form

1.6.2 Admittance Form

& ĞŶŐĂůƵƌƵ ϬϴϬͲϮϲϳϱϲϵϯϬ

5HSUHVHQWDWLRQ DQG 5HODWLRQVKLS EHWZHHQ 3KDVRUV

To determine the elements of A matrix for the Fig. 1.3 as follows

LMU i B i OP + LMU j B j OP LMU B OP [[y] . [V]

LMY 11 Y12 Y1n OP

LM j 0.25 j 0.1 0 – j 0.05 OP

d Augmented cut-set incidence matrix (B )

LM 1 0 0OP (2)

c), Augmented loop incidence matrix (C)

Element node incidence matrix (A)