AN EQUIVALENT ADMITTANCE NETWORK:-

A circuit having mutually coupled branches can be represented by an equivalent

circuit with no mutually coupled branches.

The system has the admittance matrix in terms of bus voltages and node currents
is

Ya −Ya Ym −Ym Vm

[ ][ ] [ ]
ℑ
−Ya Ya −Ym Ym Vn = ¿
Ym −Ym Yb −Yb Vp Ip
−Ym Ym −Yb Yb Vq Iq

ℑ=Ya Vm−Ya Vn+Ym Vp−Ym Vq…..(i)

Adding and subtracting the term YmVm on RHS of eq(i) and rearranging
ℑ=Ya Vm−Ya Vm +Ym Vp−Ym Vq+ YmVm−YmVm

The equivalent network is:-

Similarly

Combining all the individual

networks:-
If ‘n’ and ‘q’ are like physically connected nodes of same potential, we may join
them treating as single node. Thus, the equivalent circuit is shown below:
MODIFICATION OF Ybus:-

Power system networks continuously change their configuration, addition of line

or removal of a line. Therefore Ybus of an existing system should be modified
upon adding/ removal of transmission lines.
For example , if a branch inductance Ya is to be added to buses ‘m’ and ‘n’ we
simply add Ya to self- admittance elements Ymm and Ynn of Ybus and subtract Ya
from mutual admittance elements Ymn and Ynm.

In other words, a change –matrix ΔYbus is added to the existing Ybus

Ya −Ya
ΔY = [−Ya Ya ]
Thus,

(i) We can change the admittance of a branch by adding a new branch

between the same nodes.
(ii) We can remove a branch by adding –ve of its admittance value which
means subtracting the elements of ΔY from existing Ybus.

Sinilarly two “mutually coupled branches” Ya and Yb connected between nodes

‘m’ –‘n’ and ‘p’-‘q’ can be removed as well. In this case, the change matrix is

Ya −Ya Ym −Ym

[
ΔY = −Ya Ya −Ym Ym
Ym −Ym Yb −Yb
−Ym Ym −Yb Yb
]

THE METHOD OF SUCCESSIVE ELIMINATION:-

For a larger network, the admittance is of higher order. Even for a 4-bus network,
we have a 4*4 admittance matrix. To make calculations easier, we use Gaussian
elimination method. In this method, if we have four equations having four
unknoensV1 ,V2, V3 , V4
 …..(i)

……(ii)

…….(iii)

…..(iv)

We reduce this system to a system of three equations wuth three

unknowns and then reduce further to system of 2 equations with 2 unknowns.
Finally we have one equation with only one unknown which is then determined
by backward substitution, we find out remaining three unknowns as well.

The successive elimination of unknowns in forward direction is called Forward

elimination.

METHOD

Select one equation and eliminate one variable whose coefficient is called PIVOT
e.g in eq(i) we will eliminate V1 and therefore PIVOT is Y11

Divide Eq. (i) by the pivot Y11:

……. (5)

Multiply eq(5) by other points of V1i.e by Y21

Y21V1 +Y12 Y21 V2 /Y11 + Y21 V13 V3 /Y11 +Y21 Y14 V4 /Y11= Y21 I4/Y11

Subtracting from eqn (ii)

……(6)

Similarly divide eq 5 by Y31 i.e., pivot of V1 in eq.,(3)and subtract the resulting

equation from eq.,(3) will yield.

….(7)

And, in the same manner repeating the process for eq., (4)

….(8)

Arranging eq (5), (6), (7) and (8)

..…(9)

……(10)

……(11)

…..(12)
where the superscript denotes the Step 1 set of derived coefficients

the algorithmic expression for modified elements can be written as:

Now equation ‘10’ ‘11’ ‘12’ are without v1 and coefficients constitue the 3*3
matrix of reduced network with bus 1 eliminated.

STEP 2:

We will ow eliminate the 2nd variable V2.

Divide eq (10) by new pivot Y22(1)

Multiply above eq by Y32(1) and subtract it from eq (ii)

Which is equation of further reduced network elinated of bus (2) but the effect of
current injection at bus (2) taken into account by in the above equation.