Fast Power Flow Methods 1.0 Introduction

Similar documents
LECTURE 17: Linear Discriminant Functions

Recurrence Relations

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Algebra of Least Squares

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Math 155 (Lecture 3)

Matrices and vectors

Chimica Inorganica 3

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

LINEARIZATION OF NONLINEAR EQUATIONS By Dominick Andrisani. dg x. ( ) ( ) dx

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Sequences and Series of Functions

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

Chapter 4. Fourier Series

CHAPTER 5. Theory and Solution Using Matrix Techniques

4.3 Growth Rates of Solutions to Recurrences

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Complex Analysis Spring 2001 Homework I Solution

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6.3 Testing Series With Positive Terms

Chapter Vectors

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Section 7 Fundamentals of Sequences and Series

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

CHAPTER I: Vector Spaces

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Math 25 Solutions to practice problems

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20

2 Geometric interpretation of complex numbers

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Mathematics Extension 1 SOLUTIONS

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Matsubara-Green s Functions

Basic Iterative Methods. Basic Iterative Methods

MATH 10550, EXAM 3 SOLUTIONS

Zeros of Polynomials

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Estimation for Complete Data

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

CS / MCS 401 Homework 3 grader solutions

Frequency Domain Filtering

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Linear Programming and the Simplex Method

Sequences, Series, and All That

SNAP Centre Workshop. Basic Algebraic Manipulation

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

Because it tests for differences between multiple pairs of means in one test, it is called an omnibus test.

Differentiable Convex Functions

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Lecture 7: Properties of Random Samples

Math 257: Finite difference methods

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

The multiplicative structure of finite field and a construction of LRC

Let l be an index for latent variables (l=1,2,3,4). Consider the latent variable z. vector of observed covariates (excluding a constant), α

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

PHY4905: Nearly-Free Electron Model (NFE)

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Intro to Learning Theory

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Complex Number Theory without Imaginary Number (i)

Sequences of Definite Integrals, Factorials and Double Factorials

Time-Domain Representations of LTI Systems

The Random Walk For Dummies

B = B is a 3 4 matrix; b 32 = 3 and b 2 4 = 3. Scalar Multiplication

Response Analysis on Nonuniform Transmission Line

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

PHYC - 505: Statistical Mechanics Homework Assignment 4 Solutions

PAPER : IIT-JAM 2010

Average-Case Analysis of QuickSort

Castiel, Supernatural, Season 6, Episode 18

INTEGRATION BY PARTS (TABLE METHOD)

Math 475, Problem Set #12: Answers

2.4 - Sequences and Series

Lecture 3 The Lebesgue Integral

Section 6.4: Series. Section 6.4 Series 413

Kinetics of Complex Reactions

Math 113, Calculus II Winter 2007 Final Exam Solutions

Set Notation Review. N the set of positive integers (aka set of natural numbers) {1, 2, 3, }

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Test One (Answer Key)

Chapter 1 Simple Linear Regression (part 6: matrix version)

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

ANALYSIS OF EXPERIMENTAL ERRORS

Analysis of Algorithms. Introduction. Contents

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

Machine Learning for Data Science (CS 4786)

Bernoulli numbers and the Euler-Maclaurin summation formula

ARIMA Models. Dan Saunders. y t = φy t 1 + ɛ t

Sequences, Sums, and Products

6.003 Homework #3 Solutions

Transcription:

Fast ower Flow Methods. Itroductio What we have leared so far is the so-called full- ewto-raphso R power flow alorithm. The R alorithm is perhaps the most robust alorithm i the sese that it is most liely to obtai a solutio for touh problems, which are problems that start from uesses that are ot close to their solutio. For example, solvi a lare power flow case from a flat start is usually cosidered to be a touh problem, ad as a result, it is best to do that with a R. ut R is slow! Ofte, the problem is ot so touh, ad i that case, the so-called fast decoupled FDC alorithm is also effective i etti the solutio, there is o loss of accuracy, ad it is much faster. A commo situatio where FDC is attractive is whe you have solved the case, ad the you wat to re-solve the case usi a hot start to aalyze the effect of some ot-sodramatic chae. Here, the fact that the problem is ot so touh calls for relaxi solutio alorithm robustess.

There are situatios where speed is paramout, but accuracy is ot. For example, i o-lie aalysis of 5, cotiecies, we may wat to oly filter the cotiecies that have potetial to result i problems, ad the perform full aalysis o those. I such cases, the DC power flow is appropriate. Althouh DC power flow is fast ad robust, it is ot very accurate. Solvi the power flow equatios ca be computatioally itesive. I these otes, we review FDC ad DC power flow methods. You ca see the relatio betwee the R ad these two i Table, i terms of speed, accuracy, ad solutio robustess. Table Solutio method Speed Accuracy Solutio robustess ewto-raphso Slow Accurate Robust Fast decoupled Fast Accurate Less robust DC ery fast Approximate Robust. The fast decoupled power flow The acobia matrix,

has a special characteristic i that the elemets of the off-diaoal submatrices θ ad are usually very small relative to the elemets of the diaoal submatrices θ ad I fact, we have see that i the first iteratio of a flat start, whe we assume all ales are, the elemets of the off-diaoal matrices are all. This is because every term i the expressios of the off-diaoal blocs are a multiplied by a G or b multiplied by a si. The overall terms are small because, for trasmissio: coductace G teds to be small ad aular differeces across circuits ted to be small, resulti i small si terms. These observatios are cosistet with our uderstadi that is ot very sesitive to voltae maitude i.e., small x ad x ot very sesitive to ale i.e., small x., ad is x ad We ca tae advatae of these observatios i the followi way. Istead of usi the exact acobia, let s assume that all elemets of the off-diaoal submatrices are i fact ad remai throuhout the etire R alorithm. I other words, let s ust use the followi acobia:

T ote what this does to our update equatio: x Substituti ito, we have: T 4 erformi the idicated matrix multiplicatio, we obtai: 5 6 Equatios 5 ad 6 have the followi remarable feature: real power equatios are decoupled from the voltae maitudes, ad reactive power equatios are decoupled from the ales. The implicatio is that either oe of equatios 5 ad 6 may be solved idepedet of the other oe! 4

Our power flow alorithm remais exactly as it was before, with the oly exceptio bei i Step 4.. Specify: All admittace data series Y, chari capacitace, trasformer taps, & shuts d ad d for all buses whether,, or swi ad for all buses for swi bus, with =. Set the iteratio couter =. Use oe of the followi to uess the iitial solutio. Flat Start: =. for all buses. Hot Start: Use the solutio to a previously solved case for this etwor.. Compute the mismatch vector for x, deoted as fx. I what follows, we deote elemets of the mismatch vector as ad correspodi to the real ad reactive power mismatch, respectively, for the th bus which would ot be the th elemet of the mismatch vector for two reasos: oe reaso pertais to the swi bus ad the other reaso to the fact that for type buses, there are two equatios per bus ad ot oe. This computatio will also result i all ecessary calculated real ad reactive power iectios. erform the followi stoppi criterio tests: If < for all type & buses ad If < for all type buses, The o to step 5 Else Go to step 4. 4. Fid a improved solutio as follows: Evaluate the acobia at x. Deote this acobia as Solve for x by applyi LU decompositio to: This is oly chae i alorithm!! Compute the updated solutio vector as x + = x + x. Retur to step with =+. 5. Stop. 5

How to see that the FDC alorithm is faster tha R? I R, step 4 computes x The acobia has dimesio -- G. I FDC, θ has dimesio -, ad has dimesio - G. For example, if we have buses ad eerators, the the acobia i the R has dimesio of 7,999, but the FDC alorithm acobias will have dimesios of 9,999 ad 8,, respectively. It is ow that the speed of LU decompositio is a fuctio, approximately liear, of the umber of elemets. The umber of elemets i R is 7,999 =.44E9, whereas i FDC it is 9,999 +8, =7.4E8. Therefore, FDC will be about twice as fast per iteratio as R. However, because the acobia ives the directio to move the solutio i each iteratio, we do suffer a loss i accuracy per iteratio, ad therefore we may eed more iteratios to obtai the fial solutio. 6

Give these two opposi forces less time per iteratio ad more iteratios, it is usually the case that FDC is betwee.5 ad times faster tha R. ut what about accuracy? We have said that the FDC alorithm will be less accurate per iteratio. Does that imply that it will provide a less accurate solutio oce it stops iterati? The aswer to this questio depeds o the stoppi criterio. ote that i the above FDC alorithm, the stoppi criterio is ive i Step, ad it is exactly the same as the stoppi criterio used i the R. That is, both alorithms are computi the mismatch as x ad x, ad x ad x are computed with the full real ad reactive power flow equatios, respectively, i both alorithms. It is very importat to recoize that the approximatio i FDC alorithm is applied to the acobia matrix but OT the power flow equatios used to compute the elemets of the mismatch vector. The coclusio that we ca mae here is that A OWER FLOW SOLUTIO OTAIED Y FDC IS UST AS ACCURATE AS A OWER FLOW SOLUTIO OTAIED Y R. 7

. FDC alorithm: ehacemets We may simplify the FDC alorithm still further, mai it still faster but less accurate per iteratio by wori with the expressios of the acobia elemets for θ ad. Cosider the terms. If we elect G ad uder small ale approximatio so that siθ -θ ad cosθ -θ : x G ow cosider the terms x G x si. si cos cos 7 8 Aai, usi small G ad small ale approximatio, the above is x 9 We will ow mae use of a assumptio that the voltae profile is flat, i.e., =. The 9 becomes: 8

9 x ow cosider the summatio i the curly bracets.......,, Recall that from defiitio of Y-bus elemets: : =-b b =- =: =b +b + +b,- +b +b,+ + +b ad usi the relatio from the first bullet: =- - - -,- +b -,+ - - where b is sum of all shut susceptace at bus. Substituti this last expressio for ito, we obtai: b b............,,,, Substituti ito, we obtai: b x 4

We could perform the subtractio i 4 usi to see that the term is ust the eative of the sum of all o-shut braches coected to bus. However, b is typically very small compared to so that electi b is quite accurate, resulti i: x 5 Liewise, uder assumptios of flat voltae profile ad small ale, we ca show that: x x G si x cos Summarizi eqs. 7, 5, 6, ad 7, we have: x x x x 7 5 6 7 6 7

oti that the acobia matrix has o equatios or variables for bus the swi bus, we defie the matrix as:...... '... 8... where this matrix may be obtaied from the Y-bus by simply strippi off the first row ad first colum assumi the swi bus is # ad tai the imaiary part of all elemets. This matrix is appropriate for writi the θ terms of 7 ad 5 i compact otatio, as ive by 9 below: where 9 Observe that is pre-multiplied ad post-multiplied by [] to accout for the product of two voltaes i 7 ad 5. ow, reardi the terms

If we could assume that we would have reactive power flow equatios for all buses i the etwor, the we would use for the terms as well. ut we do ot have reactive power flow equatios for the buses, oly for the buses. To accout for this, we eed to elimiate the rows ad colums correspodi to type buses from ad from []. Usi the umberi scheme,, G, as bei the voltae cotrol buses, ad bus +,, as bei the type buses, the elimiate row ad colum umber,, - from ad []. Let s refer to the resulti matrices as ad [ ]. The 6 ad 7 become: Summarizi, our decoupled pf equatios are: 9 ow let s loo at our correctio formula

Recalli eqs. 5 ad 6: 5 6 ad substituti 9, ito 5-6, we obtai: Multiplyi both sides by - results i: 4 5 There are two more chaes which prove useful i terms of capturi additioal computatioal efficiecy more speed. The first chae is a approximatio: let the secod [] i eq. 4 be the idetity matrix based o the assumptio that we have a flat voltae profile all the same ad that all voltaes are close to.. Mai this chae i eq. 4, our correctio equatios become: 6 5

4 The secod chae is to pre-multiply 6 by [] - ad 5 by [ ] -. This chae results i 7 8 Cosideri 7, sice [] is diaoal, [] - is 9 Multiplicatio of 9 by the real power mismatch vector ives the riht-had-side of 7: A similar thi ca be doe for the reactive power correctio equatio 8:

5 Multiplicatio of by the reactive power mismatch vector ives the riht-had-side of 8: ased o ad, eqs. 7 ad 8 become:

6 ~ ~ 4 where the otatio of the far riht-had-side i ad 4 idicates the riht-had-sides of ad. Two commets remai:

. Where s the speed-up? We still retai the speed up of the previous FDC alorithm, which is due to the fact that the LU-decompositio is faster per iteratio as a result of the decoupli ad correspodi reductio i total matrix elemets. The method described here provides additioal speed-up from two sources: The -matrix eed ot be reevaluated i each iteratio, ad the matrix is formed by simply deleti appropriate rows ad colums from, ad so we save the time of evaluati acobia matrix elemets. ecause the left-had-side of eq. is costat, we eed perform LU-decompositio for this equatio oly oce. Give the L ad U factors, we eed to oly perform forward ad bacward substitutio for each differet rihthad-side. We are ot quite as fortuate with the reactive power correctio equatio, 4, because there we must re-factorize each time the list of voltae cotrol buses chaes.. Alorithm: I idicated the power flow alorithm is exactly the same as i the R, but there is a mior differece i that Steps ad 4 pae 5 above ca be alterated, as follows: 7

a. Step a: Compute mismatch of ~ usi ad. b. Step 4a: Solve eq. for. c. Step b: Compute mismatch of ~ usi ad. d. Step 4b: Solve eq. 4 for e. Step c: erform stoppi criterio tests: If < for all type & buses ad If < for all type buses, The o to step 5 Else. Retur to step with =+. The reaso why this improves speed is because the update o voltaes are doe usi a step based o the most recet update o ales, ad this teds to reduce the ecessary umber of iteratios. 8

9 4. DC ower Flow Retur to equatio, repeated here for coveiece: ~ ' ow assume all voltaes are.. The eq. becomes:... 5 So, equatio 5 becomes: 6

This equatio, whe solved ust oce = for Δθ, ad with a flat-start solutio, implies that θ=+δθ =Δθ, ad, if we assume that this solutio is the correct oe, the i other words, 7 where are the real power flow equatios for buses to evaluated at θ = i.e., the flat start, ad are the real power flow iectios ito each bus to. Therefore, 8 This ives all of the ales for the etwor with a sile solutio to a set of liear equatios. The, the real power flows ca be computed with 9 which is the power flowi across a circuit coected betwee buses ad uder coditios of a electi resistace, b small ale approximatio, ad c all voltae maitudes are..