Power flow studies using Jacobi and Gauss Seidel

[Bourbon daddy]

I have been asked to solve the actual load flow distribution in a given power network using two iterative methods. I have chosen Jacobi and Gauss Seidel.

we have to use MATLAB to find where the solution converges.

I am fine with all of this, but we have been tasked with providing graphical analysis of the results.

I am new to MATLAB, so would prefer to use excel as I can do this at home, but i am unsure as to how a graph would be shown and the purpose in showing it?

What would I provide a graph of? Where the solution converges for each of the nodes?

Can anyone offer some insight into this.

regards

 

[CalcNerd]

Do you have complex elements in the matrix? If so, Excel will let you down. GNU Octave is free and similar to MATLAB. If you are working with power flow, you could also get a student version of Powerworld. It will analyze these types of systems as well.

Are these large, real world systems or simply a smaller class type problem? Perhaps you can crank out on a good graphing calculator such as a Ti-89 or any Hp graphing calculator (the Ti-83/84 is not capable of this).

 

[jim hardy]

What would I provide a graph of?

i'd see what these folks use

http://fnetpublic.utk.edu/gradientmap.html

check their contact page. Knoxville Tennessee is the friendiest place i ever visited.

 

[anorlunda]

You want a graph of maximum mismatch versus iteration number.

At each bus, add the complex power flows in and out. They should sum to zero. The actual sum is the mismatch. The interactions cease when the maximum mismatch falls below the tolerance.

By the way, CPU time rather than iteration count is a more meaningful number.