Scribd
Upload
25 views4 pages

PSA File

1. The document describes using the Gauss-Siedel method to perform a load flow analysis on a power system network. 2. It provides the bus admittance matrix and load specifications for a 3 bus system. 3. MATLAB code is given to implement the Gauss-Siedel algorithm to iteratively solve for the voltage magnitudes and angles at each bus until the power mismatch converges to less than 0.0001 per unit.

Uploaded by

2K21B640 Akagra Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views4 pages

PSA File

1. The document describes using the Gauss-Siedel method to perform a load flow analysis on a power system network. 2. It provides the bus admittance matrix and load specifications for a 3 bus system. 3. MATLAB code is given to implement the Gauss-Siedel algorithm to iteratively solve for the voltage magnitudes and angles at each bus until the power mismatch converges to less than 0.0001 per unit.

Uploaded by

2K21B640 Akagra Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

EXPERIMENT 2

power system network


Aim: To carry out power-flow / load-flow of a given
using Gauss-Siedel method

Po0.6661
)SG

|V;|= 1.05

Sp3 = 2.8653 + ji.2244


lines are identical. For each line, the
In the above network, all the transmission series
yshj 0.01 while each
shunt element is a capacitor with an admittance of
element is an inductor with an impedance of z,0.1.
1. Theory:
Consider Case Iofthe power flow problem: given V,, S,S,, ...,S,find S,, V, V,,
....V,. We use aform of (10.3) repeated here for convenience,
S,=}Yv: (10.3a)
k=]

i=2,... n (10.36)
k=|

Note: If we kaow V, V,, ... ,V, we can solvefor S, explicitly using (10.3a). Since
we already do know V, it only remains to find V½, V3, ... ,V,. These n -1 un
knownsmay be found from the n - 1equations of (10.3b). Thus, the heart of the
problem is the solution of n- 1implicit equations in the unknown V,, Vs, ...
V, where V,and S, S5, ... ,S, are known. Equivalently, taking complex conju
gates, we can replace ([10.3) by

S;=vEN k=l
i-2,3,... (10.6)

We now rearrange (10.6) in aform in which asolution by iteration may be attempt


ed. It should be noted that there are alternative ways of setting up the problem.
Dividing (10.6)by Vand separating out the Y; term, we can rewTite (10.6) as
S
i=2,3, . ..n (10.7)
v k=1
k#i

or, rearanging,
n

i=2,3, . ..,n (10.8)


k=l
k*i

2. Procedure: First compute the bus admittance matrix. Check that


-j19.98 j10 j10
Yyus j10 -j19.98 j10
j10 j10 - j19.98 |
Type the code given below for the Gauss-Siedel algorithm in a MATLAB mfile.
Save the code as amit2 if Amit is your first name (no blank spaces in between).
Debug the code and run it to get the final results as:
-30
-10°
Lo.95 p. u.J

Code in MATLABmfile:
clc
clear all
%Data%
slb=l;pvb=l;pgb=l; nb=slb+pvbtpgb;
Y=[-j*19.98 j*10 j*10:j*10 -j*19.98 j*10;j*10 j*10 -j *19.98] :
y=abs,(Y) phi=angle (Y) :
v(1) =1.0;th(1)=0;v(2) =1.05;
Psp (2) =0.6661; Psp (3) =-2.8653; Qsp(3) =-1.2244 ;
%initial quess for unknown theta and v %
th (2)=0;v(3) =1.0;th (3) =0;
m=180/pi;
%Program for Gauss Siedel algorithm%
err=1.0; t=0; 8 ' t ' is the number of iterations of the algorithm
while err>le-4
for i=2:3
Px (i)=0:Qx (i) =0;
for k=1:3
Px (i) =Px (i) +v (i) *v (k)*y (i,k) *cos (th (i)-th (k) -phi (i, k) ):
Qx (i)=Qx (i) +v (i) *v (k)*y (i, k) *sin (th (i)-th (k) -phi(i, k) ):
end
end
for i=1:3
V(i) =v (i) * (cos (th (i ))+j*sin (th(i)));
end
for i=2:3
vint (i)=0;
for k=l:3
if kr=i
vint (i) =vint (i) +Y (i, k) *V(k) ;
else
end
end
end
for i=2: nb
if i<= (slb+pvb)
V(i) =(((Psp (i) -j*Ox (i)) /conj (V(i) ) -vint (i) ) /Y (i, i) );
else
V(i) =(((Psp (i) -j*Qsp(i)) /conj (V (i)) -vint (i))/Y (i, i) );
end
end
for i=2:nb
if i<= (slb+pvb)
th(i)=angle (V(i) );
else
v (i)=abs (V (i) ):
th (i) =angle (V(i)):
end
end
delp=Psp-Px;
delg=0sp-Qx;
delpqx=[delp'; delg']:
err-abs (max (delpqx) ):
t=t+l:
end
[v' m*th']

You might also like