Lecture #22 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Implementation.

Slides:



Advertisements
Similar presentations
Announcements Homework 6 is due on Thursday (Oct 18)
Advertisements

1 CS 201 Compiler Construction Lecture 3 Data Flow Analysis.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Power Flow Problem Formulation
Lecture #14 EEE 574 Dr. Dan Tylavsky Matrix Inversion Lemma.
Triangular Linear Equations Lecture #5 EEE 574 Dr. Dan Tylavsky.
MATH 685/ CSI 700/ OR 682 Lecture Notes
LU Factorization LU-factorization Matrix factorization Forward substitution Back substitution.
EE 369 POWER SYSTEM ANALYSIS
Announcements Be reading Chapter 6, also Chapter 2.4 (Network Equations). HW 5 is 2.38, 6.9, 6.18, 6.30, 6.34, 6.38; do by October 6 but does not need.
Chapter 2, Linear Systems, Mainly LU Decomposition.
Sparse Matrix Storage Lecture #3 EEE 574 Dr. Dan Tylavsky.
1cs542g-term Notes  Assignment 1 will be out later today (look on the web)
1cs542g-term Notes  Assignment 1 is out (questions?)
ECE 333 Renewable Energy Systems Lecture 14: Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Numerical Triangular Factorization Lecture #11 EEE 574 Dr. Dan Tylavsky.
Lecture #16 EEE 574 Dr. Dan Tylavsky Branch Modeling.
Sparse Triangular Matrix Equations Lecture #6 EEE 574 Dr. Dan Tylavsky.
Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.
Sparse Vector & Matrix Algebra Lecture #4 EEE 574 Dr. Dan Tylavsky.
Graphs and Matrix Storage Structures EEE 574 Dr. Dan Tylavsky.
Analysis of Triangular Factorization Lecture #8 EEE 574 Dr. Dan Tylavsky.
Lecture #23 EEE 574 Dr. Dan Tylavsky Decoupled Power Flow Algorithms.
Newton-Raphson Power Flow Algorithm
Lecture #15 EEE 574 Dr. Dan Tylavsky Breaker to Bus Modeling.
Fill Lecture #9 EEE 574 Dr. Dan Tylavsky. Fill © Copyright 1999 Daniel Tylavsky 4 When we solve Ax=b, (A sparse), fill-in will occur in the L,U factor.
Lecture #12 EEE 574 Dr. Dan Tylavsky Optimal Ordering.
Lecture #21 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Algorithm II.
1 CS 201 Compiler Construction Lecture 3 Data Flow Analysis.
ECIV 520 Structural Analysis II Review of Matrix Algebra.
1 Adjoint Method in Network Analysis Dr. Janusz A. Starzyk.
Finding the Inverse of a Matrix
Scientific Computing Linear Systems – LU Factorization.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
1.4 Inverses; Rules of Matrix Arithmetic. Properties of Matrix Operations For real numbers a and b,we always have ab=ba, which is called the commutative.
Introduction to Numerical Analysis I MATH/CMPSC 455 PA=LU.
Algebra-2 Section 3-2A Solving Systems of Linear Equations Algebraically Using Substitution.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Announcements Homework #4 is due now Homework 5 is due on Oct 4
ECE 576 – Power System Dynamics and Stability Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Lecture 8 Matrix Inverse and LU Decomposition
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
1 Data Flow Analysis Data flow analysis is used to collect information about the flow of data values across basic blocks. Dominator analysis collected.
ECE 576 – Power System Dynamics and Stability Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Lecture 13 Newton-Raphson Power Flow Professor Tom Overbye Department of Electrical and Computer Engineering ECE 476 POWER SYSTEM ANALYSIS.
Circuits Theory Examples Newton-Raphson Method. Formula for one-dimensional case: Series of successive solutions: If the iteration process is converged,
The Power Flow Problem Scott Norr For EE 4501 April, 2015.
Lecture 11 Power Flow Professor Tom Overbye Special Guest Appearance by Professor Sauer! Department of Electrical and Computer Engineering ECE 476 POWER.
ECE 476 Power System Analysis Lecture 12: Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
ECE 476 Power System Analysis Lecture 14: Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
ECE 476 Power System Analysis Lecture 13: Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Linear Systems Dinesh A.
A review on Load flow studies Presenter: Ugyen Dorji Master’s student Kumamoto University, Japan Course Supervisor: Dr. Adel A. Elbaset Minia University,
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
ECE 576 – Power System Dynamics and Stability Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Numerical Methods for Inverse Kinematics Kris Hauser ECE 383 / ME 442.
Numerical Computation Lecture 6: Linear Systems – part II United International College.
1 Numerical Methods Solution of Systems of Linear Equations.
Announcements Please read Chapter 6
ECE 476 POWER SYSTEM ANALYSIS
Rules of Matrix Arithmetic
ECEN 460 Power System Operation and Control
Linear Systems, Mainly LU Decomposition
Linear Algebra Lecture 15.
ECEN 460 Power System Operation and Control
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Lecture 8 Matrix Inverse and LU Decomposition
Module T7 Power Flow Read Module T7.
Presentation transcript:

Lecture #22 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Implementation

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky Main Steering Routine Read Input SolveWrite Output Optimal Order Permute Input Data Initial Estimate of Bus Voltages Line Flows & Mismatches Bus Type Switching Construct Jacobian Factorize Jacobian Solve for  q,  V q Update  q+1, V q+1 Permute Output Converge Check

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Optimal Ordering: –Find optimal ordering based on the structure of Y bus 4 Permute Input Data: –Either permute the input data and work with permuted info. OR –When needing input data use bus ordering to retrieve appropriate information. 4 Permute Results for Printing

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Initial Estimate of bus voltages: –1/0 0 4 Line Flow and Mismatches: –Save line flows for use in Jacobian. 4 Let’s look in detail at the following subprograms –Bus Type Switching –Constructing the Jacobian (Data Structure) –Factorizing the Jacobian –Solving for ,  V

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Bus Type Switching: –Recall that the expression for reactive power flowing down a transmission line is: j X E/  V/0 0   As |E| increases, so does Q 12. As |E| decreases, -Q 12 increases.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky –Assuming E is the generator side: If gen. hits max VAR limit, (because of low |V|) release control of |E|. If gen. hits min VAR limit, (because of high |V|) release control of |E|. If gen. (on max VAR limits) has Q 12 <Q 12 max, reacquire control of |E|. If gen. (on min VAR limits) has Q 12 >Q 12 min, reacquire control of |E|.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Bus Type Conversion for P-V/P-Q buses: Is PV Bus on VAR Limits? No Is Q G >Qmax? Y Chg to P-Q Q=Qmax Is Q G <Qmin? Y N Chg to P-Q Q=Qmin P-V Type Retained N Yes Is Q g on max limit? Y Y Is |E| >V SP ? Chg P-V |E|=V Sp N P-Q Type Retained N N Is Q G on min limit? Error Chg P-V |E|=V Sp N P-Q Type Retained Y Is |E| <V SP ?

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 The matrix that we constructed assumed all buses were P-Q type buses. 4 For a P-V bus we need the  P eqn. and V k =V k Sp. –Use V k =V k Sp in all equations –Set diagonal entry of  Q k eqn to L kk =1. –Zero  Q k =0. –Zero L ik =0(k  i). –Zero J ik =0, J ii =0.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 To model bus 2 as a P-V bus we make the following changes: From modified  Q 2 eqn we get: May be set to zero.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 We can retain the slack bus in the matrix or delete it. If we retain the slack bus: –Use V k =V k Sp in all equations. –Use  k =V k Sp in all equations. –Set diagonal entry of  P k,  Q k eqn to L kk =1, H kk =1. –Zero all other H, N, J, L entries for bus k.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 To model bus 1 as a slack bus we make the following changes: From modified  P 1  Q 1 eqn we get: May be set to zero.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Jacobian Data Structure.

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 LU Factorization. –Symbolic Factorization is unchanged (treating matrix as a partitioned matrix of 2X2 blocks). –Numerical Factorization Replace numerical statements in the factorization routine to: – account for the data structure –AND to account for whether you: »Invert the diagonal 2X2 blocks. (Easier to program but slower to execute.) »Perform LDU factorization of the diagonal blocks. (More complex to program but faster to execute.)

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Approach #1: Blocks LU factorization. (I.e., inverting the diagonal block. 6 Multiplications 8 Multiplications –Consider # mults. needed to factorize 1st block row. Be careful of mult order!

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky 4 Approach #2: Traditional LU factorization. –Consider # mults. needed to factorize 1st block row. 6 Multiplications

N-R Power Flow Implementation © Copyright 1999 Daniel Tylavsky –Numerical Forward/Backward Substitution Replace numerical statements in the forward backward substitution routine: – to account for the data structure –AND to account for whether you: »Invert the diagonal 2X2 blocks. »Perform LDU factorization of the diagonal blocks.

The End