95. ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 369 the repeated need for network reduction for each fault location. Furthermore, the off-diagonal elements are utilized in (9.24) to obtain bus voltages during the fault. ‘Therefore, the bus impedance matrix method is an indispensable tool for fault stud- ies. 9.5 ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX Before we present the building algorithm for the bus impedance matrix, a few def- initions from the discipline of the graph theory are introduced. The graph of a network describes the geometrical structure of the network. The graph consists of redrawing the network, with a line representing each element of the network. The graph of the network for Figure 9.2(a) before the fault application is shown in Fig- ture 9.11(a). The buses are represented by nodes or vertices and impedances by FIGURE 9.11 Graph, a selected tee, and a cote forthe network of Figure 92(b). line segments called elements or edges. A tree of a connected graph is a connected subgraph connecting all the nodes without forming a loop. The elements of a tree are called branches. In general, a graph contains multiple trees. The number of branches in any selected tree denoted by b is always one less than the nodes, i.e., b=n-1 (9.26) where n is the number of nodes including the reference node 0. Once a tree for a graph has been defined, the remaining elements are referred to as links. The collec- tion of links is called a cotree. Ife is the total number of elements in a graph, the number of links in a cotree is -b n+L 027370 9, BALANCED FAULT A loop that contains one link is called a basic loop. The number of basic loops is it equals the number of links and is the number of independent loop equations. A cut set is a minimal set of branches that, when cut, divides the graph into two connected subgraphs. A fundamental cut set is a cut set that contains only one branch, The number of fundamental cut sets is unique; it equals the number of branches and is the number of independent node equations. Figure 9.11(b) shows a tree of a graph with the tree branches highlighted by heavy lines and the cotree links by dashed lines The bus impedance matrix can be built up starting with a single element and the process is continued until all nodes and elements are included. Let us assume that Zeus matrix exists for a partial network having m buses and a reference bus 0 as shown in Figure 9.12. }_2 Partial |? network | —* Zs FIGURE 9.12 Partial network. The corresponding network equation for this partial network is Vous = Zouslous (9.28) For an n-bus system, m buses are included in the network and Ziys is of order m x m, We shall add one element at a time from the remaining portion of the network until all elements are included. The added element may be a branch or a link described as follows. ADDITION OF A BRANCH. ‘When the added element is a branch, a new bus is added to the partial network creating a new row and a column, and the new bus impedance matrix is of order (m+ 1) x (m+1). Let us add a branch with impedance 2pq from an existing bus toanew bus q as shown in Figure 9.13(a). The network equation becomes95, ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 371 1 1 L2 L3 Partial: Pp q Partial Dp network -—+———* network -—* Zs | im ee m 0 0 q | |_9 Reference Reference @ ©) FIGURE 9.13 ‘Addition ofa branch a Y 2q)[h Ve 24 || be % |= %m || te | 929) Vn 2ma | | Im Va 29 Iq ‘The addition of branch does not affect the original matrix, but requires the calcu- lation of the elements in the q row and column, Since the elements of the power system network are linear and bilateral, Zgi = Zig, for q = 1,...4™m. First, let us compute the elements Zq fori = 1,...,m andi # q (ie, excluding diagonal element Zgq). To calculate these elements we will apply a cur- rent source of 1 per unit at the ith bus, i.e., J; = 1 pu, and keep remaining buses open-circuited, ic., Iy = 0, k = 1,...,mand k # i, From (9.29), we get Y= Zu Va = 2x (9.30) From Figure 9.13(a) Ve= Vom 3»3729, BALANCED FAULT Where tpy is the voltage across the added branch with impedance Zp, and is given by pa = Fpatna (9.32) Since added element p-q is a branch, ipg = 0, thus tpg = 0 and (9.31) reduces to Lai = Sys i am if@ (9.33) To calculate the diagonal element Zyg, we will inject a current source of 1 per unit at the gth bus, ie., Jy = 1 pu, and keep other buses open-circuited. From (9.29), we have Vy = Zag 0.34) Since at the qth bus, the injected current flows from the bus q towards the bus p, ig = 1, Hence, (9.32) reduces to Yea = — 299 (9.35) ‘Substituting for upg in (9.31), we get Va=Vo +299 0.36) ‘Now, since from (9.30) for i = q, Vy = Zqq and Vp = Zpq, (9.36) becomes Zag = Zig + 20g 31 If node p is the reference node as shown in Figure 9.13(b), Vy = 0 and we obtain Zi = Zpi = Vp = 0 i=Liuym ifg (9.38) From (9.37), the diagonal element becomes aq = 59 (9.39) ADDITION OF A LINK ‘When the added element is a cotree link between the bus p and q, no new bus is created. The dimension of the Zpus matrix remains the same but all the elements are required to be calculated. Let us add a link with impedance zpy between two existing buses p and q as shown in Figure 9.14(a). If Zz is the current through the added link in the direction shown in Figure 9.14(a), we have Zpale = Vo ~Va (9.40)95. ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 373, 1 eae Partial | : network |——1? aL, [im eae Reference @ FIGURE9.14, of alink »-@. or Partial network Zs (b) V,—Vp + zpale =0 at ‘The added link modifies the old current Ip to (Ip — Iz) and the old current Jy to (Ug + 1) as shown in Figure 9.14(a), and the network equation becomes Y= Zuh+ Vp = Zh + + Zqahi+- Zmalit s+ $ZiplIp ~ Te) + Zrgl Tq + Te) + + Zit + Zyp(Ip — Te) + Zpql Iq + Le)+ +++ +Zpmtm + Zap Ip — Le) + ZaqlIq + Te) ++ +ZamIm + + Zrmp(Ip = Te) + Zmallg + Le) + °° + ZmmIm ‘Substituting for Vj and V, from (9.42) into (9.41) results in (Zea ~ pi) +++ + (Zap — Zpphlp +--+ Zan = Zra la to + (Zon — Zpm)lm + (Zpq + Zpp + Zaq ~ 2Zpq) Fe = 0 (0.42) (9.43)374 9, BALANCED FAULT Equations in (9.42) plus (9.43) result in m + 1 simultaneous equations, which is written in matrix form as “ Zu 2 2m Ze] fh Vp Zn Zpq + Lym Zope Ip ve =| Zn 2q + Zam Ze || Ty | (9.44) Vn Zmx + Zp Zmq + Lem Lime | | Ten 0 Za Zp 2aq Zim Zee Te where Zu 0.45) and Za = pq + Zyp + Bag ~ Zip (9.46) Now the fink current J, can be eliminated, Equation (9.44) can be partitioned and rewritten in compact form as Vows ) =f 25 42] [Te [% )-[ 2 qe Ce) where AZ=[ Zu Ze Zu (0.48) Expanding (9.47), we get Vous = Bleu + AZTe 9.49) and (9.50) or (9.51) from (9.51) for I; in (9.49), we have 2 Vee [eas = sean) Tous (9.52) Le95, ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 375, or Vins = Zins Tous (9.53) where AZAZ™ Lu Note that (9.54) reduces the matrix to its original size. The reason for this is that ‘we have not added a new node but only linked two existing nodes. “The bus impedance matrix can be constructed with addition of branches and links in any sequence. However, itis best to select a tree that contains the elements connected to the reference node. If more than one element is connected between a ‘given node and the reference node, only one element can be selected as a branch placing other elements in the cotree. The step-by-step procedure for building the bus impedance matrix which takes us from a given bus impedance matrix Zi to anew Zpt¥is summarized below. apse = Zp, (9.54) Rule 1: Addition of a Tree Branch to the Reference Start with the branches connected to the reference node. Addition of a branch 290 between a new node q and the reference node 0 to the given Zid matrix of order (m x m), results in the Zji5® matrix of order (m-+ 1) x (m+ 1). From the results of (9.38) and (9.39), we have Zn Zim 0 yew : . 0 oO piedltes 9.55) a 0 + Zam 0 O + 0 2 ‘This matrix is diagonal with the impedance values of the branches on the diagonal. Rule 2: Addition of a Tree Branch from a New Bus to an Old Bus Continue with the remaining branches of the tree connecting a new node to the existing node. Addition of a branch zpq between a new node q and the existing node p to the given Ze!4 matrix of order (m x m), results in the Zp,’ matrix of ‘order (mn -+ 1) x (m +1). From the results of (9.33) and (9.37), we have Tyo Lap os Zim Zip net = Jn + Zp Zym Lop (9.56) Zips 0 Eine °° nm Po376 9. BALANCED FAULT Rule 3: Addition of a Cotree Link between two existing Buses ‘When a link with impedance zpq is added between two existing nodes p and q, we augment the Zi matrix with a new row and a new column, and from (9.44) and (9.45) we have (9.57) where Zee = 299 + Zyp + Zag ~ 2L pq (9.58) The new row and column is eliminated using the relation in (9.54), which is re- peated here goa AZAZ™ Be! = ins — (9.59) and AZ is defined as Ziq Zap 2pq— % az=| 21— 2 (9.60) 2aq— Zap oe) Zing ~ Zp ‘When bus q is the reference bus, Zpi = Ziq = 0 (for i = 1,m), and (9.57) reduces to By Zip vs Zim — Zip Zr pew | 2p ie =|? 9.61)95. ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 377 where Zee = pq + Zpp, and (9.62) ‘The algorithm to construct the Zye matrix by adding one element at a time can be used to remove lines or generators from the network. The procedure is identical to that of adding elements, except that the removed element is considered ‘as negative impedance, in order to cance! the effect of the element. Based on the above algorithm, two functions named Zbus = zbuild(zdata) and Zbus = zbuild(linedata, gendata, yload) are developed for the formation of the bus impedance matrix. These functions are described in Section 9.6. Before demonstrating this program, for the sake of better understanding the building algo- rithm, we shall demonstrate the hand calculation procedure for the simple three-bus network of Example 9.1. Example 9.3 Construct the bus impedance matrix for the network in Example 9.1. The one-line impedance diagram is shown in Figure 9.15(a). FIGURE 9.15 Impedance diagram of Example 9.1 anda proper tree. The elements connected to the reference node are included in the proper tree as shown in Figure 9.15(b). We start with those branches of the tree connected to the reference node. Add branch 1, zo = 0.2 between node q = 1 and reference378 9. BALANCED FAULT ‘node 0. According to rule 1, we have a a = 20 = 70.20 Next, add branch 2, 299 = 0.4 between node q = 2 and reference node 0 2) [Zn 0 02 0 2 04 ‘us 0 ZnJ={ 0 Note that the off-diagonal elements of the bus impedance matrix are zero. This is because there is no connection between these buses other than to the reference. In this example, there are no more branches from a new bus to the reference. We con- tinue with the remaining branches of the tree. Add branch 3, 3 = 30.4 between the new node q = 3 and the existing node p = 1. According to rule 2, we get G02 0 702 0 704 “0 2 2. Zu 502 0 50.6 22, [2 Zan Za 2 Za Matas Alll tree branches are in place. We now proceed with the links. Add link 4, 21 = 0.8 between node q = 2 and node p = 1. From (9.57), we have Zn faa Bis Za Bn a | Zn Zn 2 ln-Zan oe 21 23. 23 Zan — Zan 4-2 Za-Zy Zas— Zig Fag G02 0 50.2 ~j0.2 0 j04 0 0.4 50.2 0 70.6 —j0.2 0.2 j04 “702 Zag From (9.58) Zu = 212+ Zur + Zon ~ 2Ziz = J0.8 + j0.2 + 504 — 2(50) and AzAz! a [02 SS = ay] 104 | -s02 joa -j02) Za ja [ane —70.05714 j0.11428 —70.05714 70.02857 ~70.05714 0.02857 0.02857 —j0.05714 ‘par95. ALGORITHM FOR FORMATION OF THE BUS IMPEDANCE MATRIX. 379 From (9.59), the new bus impedance matrix is j02 0 70.2 0.02857 —j0.05714 0.02857 2, = |°0 j04 0 |—| -jo.05714 70.1428 —j0.05714 j02°0 706 0.02857 —70.05714 0.02857 [zen 0.05714 iar J0.05714 0.28571 0.05714 G0.17143 70.0714 70.57143 Finally, we add link 5, 295 = j0.4 between node g = 3 and node p = 2. From (9.57), we have an Zr 243 Zia-Ze zo | Za Zn x, Tas — 2a ree Za Fa 2x3 233 — Za2 3, — Zn Zs2- 222 Zs3- Zon Zsa jO.17143 0.05714 0.17143 0.11429 _ | jo.05714 j0.28571 50.05714 —70.22857 = | j0.17143 0.05714 j0.57143 70.51429 0.11429 —70.22857 0.51429 Za From (9.58) Zag = 209-4 Zant Zas~ 2205 = j0.4-+j0.28571 + 0.57143 —2(j0.05714) = j1.14 and ag jo.11429 BtAe ar —J0.22857 | [ j0.11429 —70.22857 0.51429 ] ‘od TAY jo.51429 j0.01143 —70.02286 0.05143 = | 70.0286 0.04571 -j0.10286 0.05143 —j0.10286 j0.23143 From (9.59), the new bus impedance matrix is 4017143 j0.05714 70.1714 j0.01143 —j0.02286 0.05143 ous = [r 08714 0.28571 70. an -| j0.02286 0.04571 pase j0.17143 j0.05714 50.57143] | j0.05143 —j0.10286 j0.23143 G0.16 30.08 0.12 = [no 0.24 70.16 50.12 30.16 70.34 ‘This is the desired bus impedance matrix Zpus, Which is the same as the one ob- tained by inverting the Yius matrix in Example 9.2.380 9, BALANCED FAULT Example 9.4 ‘The bus impedance matrix for the network shown in Figure 9.16 is found to be 90.3 FIGURE 9.16 Impedance diagram for Example 94 50.183 0.078 0.141 50.078 50.148 50.106 50.141 50.106 50.267 Bou The line between buses 1 and 3 with impedance Z,3 = j0.56 is removed by the simultaneous opening of breakers at both ends of the line. Determine the new bus impedance matrix. ‘The removal of an element is equivalent to connecting a link having an impedance equal to the negated value of the original impedance. Therefore, we add link 213 = —30.56 between node q = 3 and node p = 1. From (9.57), we have Zu Aa Zag Zs- Zur 2ua=| 22 ln 23 Zag Zan us Za, 22 233. 2a3— Za. 4 ~ 2 22-212 Zaa- Zig Za Thus, we get 0.183 0.141 ~70.042 Z.—| 30.078 70.106 0.028, ms =) 0.141 0.267 50.126 30.042 50126 Zag96, ZBUILD AND SYMFAULT PROGRAMS 381 From (9.58) Zas= 213+ Z11 + Za3—2Z,3 = —J0.56 + j0.183 + 50.267 - 2(j0.141) = ~J0.392 and JT —J0.042 BEE 1 | jo.028 | [ -jo.042 70.028 j0.126 ] ial ce 50.126 70.0030 —J0.0020 —j0.0090 —70.0045 70.0030 “0 70.0135 —j0.0090 —30.0405 From (9.59), the new bus impedance matrix is j0.183 0.078 40.141 40.0045 j0.0030 0.0135 Zins = | 30.078 70.148 30.106 -| 30.0030 —j0.0020 nw | 0.141 70.106 50.267 0.0135 ~70.0090 —70.0405 40.1875 0.0750. j0.1275 = [some 300.1500 sau] 0.1275 70.1150 70.3075 9.6 ZBUILD AND SYMFAULT PROGRAMS ‘Two functions are developed for the formation of the bus impedance matrix. One function is named Zbus = zbuild(zdata), where the argument zdata is an ¢ x 4 ‘matrix containing the impedance data of an e-element network. Columns 1 and 2 are the element bus numbers and columns 3 and 4 contain the element resistance and reactance, respectively, in per unit. Bus number 0 to generator buses contain generator impedances. These may be the subtransient, transient, ot synchronous re- actances. Also, any other shunt impedances such as capacitors and load impedance to ground (bus 0) may be included in this matrix. ‘The other function for the formation of the bus impedance matrix is zbus = zbuildpi(linedata, gendata, yload), which is compatible with the power flow programs. The first argument linedata is consistent with the data required for the power flow solution. Columns 1 and 2 are the line bus numbers. Columns 3 through 5 contain line resistance, reactance, and one-half of the total line charging suscep- tance in per unit on the specified MVA base. The last column is for the transformer tap setting; for lines, 1 must be entered in this column. The lines may be entered in ‘any sequence or order. The generator reactances are not included in the linedata of the power flow program and must be specified separately as required by the gen- data in the second argument. gendata is an ny x4 matrix, where each row contains