476 CHAER 12 UNSYMMETRICAL FAULTS
at bus
®
the voltages at any bus are
v
(O
)
=
Ja
V(2) =
Ja
-
Z
(O
)
/
(O
)
j
k fa
(12.6)
If the prefault voltage at bus is not Vf ' then we simply replace
V
f in Eq.
02.
6
) by the actual value of the prefault (positive-sequence) vo ltage at that bus.
Since V
f
is by denition the actual prcfault voltage at the faulted bus , we
always have at that bus
V(O)
=
ku
_ Z(O)
1
(0)
kk fa
V(I)
=
V -Z(l) /(1)
ka
f
kk
fa
V(2) -
ka -
-
Z
(2) /(2)
kk
fa
(
12.7)
and these are the terminal voltage equations for the Thevenin equivalents of the
sequence networks shown in Fig. 12.2.
It is important to remember that the currents Ij�), Jj�), and
I
};) are
. symmetrical-component currents in the stubs hypothetically attached to the
system at the fault point. These currents take on values determined by the
particular type of fault being studied, and once they have been calculated, they
can be regarded as negative injections into the corresponding sequence net
works. If the system has -Y transformers, some of the sequence voltages
calculated from Eqs. (12.6) may have to be shifted in phase angle before being
combined with other components to form the new bus voltages of the faulted
syste
m. There are no phase shifts involved in Eq. 02.7) when the voltage
Vr
at
the fault point is chosen as reference, which is customary.
In a system with -Y transformers the open circuits encountered in the
zero-sequence network require careful consideration in computer applications
of the
Z
b
u
s
building algorithm. Consider, for instance, the solidly grounded Y-
transformer connected between buses § and
®
of Fig. 12.3(a). The positive
and zero-sequence circuits are shown in Figs. 12.3(b) and 12.3(c), respectively.
The negative-sequence circuit is the same as the positive-sequence circuit. It is
straightforward to include these sequence circuits in the bus impedance matri
ces Z�Js' Z��s' and Zb2�s using the pictorial representations shown in the gures.
This will be done in the sections which follow when Y- transformers are
present. Suppose, however, that we wish to represent removal of the trans
former connections from bus ® in a computer algorithm which cannot avail of
pictorial representations. We can easily undo the connections to bus
® in the
positive- and negative-sequence networks by applying the building algorit
n
m to