SECTION 5: POWER FLOW. ESE 470 Energy Distribution Systems
|
|
- Magdalen Marilynn Long
- 5 years ago
- Views:
Transcription
1 SECTION 5: POWER FLOW ESE 470 Energy Distribution Systems
2 2 Introduction
3 Nodal Analysis 3 Consider the following circuit Three voltage sources VV sss, VV sss, VV sss Generic branch impedances Could be any combination of R, L, and C Three unknown node voltages VV 1, VV 2, and VV 3 Would like to analyze the circuit Determine unknown node voltages One possible analysis technique is nodal analysis
4 Nodal Analysis 4 Nodal analysis Systematic application of KCL at each unknown node Apply Ohm s law to express branch currents in terms of node voltages Sum currents at each unknown node We ll sum currents leaving each node and set equal to zero At node VV 1, we have VV 1 VV sss ZZ sss + VV 1 VV 2 ZZ 1 = 0 Every current term includes division by an impedance Easier to work with admittances instead
5 Nodal Analysis 5 Now our first nodal equation becomes VV 1 VV sss YY sss + VV 1 VV 2 YY 1 = 0 where YY sss = 1/ZZ sss and YY 1 = 1/ZZ 1 Rearranging to place all unknown node voltages on the left and all source terms on the right YY sss + YY 1 VV 1 YY 1 VV 2 = YY sss VV sss Applying KCL at node VV 2 VV 2 VV 1 YY 1 + VV 2 YY 2 + VV 2 VV sss YY sss + VV 2 VV 3 YY 3 = 0
6 Nodal Analysis 6 Rearranging YY 1 VV 1 + YY 1 + YY 2 + YY sss + YY 3 VV 2 YY 3 VV 3 = YY sss VV sss Finally, applying KCL at node VV 3, gives VV 3 VV 2 YY 3 + VV 3 VV sss YY sss = 0 YY 3 VV 2 + YY 3 + YY sss VV 3 = YY sss VV sss Note that the source terms are the Norton equivalent current sources (short-circuit currents) associated with each voltage source
7 Nodal Analysis 7 Putting the nodal equations into matrix form or where YY ss1 + YYY YY 1 0 YY 1 YY 1 + YY 2 + YY sss + YY 3 YY 3 0 YY 3 YY 3 + YY sss YYYY = II YY is the NN NN admittance matrix II is an NN 1 vector of known source currents VV is an NN 1 vector of unknown node voltages VV 1 VV 2 VV 3 = YY ss1 VV ss1 YY sss VV sss YY sss VV sss This is a system of NN (here, three) linear equations with NN unknowns We can solve for the vector of unknown voltages as VV = YY 1 II
8 The Admittance Matrix, YY 8 Take a closer look at the form of the admittance matrix, YY YY ss1 + YYY YY 1 0 YY 1 YY 1 + YY 2 + YY sss + YY 3 YY 3 = 0 YY 3 YY 3 + YY sss The elements of YY are Diagonal elements, YY kkkk : YY kkkk = sum of all admittances connected to node kk Self admittance or driving-point admittance Off-diagonal elements, YY kkkk (kk nn): YY kkkk = (total admittance between nodes kk and nn) Mutual admittance or transfer admittance YY 11 YY 12 YY 13 YY 21 YY 22 yy 23 YY 31 YY 32 YY 33 Note that, because the network is reciprocal, YY is symmetric
9 Nodal Analysis 9 Nodal analysis allows us to solve for unknown voltages given circuit admittances and current (Norton equivalent) inputs An application of Ohm s law YYYY = II A linear equation Simple, algebraic solution For power-flow analysis, things get a bit more complicated
10 10 Power-Flow Analysis
11 The Power-Flow Problem 11 A typical power system is not entirely unlike the simple circuit we just looked at Sources are generators Nodes are the system buses Buses are interconnected by impedances of transmission lines and transformers Inputs and outputs now include power (P and Q) System equations are now nonlinear Can t simply solve YYYY = II Must employ numerical, iterative solution methods Power system analysis to determine bus voltages and power flows is called power-flow analysis or load-flow analysis
12 System One-Line Diagram 12 Consider the one-line diagram for a simple power system System includes: Generators Buses Transformers Treated as equivalent circuit impedances in per-unit Transmission lines Equivalent circuit impedances Loads
13 Bus Variables 13 The buses are the system nodes Four variables associated with each bus, kk Voltage magnitude, VV kk Voltage phase angle, δδ kk Real power delivered to the bus, PP kk Reactive power delivered to the bus, QQ kk
14 Bus Power 14 Net power delivered to bus kk is the difference between power flowing from generators to bus kk and power flowing from bus kk to loads PP kk = PP GGGG PP LLLL QQ kk = QQ GGGG QQ LLLL Even though we ve introduced power flow into the analysis, we can still write nodal equations for the system Voltage and current related by the bus admittance matrix, YY bbbbbb II = YY bbbbbb VV YY bbbbbb contains the bus mutual and self admittances associated with transmission lines and transformers For an NN bus system, VV is an NN 1 vector of bus voltages II is an NN 1 vector of source currents flowing into each bus From generators and loads
15 Types of Buses 15 There are four variables associated with each bus VV kk = VV kk δδ kk = VV kk PP kk QQ kk Two variables are inputs to the power-flow problem Known Two are outputs To be calculated Buses are categorized into three types depending on which quantities are inputs and which are outputs Slack bus (swing bus) Load bus (PQ bus) Voltage-controlled bus (PV bus)
16 Bus Types 16 Slack bus (swing bus): Reference bus Typically bus 1 Inputs are voltage magnitude, VV 1, and phase angle, δδ 1 Typically Power, PP 1 and QQ 1, is computed Load bus (PPPP bus): Buses to which only loads are connected Real power, PP kk, and reactive power, QQ kk, are the knowns VV kk and δδ kk are calculated Majority of power system buses are load buses
17 Bus Types 17 Voltage-controlled bus (PPPP bus): Buses connected to generators Buses with shunt reactive compensation Real power, PP kk, and voltage magnitude, VV kk, are known inputs Reactive power, QQ kk, and voltage phase angle, δδ kk, are calculated
18 Solving the Power-Flow Problem 18 The power-flow solution involves determining: VV kk, δδ kk, PP kk, and QQ kk There are NN buses Each with two unknown quantities There are 2NN unknown quantities in total Need 2NN equations NN of these equations are the nodal equations II = YYYY The other NN equations are the power-balance equations (1) SS kk = PP kk + jjqq kk = VV kk II kk (2) From (1), the nodal equation for the kk ttt bus is II kk = NN nn=1 YY kkkk VV nn (3)
19 Solving the Power-Flow Problem 19 Substituting (3) into (2) gives PP kk + jjqq kk = VV kk NN nn=1 YY kkkk VV nn (4) The bus voltages in (3) and (4) are phasors, which we can represent as VV nn = VV nn ee jjδδ nn and VV kk = VV kk ee jjδδ kk (5) The admittances can also be written in polar form YY kkkk = YY kkkk ee jjθθ kkkk (6) Using (5) and (6) in (4) gives PP kk + jjqq kk = VV kk ee jjδδ kk NN nn=1 YY kkkk ee jjθθ kkkkvv nn ee jjδδ nn PP kk + jjqq kk = VV kk NN nn=1 YY kkkk VV nn ee jj δδ kk δδ nn θθ kkkk (7)
20 Solving the Power-Flow Problem 20 In Cartesian form, (7) becomes PP kk + jjqq kk = NN VV kk nn=1 YY kkkk VV nn [cos δδ kk δδ nn θθ kkkk +jj sin δδ kk δδ nn θθ kkkk ] (8) From (8), active power is PP kk = VV kk NN nn=1 YY kkkk VV nn cos δδ kk δδ nn θθ kkkk (9) And, reactive power is QQ kk = VV kk NN nn=1 YY kkkk VV nn sin δδ kk δδ nn θθ kkkk (10)
21 Solving the Power-Flow Problem 21 PP kk = VV kk NN nn=1 YY kkkk VV nn cos δδ kk δδ nn θθ kkkk (9) QQ kk = VV kk NN nn=1 YY kkkk VV nn sin δδ kk δδ nn θθ kkkk (10) Solving the power-flow problem amounts to finding a solution to a system of nonlinear equations, (9) and (10) Must be solved using numerical, iterative algorithms Typically Newton-Raphson In practice, commercial software packages are available for power-flow analysis E.g. PowerWorld, CYME, ETAP We ll now learn to solve the power-flow problem Numerical, iterative algorithm Newton-Raphson
22 Solving the Power-Flow Problem 22 First, we ll introduce a variety of numerical algorithms for solving equations and systems of equations Linear system of equations Direct solution Gaussian elimination Iterative solution Jacobi Gauss-Seidel Nonlinear equations Iterative solution Newton-Raphson Nonlinear system of equations Iterative solution Newton-Raphson
23 23 Linear Systems of Equations Direct Solution
24 Solving Linear Systems of Equations 24 Gaussian elimination Direct (i.e. non-iterative) solution Two parts to the algorithm: Forward elimination Back substitution
25 Gaussian Elimination 25 Consider a system of equations 4xx 1 + 7xx 3 = 5 2xx 1 3xx 2 + 5xx 3 = 12 xx 2 3xx 3 = 3 This can be expressed in matrix form: In general AA xx = yy xx 1 xx 2 xx 3 = For a system of three equations with three unknowns: AA 11 AA 12 AA 13 AA 21 AA 22 AA 23 AA 31 AA 32 AA 33 xx 1 xx 2 xx 3 = yy 1 yy 2 yy 3
26 Gaussian Elimination 26 We ll use a 3 3 system as an example to develop the Gaussian elimination algorithm AA 11 AA 12 AA 13 AA 21 AA 22 AA 23 AA 31 AA 32 AA 33 xx 1 xx 2 xx 3 = yy 1 yy 2 yy 3 First, create the augmented system matrix AA 11 AA 12 AA 13 yy 1 AA 21 AA 22 AA 23 yy 2 AA 31 AA 32 AA 33 yy 3 Each row represents and equation NN rows for NN equations Row operations do not affect the system Multiply a row by a constant Add or subtract rows from one another and replace row with the result
27 Gaussian Elimination Forward Elimination 27 Perform row operations to reduce the augmented matrix to upper triangular Only zeros below the main diagonal Eliminate xx ii from the ii + 1 st through the NN th equations for ii = 1 NN Forward elimination After forward elimination, we have AA 11 AA 12 AA 13 yy 1 0 AA 22 AA 23 yy AA 33 yy 3 Where the prime notation (e.g. AA 22 ) indicates that the value has been changed from its original value
28 Gaussian Elimination Back Substitution 28 AA 11 AA 12 AA 13 yy 1 0 AA 22 AA 23 yy AA 33 yy 3 The last row represents an equation with only a single unknown AA 33 xx 3 = yy 3 Solve for xx 3 xx3 = yy 3 AA 33 The second-to-last row represents an equation with two unknowns AA 22 xx 2 + AA 23 xx 3 Substitute in newly-found value of xx 3 Solve for xx 2 Substitute values for xx 2 and xx 3 into the first-row equation Solve for xx 1 This process is back substitution
29 Gaussian elimination 29 Gaussian elimination summary Create the augmented system matrix Forward elimination Reduce to an upper-triangular matrix Back substitution Starting with xx NN, solve for xx ii for ii = NN 1 A direct solution algorithm Exact value for each xx ii arrived at with a single execution of the algorithm Alternatively, we can use an iterative algorithm The Jacobi method
30 30 Linear Systems of Equations Iterative Solution
31 Jacobi Method 31 Consider a system of NN linear equations AA xx = yy AA 1,1 AA 1,NN AA NN,1 AA NN,NN The kk th equation (kk th row) is xx 1 xx NN = yy 1 yy NN AA kk,1 xx 1 + AA kk,2 xx AA kk,kk xx kk + + AA kk,nn xx NN = yy kk (11) Solve (11) for xx kk xx kk = 1 AA kk,kk [yy kk (AA kk,1 xx 1 + AA kk,2 xx AA kk,kk 1 xx kk 1 + (12) +AA kk,kk+1 xx kk AA kk,nn xx NN )]
32 Jacobi Method 32 Simplify (12) using summing notation xx kk = 1 AA kk,kk kk 1 NN yy kk AA kk,nn xx nn AA kk,nn xx nn, kk = 1 NN nn=1 nn=kk+1 (13) An equation for xx kk But, of course, we don t yet know all other xx nn values Use (13) as an iterative expression xx kk,ii+1 = 1 AA kk,kk kk 1 NN yy kk AA kk,nn xx nn,ii AA kk,nn xx nn,ii, kk = 1 NN nn=1 nn=kk+1 (14) The ii subscript indicates iteration number xx kk,ii+1 is the updated value from the current iteration xx nn,ii is a value from the previous iteration
33 Jacobi Method 33 xx kk,ii+1 = 1 AA kk,kk kk 1 yy kk AA kk,nn xx nn,ii nn=1 NN AA kk,nn xx nn,ii, kk = 1 NN nn=kk+1 (14) Old values of xx nn, on the right-hand side, are used to update xx kk on the left-hand side Start with an initial guess for all unknowns, xx 0 Iterate until adequate convergence is achieved Until a specified stopping criterion is satisfied Convergence is not guaranteed
34 Convergence 34 An approximation of xx is refined on each iteration Continue to iterate until we re close to the right answer for the vector of unknowns, xx Assume we ve converged to the right answer when xx changes very little from iteration to iteration On each iteration, calculate a relative error quantity εε ii = max Iterate until xx kk,ii+1 xx kk,ii xx kk,ii, kk = 1 NN εε ii εε ss where εε ss is a chosen stopping criterion
35 Jacobi Method Matrix Form 35 The Jacobi method iterative formula, (14), can be rewritten in matrix form: (15) xx ii+1 = MMxx ii + DD 1 yy where DD is the diagonal elements of A AA 1, AA DD = 2, AA NN,NN and MM = DD 1 DD AA Recall that the inverse of a diagonal matrix is given by inverting each diagonal element 1/AA 1,1 0 0 DD /AA = 2, /AA NN,NN (16)
36 Jacobi Method Example 36 Consider the following system of equations 4xx 1 + 7xx 3 = 5 2xx 1 3xx 2 + 5xx 3 = 12 xx 2 3xx 3 = 3 In matrix form: xx 1 xx 2 xx 3 = Solve using the Jacobi method
37 Jacobi Method Example 37 The iteration formula is where DD = MM = DD 1 DD AA = xx ii+1 = MMxx ii + DD 1 yy DD 1 = To begin iteration, we need a starting point Initial guess for unknown values, xx Often, we have some idea of the answer Here, arbitrarily choose xx 0 = TT
38 Jacobi Method Example 38 At each iteration, calculate xx ii+1 = MMxx ii + DD 1 yy xx 1,ii+1 xx 2,ii+1 xx 3,ii+1 = xx 1,ii xx 2,ii xx 3,ii For ii = 1: xx 1 = xx 1,1 xx 2,1 xx 3,1 = xx 1 = TT The relative error is εε 1 = max xx kk,1 xx kk,0 xx kk,0 = 0.875
39 Jacobi Method Example 39 For ii = 2: xx 2 = xx 1,2 xx 2,2 xx 3,2 = xx 2 = TT The relative error is εε 2 = max xx kk,2 xx kk,1 xx kk,1 = Continue to iterate until relative error falls below a specified stopping condition
40 Jacobi Method Example 40 Automate with computer code, e.g. MATLAB Setup the system of equations Initialize matrices and parameters for iteration
41 Jacobi Method Example 41 Loop to continue iteration as long as: Stopping criterion is not satisfied Maximum number of iterations is not exceeded On each iteration Use previous xx values to update xx Calculate relative error Increment the number of iterations
42 Jacobi Method Example 42 Set εε ss = and iterate: ii xx ii εε ii TT TT TT TT TT TT TT TT Convergence achieved in 371 iterations
43 Gauss-Seidel Method 43 The iterative formula for the Jacobi method is xx kk,ii+1 = 1 AA kk,kk kk 1 NN yy kk AA kk,nn xx nn,ii AA kk,nn xx nn,ii, kk = 1 NN nn=1 nn=kk+1 (14) Note that only old values of xx nn (i.e. xx nn,ii ) are used to update the value of xx kk Assume the xx kk,ii+1 values are determined in order of increasing kk When updating xx kk,ii+1, all xx nn,ii+1 values are already known for nn < kk We can use those updated values to calculate xx kk,ii+1 The Gauss-Seidel method
44 Gauss-Seidel Method 44 Now use the xx nn values already updated on the current iteration to update xx kk That is, xx nn,ii+1 for nn < kk Gauss-Seidel iterative formula xx kk,ii+1 = 1 AA kk,kk kk 1 NN yy kk AA kk,nn xx nn,ii+1 AA kk,nn xx nn,ii, kk = 1 NN nn=1 nn=kk+1 (17) Note that only the first summation has changed For already updated xx values xx nn for nn < kk Number of already-updated values used depends on kk
45 Gauss-Seidel Matrix Form 45 In matrix form the iterative formula is the same as for the Jacobi method where, again xx ii+1 = MMxx ii + DD 1 yy MM = DD 1 DD AA but now DD is the lower triangular part of AA DD = AA 1,1 0 0 AA 2,1 AA 2,2 0 0 AA NN,1 AA NN,2 AA NN,NN (15) (16) Otherwise, the algorithm and computer code is identical to that of the Jacobi method
46 Gauss-Seidel Example 46 Apply Gauss-Seidel to our previous example xx 0 = TT εε ss = ii xx ii εε ii TT TT TT TT TT TT Convergence achieved in 151 iterations Compared to 371 for the Jacobi method
47 47 Nonlinear Equations
48 Nonlinear Equations 48 Solution methods we ve seen so far work only for linear equations Now, we introduce an iterative method for solving a single nonlinear equation Newton-Raphson method Next, we ll apply the Newton-Raphson method to a system of nonlinear equations Finally, we ll use Newton-Raphson to solve the power-flow problem
49 Newton-Raphson Method 49 Want to solve yy = ff(xx) where ff xx is a nonlinear function That is, we want to find xx, given a known nonlinear function, ff, and a known output, yy Newton-Raphson method Based on a first-order Taylor series approximation to ff xx The nonlinear ff xx is approximated as linear to update our approximation to the solution, xx, on each iteration
50 Taylor Series Approximation 50 Taylor series approximation Given: A function, ff xx Value of the function at some value of xx, ff xx 0 Approximate: Value of the function at some other value of xx First-order Taylor series approximation Approximate ff xx using only its first derivative ff xx approximated as linear constant slope yy = ff xx ff xx 0 + dddd dddd xx=xx 0 xx xx 0 = yy
51 First-Order Taylor Series Approximation 51 Approximate value of the function at xx ff xx yy = ff xx 0 + ff xx 0 xx xx 0
52 Newton-Raphson Method 52 First order Taylor series approximation is yy ff xx 0 + ff xx 0 xx xx 0 Letting this be an equality and rearranging gives an iterative formula for updating an approximation to xx yy = ff xx ii + ff xx ii xx ii+1 xx ii ff xx ii xx ii+1 xx ii = yy ff xx ii xx ii+1 = xx ii + 1 ff xx ii yy ff xx ii (18) Initialize with a best guess at xx, xx 0 Iterate (18) until A stopping criterion is satisfied, or The maximum number of iterations is reached
53 First-Order Taylor Series Approximation 53 xx ii+1 = xx ii + 1 ff xx ii yy ff xx ii Now using the Taylor series approximation in a different way Not approximating the value of y = f(x) at x, but, instead Approximating the value of x where f(x) = y
54 Newton-Raphson Example 54 Consider the following nonlinear equation yy = ff xx = xx = 20 Apply Newton-Raphson to solve Find xx, such that yy = ff xx = 20 The derivative function is Initial guess for xx ff xx = 3xx 2 xx 0 = 1 Iterate using the formula given by (18)
55 Newton-Raphson Example 55 ii = 1: xx 1 = xx 0 + ff xx 0 1 yy ff xx 0 xx 1 = xx 1 = 4 εε 1 = xx 1 xx 0 xx 0 εε 1 = = 3 xx 1 = 4, εε 1 = 3
56 Newton-Raphson Example 56 ii = 2: xx 2 = xx 1 + ff xx 1 1 yy ff xx 1 xx 2 = xx 2 = εε 2 = xx 2 xx 1 xx 1 εε 2 = εε 2 = xx 2 = 2.875, εε 2 = 0.281
57 Newton-Raphson Example 57 ii = 3: xx 3 = xx 2 + ff xx 2 1 yy ff xx 2 xx 3 = xx 3 = 2.32 εε 3 = xx 3 xx 2 xx 2 εε 3 = εε 3 = xx 3 = 2.32, εε 3 = 0.193
58 Newton-Raphson Example 58 ii = 4: ii = 5: ii = 6: ii = 7: xx 4 = 2.166, εε 4 = xx 5 = 2.155, εε 5 = xx 6 = 2.154, εε 6 = xx 7 = 2.154, εε 7 = Convergence achieved very quickly Next, we ll see how to apply Newton-Raphson to a system of nonlinear equations
59 59 Nonlinear Systems of Equations
60 Nonlinear Systems of Equations 60 Now, consider a system of nonlinear equations Can be represented as a vector of NN functions Each is a function of an NN-vector of unknown variables yy = yy 1 yy 2 yy NN = ff xx = ff 1 xx 1, xx 2,, xx NN ff 2 xx 1, xx 2,, xx NN ff NN xx 1, xx 2,, xx NN We can again approximate this function using a first-order Taylor series yy = ff xx ff xx 0 + ff xx 0 xx xx 0 (19) Note that all variables are NN-vectors ff is an NN-vector of known, nonlinear functions xx is an NN-vector of unknown values this is what we want to solve for yy is an NN-vector of known values xx 00 is an NN-vector of xx values for which ff xx 0 is known
61 Newton-Raphson Method 61 Equation (19) is the basis for our Newton-Raphson iterative formula Again, let it be an equality and solve for xx yy ff xx 0 = ff xx 0 xx xx 0 ff xx 11 0 yy ff xx 0 = xx xx 0 xx = xx 0 + ff xx 11 0 yy ff xx 0 This last expression can be used as an iterative formula xx ii+1 = xx ii + ff xx ii 11 yy ff xx ii The derivative term on the right-hand side of (20) is an NN NN matrix The Jacobian matrix, JJ xx ii+1 = xx ii + JJ ii 11 yy ff xx ii (20)
62 The Jacobian Matrix 62 xx ii+1 = xx ii + JJ ii 11 yy ff xx ii (20) Jacobian matrix NN NN matrix of partial derivatives for ff xx Evaluated at the current value of xx, xx ii JJ ii = ff 1 ff 1 ff 1 xx 1 xx 2 xx NN ff 2 ff 2 ff 2 xx 1 xx 2 xx NN ff NN ff NN ff NN xx 1 xx 2 xx NN xx=xx ii
63 Newton-Raphson Method 63 xx ii+1 = xx ii + JJ ii 11 yy ff xx ii We could iterate (20) until convergence or a maximum number of iterations is reached Requires inversion of the Jacobian matrix Computationally expensive and error prone Instead, go back to the Taylor series approximation (20) yy = ff xx ii yy ff xx ii + JJ ii xx ii+1 xx ii = JJ ii xx ii+1 xx ii Left side of (21) represents a difference between the known and approximated outputs Right side represents an increment of the approximation for xx (21) Δyy ii = JJ ii Δxx ii (22)
64 Newton-Raphson Method 64 Δyy ii = JJ ii Δxx ii (22) On each iteration: Compute Δyy ii and JJ ii Solve for Δxx ii using Gaussian elimination Matrix inversion not required Computationally robust Update xx xx ii+1 = xx ii + Δxx ii (23)
65 Newton-Raphson Example 65 Apply Newton-Raphson to solve the following system of nonlinear equations ff xx = yy xx xx 2 xx 1 xx 2 = TT Initial condition: xx 0 = 1 Stopping criterion: εε ss = Jacobian matrix JJ ii = ff 1 ff 1 xx 1 xx 2 = ff 2 ff 2 xx 1 xx 2 xx=xx ii 2xx 1,ii 3 xx 2,ii xx 1,ii
66 Newton-Raphson Example 66 Δyy ii = JJ ii Δxx ii xx ii+1 = xx ii + Δxx ii (22) (23) Adjusting the indexing, we can equivalently write (22) and (23) as: Δyy ii 1 = JJ ii 1 Δxx ii 1 xx ii = xx ii 1 + Δxx ii 1 (22) (23) For iteration ii: Compute Δyy ii 1 and JJ ii 1 Solve (22) for Δxx ii 1 Update xx using (23)
67 Newton-Raphson Example 67 ii = 1: Δyy 0 = yy ff xx 0 = = JJ 0 = 2xx 1,0 3 xx 2,0 xx = 2 3 1,0 2 1 Δxx 0 = 4 2 xx 1 = xx 0 + Δxx 0 = = 5 4 εε 1 = max xx kk,1 xx kk,0 xx kk,0, kk = 1 NN xx 1 = 5 4, εε 1 = 4
68 Newton-Raphson Example 68 ii = 2: Δyy 1 = yy ff xx 1 = = 16 8 JJ 1 = 2xx 1,1 3 xx 2,1 xx = ,1 4 5 Δxx 1 = xx 2 = xx 1 + Δxx 1 = = εε 2 = max xx kk,2 xx kk,1 xx kk,1, kk = 1 NN xx 2 = , εε 2 = 0.295
69 Newton-Raphson Example 69 ii = 3: Δyy 2 = yy ff xx 2 = = JJ 2 = 2xx 1,2 3 xx 2,2 xx = , Δxx 2 = xx 3 = xx 2 + Δxx 2 = = εε 3 = max xx kk,3 xx kk,2 xx kk,2, kk = 1 NN xx 3 = , εε 3 = 0.116
70 Newton-Raphson Example 70 ii = 7: Δyy 6 = yy ff xx 6 = JJ 6 = 2xx 1,6 3 xx 2,6 xx 1,6 = = Δxx 6 = xx 7 = xx 6 + Δxx 6 = = εε 7 = max xx kk,7 xx kk,6 xx kk,6, kk = 1 NN xx 7 = , εε 7 =
71 Newton-Raphson MATLAB Code 71 Define the system of equations Initialize xx Set up solution parameters
72 Newton-Raphson MATLAB Code 72 Iterate: Compute Δyy ii 1 and JJ ii 1 Solve for Δxx ii 1 Update xx
73 73 Solving the Power-Flow Problem
74 Solving the Power-Flow Problem - Overview 74 Consider an NN-bus power-flow problem 1 slack bus nn PPPP PV buses nn PPPP PQ buses NN = nn PPPP + nn PPPP + 1 Each bus has two unknown quantities Two of VV kk, δδ kk, PP kk, and QQ kk For the N-R power-flow problem, VV kk and δδ kk are the unknown quantities These are the inputs to the nonlinear system of equations the PP kk and QQ kk equations of (9) and (10) Finding unknown VV kk and δδ kk values allows us to determine unknown PP kk and QQ kk values
75 Solving the Power-Flow Problem - Overview 75 The nonlinear system of equations is yy = ff(xx) The unknowns, xx, are bus voltages Unknown phase angles from PV and PQ buses Unknown magnitudes from PQ bus xx = δδ VV = δδ 2 δδ nnpppp +nn PPPP +1 VV nnpppp +2 VV nnpppp +nn PPPP +1 nn PPPP + nn PPPP nn PPPP (24)
76 Solving the Power-Flow Problem - Overview 76 yy = ff(xx) The knowns, yy, are bus powers Known real power from PV and PQ buses Known reactive power from PQ bus yy = PP QQ = PP 2 PP nnpppp +nn PPPP +1 QQ nnpppp +2 QQ nnpppp +nn PPPP +1 nn PPPP + nn PPPP nn PPPP (25)
77 Solving the Power-Flow Problem - Overview 77 yy = ff(xx) The system of equations, ff, consists of the nonlinear functions for PP and QQ Nonlinear functions of VV and δδ ff(xx) = PP(xx) QQ(xx) = PP 2 xx QQ nnpppp +2 xx nn PPPP + nn PPPP nn PPPP (26)
78 Solving the Power-Flow Problem - Overview 78 PP kk xx and QQ kk xx are given by NN PP kk = VV kk nn=1 NN QQ kk = VV kk nn=1 YY kkkk VV nn cos δδ kk δδ nn θθ kkkk YY kkkk VV nn sin δδ kk δδ nn θθ kkkk (9) (10) Admittance matrix terms are YY kkkk = YY kkkk θθ kkkk
79 Solving the Power-Flow Problem - Overview 79 The iterative N-R formula is xx ii+1 = xx ii + Δxx ii The increment term, Δxx ii, is computed through Gaussian elimination of Δyy ii = JJ ii Δxx ii The Jacobian, JJ ii, is computed on each iteration The power mismatch vector is Δyy ii = yy ff xx ii yy is the vector of known powers, as given in (25) ff xx ii are the PP and QQ equations given by (9) and (10)
80 Solving the Power-Flow Problem - Procedure 80 The following procedure shows how to set up and solve the power-flow problem using the N-R algorithm 1. Order and number buses Slack bus is #1 Group all PV buses together next Group all PQ buses together last 2. Generate the bus admittance matrix, YY And magnitude, Y = YY, and angle, θ = YY, matrices
81 Solving the Power-Flow Problem - Procedure Initialize known quantities Slack bus: VV 1 and δδ 1 PV buses: VV kk and PP kk PQ buses: PP kk and QQ kk Output vector: yy = PP QQ 4. Initialize unknown quantities xx oo = δδ 00 VV 00 = nn PPPP + nn PPPP nn PPPP (24)
82 Solving the Power-Flow Problem - Procedure Set up Newton-Raphson parameters Tolerance for convergence, reltol Maximum # of iterations, max_iter Initialize relative error: εε 0 > reltol, e.g. εε 0 = 10 Initialize iteration counter: ii = 0 6. while (εε > reltol) && (ii < max_iter) Update bus voltage phasor vector, VV ii, using magnitude and phase values from xx ii and from knowns Calculate the current injected into each bus, a vector of phasors II ii = YY VV ii
83 Solving the Power-Flow Problem - Procedure while (εε > reltol) && (ii < max_iter) cont d Calculate complex, real, and reactive power injected into each bus This can be done using VV ii and II ii vectors and element-by-element multiplication (the.* operator in MATLAB) SS kk,ii = VV kk,ii II kk,ii PP kk,ii = RRRR SS kk,ii QQ kk,ii = IIII SS kk,ii Create ff xx ii from PP ii and QQ ii vectors Calculate power mismatch, Δyy ii Δyy ii = yy ff xx ii Compute the Jacobian, JJ ii, using voltage magnitudes and phase angles from VV ii
84 Solving the Power-Flow Problem - Procedure while (εε > reltol) && (ii < max_iter) cont d Solve for Δxx ii using Gaussian elimination Δyy ii = JJ ii Δxx ii Use the mldivide (\, backslash) operator in MATLAB: Δxx ii = JJ ii \Δyy ii Update xx xx ii+1 = xx ii + Δxx ii Check for convergence using power mismatch εε ii+1 = max yy kk ff kk xx yy kk Update the number of iterations ii = ii + 1
85 The Jacobian Matrix 85 The Jacobian matrix has four quadrants of varying dimension depending on the number of different types of buses: nn PPPP + nn PPPP nn PPPP PP PP JJ = δδ JJ1 VV JJ2 nn PPPP + nn PPPP QQ δδ QQ VV nn PPPP JJ3 JJ4
86 The Jacobian Matrix 86 Jacobian elements are partial derivatives of (9) and (10) with respect to δδ or VV Formulas for the Jacobian elements: nn kk JJ1 kkkk = PP kk δδ nn = VV kk YY kkkk VV nn sin δδ kk δδ nn θθ kkkk (27) JJ2 kkkk = PP kk VV nn = VV kk YY kkkk cos δδ kk δδ nn θθ kkkk (28) JJ3 kkkk = QQ kk δδ nn = VV kk YY kkkk VV nn cos δδ kk δδ nn θθ kkkk (29) JJ4 kkkk = QQ kk VV nn = VV kk YY kkkk sin δδ kk δδ nn θθ kkkk (30)
87 The Jacobian Matrix 87 Formulas for the Jacobian elements, cont d: nn = kk NN JJ1 kkkk = PP kk δδ kk = VV kk nn=1 nn kk YY kknn VV nn sin δδ kk δδ nn θθ kkkk (31) JJ2 kkkk = PP kk VV kk = VV kk YY kkkk cos θθ kkkk NN + YY kknn VV nn cos δδ kk δδ nn θθ kkkk nn=1 (32) JJ3 kkkk = QQ NN kk = VV δδ kk YY kknn VV nn cos δδ kk δδ nn θθ kkkk kk nn=1 nn kk (33) JJ4 kkkk = QQ kk VV kk = VV kk YY kkkk sin θθ kkkk NN + YY kkkk VV nn sin δδ kk δδ nn θθ kkkk nn=1 (34)
88 88 Power-Flow Solution Example
89 Power-Flow Solution Buses 89 Determine all bus voltages and power flows for the following threebus power system Three buses, nn PPPP = 1, nn PPPP = 1, ordered PV first, then PQ: Bus 1: slack bus VV 1 and δδ 1 are known, find PP 1 and QQ 1 Bus 2: PV bus PP 2 and VV 2 are known, find δδ 2 and QQ 2 Bus 3: PQ bus PP 3 and QQ 3 are known, find VV 3 and δδ 3
90 Power-Flow Solution Admittance Matrix 90 Per-unit, per-length impedance of all transmission lines: zz = jjjjj 10 6 pppp/kkkk Admittance of each line: 1 YY 12 = YY 23 = = 2.06 jjjj.9 pppp zz 150 kkkk 1 YY 13 = = 1.54 jj15.7 pppp zz 200 kkkk
91 Power-Flow Solution Admittance Matrix 91 The admittance matrix (see p. 8): YY = YY 11 YY 12 YY 13 YY 21 YY 22 YY 23 = YY 31 YY 32 YY jjjj jjjj jjjj jjjj jjjj jjjj jjjj jjjj jjjj.6 Admittance magnitude and angle matrices: Y = YY = , θθ =
92 Power-Flow Solution Initialize Knowns 92 Known quantities Slack bus: VV 1 = 1.0 pppp, δδ 1 = 0 PV bus: VV 2 = 1.05 pppp, PP 2 = 2.0 pppp PQ bus: PP 3 = 5.0 pppp, QQ 3 = 1.0 pppp Output vector yy = PP QQ = PP 2 PP 3 QQ 3 =
93 Power-Flow Solution Initialize Unknowns 93 The vector of unknown quantities to be solved for is xx = δδ VV = δδ 2 δδ 3 VV 3 Initialize all unknown bus voltage phasors to VV kk = pppp xx 0 = δδ 0 VV 0 = δδ 2,0 δδ 3,0 VV 3,0 = The complete vector of bus voltage phasors partly known, partly unknown is VV = VV 1 δδ 1 VV 2 δδ 2 VV 3 δδ 3 = δδ 2,0 VV 3,0 δδ 3,0 =
94 Power-Flow Solution Jacobian Matrix 94 The Jacobian matrix for this system is JJ = PP 2 δδ 2 PP 2 δδ 3 PP 2 VV 3 PP 3 δδ 2 PP 3 δδ 3 PP 3 VV 3 QQ 3 δδ 2 QQ 3 δδ 3 QQ 3 VV 3 This matrix will be computed on each iteration using the current approximation to the vector of unknowns, xx ii
95 Power-Flow Solution Set Up and Iterate 95 Set up N-R iteration parameters reltol = 1e-6 max_iter = 1e3 εε 0 = 10 ii = 0 Iteratively update the approximation to the vector of unknowns as long as Stopping criterion is not satisfied εε ii > εε ss Maximum number of iterations is not exceeded ii mmmmmm _iiiiiiii
96 Power-Flow Solution Iterate 96 ii = 0: Vector of bus voltage phasors VV 0 = VV 1 δδ 1 VV 2 δδ 2,0 VV 3,0 δδ 3,0 = Current injected into each bus II 0 = II 0 = YY VV jjjj jjjj jjjj jjjj jjjj jjjj jjjj jjjj jjjj II 0 =
97 Power-Flow Solution Iterate 97 ii = 0: Complex power injected into each bus SS 0 = VV 0. II 0 SS 0 = SS 0 = jjj jjj jjj Real and reactive power PP 0 = , QQ 0 =
98 Power-Flow Solution Iterate 98 ii = 0: Power mismatch Δyy 0 = yy ff xx 0 Δyy 0 = Next, compute the Jacobian matrix = JJ 0 = PP 2 δδ 2 PP 2 δδ 3 PP 2 VV 3 PP 3 δδ 2 PP 3 δδ 3 PP 3 VV 3 QQ 3 δδ 2 QQ 3 δδ 3 QQ 3 VV 3 xx=xx 0
99 Power-Flow Solution Iterate 99 ii = 0: Elements of the Jacobian matrix are computed using VV and δδ values from VV 0 and YY and θθ values from YY: VV 0 = δδ 0 = YY = θθ =
100 Power-Flow Solution Iterate 100 ii = 0: Jacobian, JJ1 PP 2 δδ 2 = VV 2 YY 21 VV 1 sin δδ 2 δδ 1 θθ 21 + YY 23 VV 3 sin δδ 2 δδ 3 θθ 23 PP 3 δδ 3 = VV 3 YY 31 VV 1 sin δδ 3 δδ 1 θθ 31 + YY 32 VV 2 sin δδ 3 δδ 2 θθ 32 PP 2 δδ 3 = VV 2 YY 23 VV 3 sin δδ 2 δδ 3 θθ 23 PP 3 δδ 2 = VV 3 YY 32 VV 2 sin δδ 3 δδ 2 θθ 32
101 Power-Flow Solution Iterate 101 ii = 0: Jacobian, JJ2 PP 2 VV 3 = VV 2 YY 23 cos δδ 2 δδ 3 θθ 23 PP 3 VV 3 = 2 VV 3 YY 33 cos θθ 33 + Jacobian, JJ3 YY 31 VV 1 cos δδ 3 δδ 1 θθ 31 + YY 32 VV 2 cos δδ 3 δδ 2 θθ 32 QQ 3 δδ 2 = VV 3 YY 32 VV 2 cos δδ 3 δδ 2 θθ 32 QQ 3 δδ 3 = VV 3 YY 31 VV 1 cos δδ 3 δδ 1 θθ 31 + YY 32 VV 2 cos δδ 3 δδ 2 θθ 32
102 Power-Flow Solution Iterate 102 ii = 0: Jacobian, JJ4 PP 2 VV 3 = VV 2 YY 23 cos δδ 2 δδ 3 θθ 23 QQ 3 VV 3 = VV 3 YY 33 cos θθ 33 + YY 31 VV 1 cos δδ 3 δδ 1 θθ 31 + YY 32 VV 2 cos δδ 3 δδ 2 θθ 32 Evaluating the Jacobian expressions using VV and δδ values from VV 0 and YY and θθ values from YY, gives JJ 0 =
103 Power-Flow Solution Iterate 103 ii = 0: Use Gaussian elimination to solve for Δxx 0 Δyy 0 = JJ 0 Δxx 0 = Δxx 0 = Update the vector of unknowns, xx Δxx 1,0 Δxx 2,0 Δxx 3,0 = xx 1 = xx 0 + Δxx 0 = =
104 Power-Flow Solution Iterate 104 ii = 0: Use power mismatch to check for convergence εε 0 = max yy kk ff kk xx yy kk = Move on to the next iteration, ii = 1 Create VV 1 using xx 1 values Calculate II 1 Calculate SS 1, PP 1, QQ 1 Create ff xx 1 from PP 1 and QQ 1 Calculate Δyy 1, JJ 1, Δxx 1 Update xx to xx 2 Check for convergence
105 Power-Flow Solution 105 Convergence is achieved after four iterations VV 4 = , SS 4 = 3.08 jjj jjj jjj.0 εε 4 =
EE 581 Power Systems. Admittance Matrix: Development, Direct and Iterative solutions
EE 581 Power Systems Admittance Matrix: Development, Direct and Iterative solutions Overview and HW # 8 Chapter 2.4 Chapter 6.4 Chapter 6.1-6.3 Homework: Special Problem 1 and 2 (see handout) Overview
More information= V I = Bus Admittance Matrix. Chapter 6: Power Flow. Constructing Ybus. Example. Network Solution. Triangular factorization. Let
Chapter 6: Power Flow Network Matrices Network Solutions Newton-Raphson Method Fast Decoupled Method Bus Admittance Matri Let I = vector of currents injected into nodes V = vector of node voltages Y bus
More informationSECTION 7: FAULT ANALYSIS. ESE 470 Energy Distribution Systems
SECTION 7: FAULT ANALYSIS ESE 470 Energy Distribution Systems 2 Introduction Power System Faults 3 Faults in three-phase power systems are short circuits Line-to-ground Line-to-line Result in the flow
More informationELEC4612 Power System Analysis Power Flow Analysis
ELEC462 Power Sstem Analsis Power Flow Analsis Dr Jaashri Ravishankar jaashri.ravishankar@unsw.edu.au Busbars The meeting point of various components of a PS is called bus. The bus or busbar is a conductor
More information10.4 The Cross Product
Math 172 Chapter 10B notes Page 1 of 9 10.4 The Cross Product The cross product, or vector product, is defined in 3 dimensions only. Let aa = aa 1, aa 2, aa 3 bb = bb 1, bb 2, bb 3 then aa bb = aa 2 bb
More informationELEC273 Lecture Notes Set 11 AC Circuit Theorems
ELEC273 Lecture Notes Set C Circuit Theorems The course web site is: http://users.encs.concordia.ca/~trueman/web_page_273.htm Final Exam (confirmed): Friday December 5, 207 from 9:00 to 2:00 (confirmed)
More informationQ. 1 Q. 25 carry one mark each.
Q. 1 Q. 25 carry one mark each. Q.1 Given ff(zz) = gg(zz) + h(zz), where ff, gg, h are complex valued functions of a complex variable zz. Which one of the following statements is TUE? (A) If ff(zz) is
More informationWorksheets for GCSE Mathematics. Algebraic Expressions. Mr Black 's Maths Resources for Teachers GCSE 1-9. Algebra
Worksheets for GCSE Mathematics Algebraic Expressions Mr Black 's Maths Resources for Teachers GCSE 1-9 Algebra Algebraic Expressions Worksheets Contents Differentiated Independent Learning Worksheets
More informationSECTION 8: ROOT-LOCUS ANALYSIS. ESE 499 Feedback Control Systems
SECTION 8: ROOT-LOCUS ANALYSIS ESE 499 Feedback Control Systems 2 Introduction Introduction 3 Consider a general feedback system: Closed-loop transfer function is KKKK ss TT ss = 1 + KKKK ss HH ss GG ss
More informationCHAPTER 2 LOAD FLOW ANALYSIS FOR RADIAL DISTRIBUTION SYSTEM
16 CHAPTER 2 LOAD FLOW ANALYSIS FOR RADIAL DISTRIBUTION SYSTEM 2.1 INTRODUCTION Load flow analysis of power system network is used to determine the steady state solution for a given set of bus loading
More informationPower Flow Analysis of Radial Distribution System using Backward/Forward Sweep Method
Power Flow Analysis of Radial Distribution System using Backward/Forward Sweep Method Gurpreet Kaur 1, Asst. Prof. Harmeet Singh Gill 2 1,2 Department of Electrical Engineering, Guru Nanak Dev Engineering
More informationComparison of Power Flow Algorithms for inclusion in On-line Power Systems Operation Tools
University of New Orleans ScholarWorks@UNO University of New Orleans Theses and Dissertations Dissertations and Theses 12-17-2010 Comparison of Power Flow Algorithms for inclusion in On-line Power Systems
More information7.3 The Jacobi and Gauss-Seidel Iterative Methods
7.3 The Jacobi and Gauss-Seidel Iterative Methods 1 The Jacobi Method Two assumptions made on Jacobi Method: 1.The system given by aa 11 xx 1 + aa 12 xx 2 + aa 1nn xx nn = bb 1 aa 21 xx 1 + aa 22 xx 2
More informationB.E. / B.Tech. Degree Examination, April / May 2010 Sixth Semester. Electrical and Electronics Engineering. EE 1352 Power System Analysis
B.E. / B.Tech. Degree Examination, April / May 2010 Sixth Semester Electrical and Electronics Engineering EE 1352 Power System Analysis (Regulation 2008) Time: Three hours Answer all questions Part A (10
More information8. Active Filters - 2. Electronic Circuits. Prof. Dr. Qiuting Huang Integrated Systems Laboratory
8. Active Filters - 2 Electronic Circuits Prof. Dr. Qiuting Huang Integrated Systems Laboratory Blast From The Past: Algebra of Polynomials * PP xx is a polynomial of the variable xx: PP xx = aa 0 + aa
More information1. Introduction. Keywords Transient Stability Analysis, Power System, Swing Equation, Three-Phase Fault, Fault Clearing Time
Energy and Power 17, 7(1): -36 DOI: 1.593/j.ep.1771.3 Numerical Simulations for Transient Stability Analysis of Two-Machine Power System Considering Three-Phase Fault under Different Fault Clearing Times
More informationPower System Analysis Prof. A. K. Sinha Department of Electrical Engineering Indian Institute of Technology, Kharagpur. Lecture - 21 Power Flow VI
Power System Analysis Prof. A. K. Sinha Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Power Flow VI (Refer Slide Time: 00:57) Welcome to lesson 21. In this
More informationKINGS COLLEGE OF ENGINEERING Punalkulam
KINGS COLLEGE OF ENGINEERING Punalkulam 613 303 DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING POWER SYSTEM ANALYSIS QUESTION BANK UNIT I THE POWER SYSTEM AN OVERVIEW AND MODELLING PART A (TWO MARK
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More information10.1 Three Dimensional Space
Math 172 Chapter 10A notes Page 1 of 12 10.1 Three Dimensional Space 2D space 0 xx.. xx-, 0 yy yy-, PP(xx, yy) [Fig. 1] Point PP represented by (xx, yy), an ordered pair of real nos. Set of all ordered
More informationEnhanced Newton Method Based Radial Distribution System Load Flow Analysis with Extrapolation Techniques
Enhanced Newton Method Based Radial Distribution System Load Flow Analysis with Extrapolation Techniques Asst. Prof. Dr. Hassan Kuhba Electrical Engineering Department, Engineering College/Baghdad University,
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 207 Philippe B. Laval (KSU) Linear Systems Fall 207 / 2 Introduction We continue looking how to solve linear systems of the
More informationClassical RSA algorithm
Classical RSA algorithm We need to discuss some mathematics (number theory) first Modulo-NN arithmetic (modular arithmetic, clock arithmetic) 9 (mod 7) 4 3 5 (mod 7) congruent (I will also use = instead
More informationSECTION 2: VECTORS AND MATRICES. ENGR 112 Introduction to Engineering Computing
SECTION 2: VECTORS AND MATRICES ENGR 112 Introduction to Engineering Computing 2 Vectors and Matrices The MAT in MATLAB 3 MATLAB The MATrix (not MAThematics) LABoratory MATLAB assumes all numeric variables
More informationPowerApps Optimal Power Flow Formulation
PowerApps Optimal Power Flow Formulation Page1 Table of Contents 1 OPF Problem Statement... 3 1.1 Vector u... 3 1.1.1 Costs Associated with Vector [u] for Economic Dispatch... 4 1.1.2 Costs Associated
More informationMathematics Ext 2. HSC 2014 Solutions. Suite 403, 410 Elizabeth St, Surry Hills NSW 2010 keystoneeducation.com.
Mathematics Ext HSC 4 Solutions Suite 43, 4 Elizabeth St, Surry Hills NSW info@keystoneeducation.com.au keystoneeducation.com.au Mathematics Extension : HSC 4 Solutions Contents Multiple Choice... 3 Question...
More informationNotes for course EE1.1 Circuit Analysis TOPIC 10 2-PORT CIRCUITS
Objectives: Introduction Notes for course EE1.1 Circuit Analysis 4-5 Re-examination of 1-port sub-circuits Admittance parameters for -port circuits TOPIC 1 -PORT CIRCUITS Gain and port impedance from -port
More informationToday s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn
Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear
More informationLesson 1: Successive Differences in Polynomials
Lesson 1 Lesson 1: Successive Differences in Polynomials Classwork Opening Exercise John noticed patterns in the arrangement of numbers in the table below. 2.4 3.4 4.4 5.4 6.4 5.76 11.56 19.36 29.16 40.96
More informationLecture 6. Notes on Linear Algebra. Perceptron
Lecture 6. Notes on Linear Algebra. Perceptron COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne This lecture Notes on linear algebra Vectors
More informationEE2351 POWER SYSTEM ANALYSIS UNIT I: INTRODUCTION
EE2351 POWER SYSTEM ANALYSIS UNIT I: INTRODUCTION PART: A 1. Define per unit value of an electrical quantity. Write equation for base impedance with respect to 3-phase system. 2. What is bus admittance
More information(1) Introduction: a new basis set
() Introduction: a new basis set In scattering, we are solving the S eq. for arbitrary VV in integral form We look for solutions to unbound states: certain boundary conditions (EE > 0, plane and spherical
More informationLecture No. 5. For all weighted residual methods. For all (Bubnov) Galerkin methods. Summary of Conventional Galerkin Method
Lecture No. 5 LL(uu) pp(xx) = 0 in ΩΩ SS EE (uu) = gg EE on ΓΓ EE SS NN (uu) = gg NN on ΓΓ NN For all weighted residual methods NN uu aaaaaa = uu BB + αα ii φφ ii For all (Bubnov) Galerkin methods ii=1
More informationPOWER flow studies are the cornerstone of power system
University of Wisconsin-Madison Department of Electrical and Computer Engineering. Technical Report ECE-2-. A Sufficient Condition for Power Flow Insolvability with Applications to Voltage Stability Margins
More informationPHY103A: Lecture # 4
Semester II, 2017-18 Department of Physics, IIT Kanpur PHY103A: Lecture # 4 (Text Book: Intro to Electrodynamics by Griffiths, 3 rd Ed.) Anand Kumar Jha 10-Jan-2018 Notes The Solutions to HW # 1 have been
More informationWork, Energy, and Power. Chapter 6 of Essential University Physics, Richard Wolfson, 3 rd Edition
Work, Energy, and Power Chapter 6 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 With the knowledge we got so far, we can handle the situation on the left but not the one on the right.
More informationChapter 22 : Electric potential
Chapter 22 : Electric potential What is electric potential? How does it relate to potential energy? How does it relate to electric field? Some simple applications What does it mean when it says 1.5 Volts
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 3 Chapter 10 LU Factorization PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
More informationState Estimation and Power Flow Analysis of Power Systems
JOURNAL OF COMPUTERS, VOL. 7, NO. 3, MARCH 01 685 State Estimation and Power Flow Analysis of Power Systems Jiaxiong Chen University of Kentucky, Lexington, Kentucky 40508 U.S.A. Email: jch@g.uky.edu Yuan
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Upper-triangular Linear Systems We will now develop the back-substitution algorithm, which is useful for solving a linear system of equations that has
More informationA new procedure for sensitivity testing with two stress factors
A new procedure for sensitivity testing with two stress factors C.F. Jeff Wu Georgia Institute of Technology Sensitivity testing : problem formulation. Review of the 3pod (3-phase optimal design) procedure
More informationNew Methods for Solving Systems of Nonlinear Equations in Electrical Network Analysis
Electrical and Electronic Engineering 2014, 4(1): 1-9 DOI: 10.5923/j.eee.20140401.01 New Methods for Solving Systems of Nonlinear Equations in Electrical Network Analysis Rubén Villafuerte D. 1,*, Rubén
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous)
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK Course Name : Computer Methods in Power Systems Course Code : A60222
More informationControl of Mobile Robots
Control of Mobile Robots Regulation and trajectory tracking Prof. Luca Bascetta (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Organization and
More informationIncorporation of Asynchronous Generators as PQ Model in Load Flow Analysis for Power Systems with Wind Generation
Incorporation of Asynchronous Generators as PQ Model in Load Flow Analysis for Power Systems with Wind Generation James Ranjith Kumar. R, Member, IEEE, Amit Jain, Member, IEEE, Power Systems Division,
More informationReview of matrices. Let m, n IN. A rectangle of numbers written like A =
Review of matrices Let m, n IN. A rectangle of numbers written like a 11 a 12... a 1n a 21 a 22... a 2n A =...... a m1 a m2... a mn where each a ij IR is called a matrix with m rows and n columns or an
More informationNETWORK MATRICES. voltages through the branch impedance matrix and branch admittance matrix: ELOOP = ZLOOP ILOOP ILOOP = YLOOP ELOOP (11)
NETWORK MATRICES 2. FORMATION OF Y BUS AND Z BUS The bus admittance matrix, YBUS plays a very important role in computer aided power system analysis. It can be formed in practice by either of the methods
More informationChapter 10 Sinusoidal Steady State Analysis Chapter Objectives:
Chapter 10 Sinusoidal Steady State Analysis Chapter Objectives: Apply previously learn circuit techniques to sinusoidal steady-state analysis. Learn how to apply nodal and mesh analysis in the frequency
More informationVoltage Instability Analysis Using P-V or Q-V Analysis. Weili Yi
Voltage Instability Analysis Using P-V or Q-V Analysis by Weili Yi A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science Approved April 2017 by the Graduate Supervisory
More informationUNIT II SOLUTION OF NON-LINEAR AND SIMULTANEOUS LINEAR EQUATION
UNIT II SOLUTION OF NON-LINEAR AND SIMULTANEOUS LINEAR EQUATION. If g x is continuous in a, b, then under what condition the iterative method x = g x has a unique solution in a, b? g x < in a, b. State
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Linear Systems Fall 2015 1 / 12 Introduction We continue looking how to solve linear systems of
More information2 NETWORK FORMULATION
NTWRK FRMUATN NTRDUCTRY RMARKS For performing any power system studies on the digital computer, the first step is to construct a suitable mathematical model of the power system network The mathematical
More informationSupport Vector Machines. CSE 4309 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Support Vector Machines CSE 4309 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 A Linearly Separable Problem Consider the binary classification
More informationAnalytical Study Based Optimal Placement of Energy Storage Devices in Distribution Systems to Support Voltage and Angle Stability
University of Wisconsin Milwaukee UWM Digital Commons Theses and Dissertations June 2017 Analytical Study Based Optimal Placement of Energy Storage Devices in Distribution Systems to Support Voltage and
More information3. Mathematical Modelling
3. Mathematical Modelling 3.1 Modelling principles 3.1.1 Model types 3.1.2 Model construction 3.1.3 Modelling from first principles 3.2 Models for technical systems 3.2.1 Electrical systems 3.2.2 Mechanical
More informationLecture 3 Optimization methods for econometrics models
Lecture 3 Optimization methods for econometrics models Cinzia Cirillo University of Maryland Department of Civil and Environmental Engineering 06/29/2016 Summer Seminar June 27-30, 2016 Zinal, CH 1 Overview
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationEE2351 POWER SYSTEM ANALYSIS
EE351 POWER SYSTEM ANALYSIS A.Ahamed Riazudeen EEE DEPARTMENT 1 UNIT I INTRODUCTION Power system network 3 SINGLE LINE DIAGRAM It is a diagrammatic representation of a power system in which the components
More informationGeneral Strong Polarization
General Strong Polarization Madhu Sudan Harvard University Joint work with Jaroslaw Blasiok (Harvard), Venkatesan Gurswami (CMU), Preetum Nakkiran (Harvard) and Atri Rudra (Buffalo) December 4, 2017 IAS:
More informationAn Accelerated Block-Parallel Newton Method via Overlapped Partitioning
An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper
More informationWorksheets for GCSE Mathematics. Quadratics. mr-mathematics.com Maths Resources for Teachers. Algebra
Worksheets for GCSE Mathematics Quadratics mr-mathematics.com Maths Resources for Teachers Algebra Quadratics Worksheets Contents Differentiated Independent Learning Worksheets Solving x + bx + c by factorisation
More informationNotes for CS542G (Iterative Solvers for Linear Systems)
Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,
More informationWeighted Least Squares Topology Error Detection And Identification
Weighted Least Squares Topology Error Detection And Identification A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Jason Glen Lindquist IN PARTIAL FULFILLMENT
More informationAn Exact Convex Formulation of the Optimal Power Flow in Radial Distribution Networks Including Transverse Components
1 An Exact Convex Formulation of the Optimal Power Flow in Radial Distribution Networks Including Transverse Components Mostafa Nick, Rachid. Cherkaoui, Jean-Yves Le Boudec, and Mario Paolone École Polytechnique
More informationMultilayer Perceptrons (MLPs)
CSE 5526: Introduction to Neural Networks Multilayer Perceptrons (MLPs) 1 Motivation Multilayer networks are more powerful than singlelayer nets Example: XOR problem x 2 1 AND x o x 1 x 2 +1-1 o x x 1-1
More informationProcess Model Formulation and Solution, 3E4
Process Model Formulation and Solution, 3E4 Section B: Linear Algebraic Equations Instructor: Kevin Dunn dunnkg@mcmasterca Department of Chemical Engineering Course notes: Dr Benoît Chachuat 06 October
More informationOn one Application of Newton s Method to Stability Problem
Journal of Multidciplinary Engineering Science Technology (JMEST) ISSN: 359-0040 Vol. Issue 5, December - 204 On one Application of Newton s Method to Stability Problem Şerife Yılmaz Department of Mathematics,
More information2.4 Error Analysis for Iterative Methods
2.4 Error Analysis for Iterative Methods 1 Definition 2.7. Order of Convergence Suppose {pp nn } nn=0 is a sequence that converges to pp with pp nn pp for all nn. If positive constants λλ and αα exist
More informationIntroduction to Electrical Theory and DC Circuits
Introduction to Electrical Theory and DC Circuits For Engineers of All Disciplines by James Doane, PhD, PE Contents 1.0 Course Overview... 4 2.0 Fundamental Concepts... 4 2.1 Electric Charges... 4 2.1.1
More informationF.1 Greatest Common Factor and Factoring by Grouping
section F1 214 is the reverse process of multiplication. polynomials in algebra has similar role as factoring numbers in arithmetic. Any number can be expressed as a product of prime numbers. For example,
More informationME5286 Robotics Spring 2017 Quiz 2
Page 1 of 5 ME5286 Robotics Spring 2017 Quiz 2 Total Points: 30 You are responsible for following these instructions. Please take a minute and read them completely. 1. Put your name on this page, any other
More informationECE 422/522 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability
ECE 4/5 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability Spring 014 Instructor: Kai Sun 1 Transient Stability The ability of the power system to maintain synchronism
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationFinal Exam, Second Semester: 2015/2016 Electrical Engineering Department
Philadelphia University Faculty of Engineering Student Name Student No: Serial No Final Exam, Second Semester: 2015/2016 Electrical Engineering Department Course Title: Power II Date: 21 st June 2016 Course
More informationQuantum Mechanics. An essential theory to understand properties of matter and light. Chemical Electronic Magnetic Thermal Optical Etc.
Quantum Mechanics An essential theory to understand properties of matter and light. Chemical Electronic Magnetic Thermal Optical Etc. Fall 2018 Prof. Sergio B. Mendes 1 CHAPTER 3 Experimental Basis of
More informationUnderstanding Load Flow Studies by using PSAT
Understanding Load Flow Studies by using PSAT Vijay Kumar Shukla 1, Ashutosh Bhadoria 2 1,2 Department of Electrical Engineering, Lovely Professional University, Jalandhar, India Abstract: Load Flow Study
More informationNETWORK CALCULATIONS updated 11/5/13 1:02 PM
NETWORK CALCULATIONS updated 11/5/13 1:02 PM 11/5/13 Network Calcula2ons (c) 2013 H. Zmuda 1 Introductory Comments The typical power transmission network span a large geographic area and involve a large
More informationSECTION 7: STEADY-STATE ERROR. ESE 499 Feedback Control Systems
SECTION 7: STEADY-STATE ERROR ESE 499 Feedback Control Systems 2 Introduction Steady-State Error Introduction 3 Consider a simple unity-feedback system The error is the difference between the reference
More informationElectronic Circuits. Prof. Dr. Qiuting Huang Integrated Systems Laboratory
Electronic Circuits Prof. Dr. Qiuting Huang 6. Transimpedance Amplifiers, Voltage Regulators, Logarithmic Amplifiers, Anti-Logarithmic Amplifiers Transimpedance Amplifiers Sensing an input current ii in
More informationChapter 9: Gaussian Elimination
Uchechukwu Ofoegbu Temple University Chapter 9: Gaussian Elimination Graphical Method The solution of a small set of simultaneous equations, can be obtained by graphing them and determining the location
More informationRevision : Thermodynamics
Revision : Thermodynamics Formula sheet Formula sheet Formula sheet Thermodynamics key facts (1/9) Heat is an energy [measured in JJ] which flows from high to low temperature When two bodies are in thermal
More informationElectric Circuits I. Nodal Analysis. Dr. Firas Obeidat
Electric Circuits I Nodal Analysis Dr. Firas Obeidat 1 Nodal Analysis Without Voltage Source Nodal analysis, which is based on a systematic application of Kirchhoff s current law (KCL). A node is defined
More informationSolution of Matrix Eigenvalue Problem
Outlines October 12, 2004 Outlines Part I: Review of Previous Lecture Part II: Review of Previous Lecture Outlines Part I: Review of Previous Lecture Part II: Standard Matrix Eigenvalue Problem Other Forms
More informationEffect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem
Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem Yuting Li Committee members: Dr. Daniel J. Tylavsky, Chair Dr. John Undrill Dr. Vijay
More informationEntropy Enhanced Covariance Matrix Adaptation Evolution Strategy (EE_CMAES)
1 Entropy Enhanced Covariance Matrix Adaptation Evolution Strategy (EE_CMAES) Developers: Main Author: Kartik Pandya, Dept. of Electrical Engg., CSPIT, CHARUSAT, Changa, India Co-Author: Jigar Sarda, Dept.
More information3.2 Iterative Solution Methods for Solving Linear
22 CHAPTER 3. NUMERICAL LINEAR ALGEBRA 3.2 Iterative Solution Methods for Solving Linear Systems 3.2.1 Introduction We continue looking how to solve linear systems of the form Ax = b where A = (a ij is
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More information(2) Orbital angular momentum
(2) Orbital angular momentum Consider SS = 0 and LL = rr pp, where pp is the canonical momentum Note: SS and LL are generators for different parts of the wave function. Note: from AA BB ii = εε iiiiii
More informationAngular Momentum, Electromagnetic Waves
Angular Momentum, Electromagnetic Waves Lecture33: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay As before, we keep in view the four Maxwell s equations for all our discussions.
More informationA COMPUTER PROGRAM FOR SHORT CIRCUIT ANALYSIS OF ELECTRIC POWER SYSTEMS
NIJOTECH VOL. 5 NO. 1 MARCH 1981 EJEBE 46 A COMPUTER PROGRAM FOR SHORT CIRCUIT ANALYSIS OF ELECTRIC POWER SYSTEMS BY G.C. EJEBE DEPARTMENT OF ELECTRICAL/ELECTRONIC ENGINEERING UNIVERSITY OF NIGERIA, NSUKKA.
More informationModule 3 : Sequence Components and Fault Analysis
Module 3 : Sequence Components and Fault Analysis Lecture 12 : Sequence Modeling of Power Apparatus Objectives In this lecture we will discuss Per unit calculation and its advantages. Modeling aspects
More informationPART I (STATISTICS / MATHEMATICS STREAM) ATTENTION : ANSWER A TOTAL OF SIX QUESTIONS TAKING AT LEAST TWO FROM EACH GROUP - S1 AND S2.
PART I (STATISTICS / MATHEMATICS STREAM) ATTENTION : ANSWER A TOTAL OF SIX QUESTIONS TAKING AT LEAST TWO FROM EACH GROUP - S1 AND S2. GROUP S1: Statistics 1. (a) Let XX 1,, XX nn be a random sample from
More information22A-2 SUMMER 2014 LECTURE 5
A- SUMMER 0 LECTURE 5 NATHANIEL GALLUP Agenda Elimination to the identity matrix Inverse matrices LU factorization Elimination to the identity matrix Previously, we have used elimination to get a system
More informationCharge carrier density in metals and semiconductors
Charge carrier density in metals and semiconductors 1. Introduction The Hall Effect Particles must overlap for the permutation symmetry to be relevant. We saw examples of this in the exchange energy in
More informationdue date: third day of class estimated time: 10 hours (for planning purposes only; work until you finish)
Honors PreCalculus Summer Work 016 due date: third day of class estimated time: 10 hours (for planning purposes only; work until you finish) Dear Honors PreCalculus Students, This assignment is designed
More informationA Step Towards the Cognitive Radar: Target Detection under Nonstationary Clutter
A Step Towards the Cognitive Radar: Target Detection under Nonstationary Clutter Murat Akcakaya Department of Electrical and Computer Engineering University of Pittsburgh Email: akcakaya@pitt.edu Satyabrata
More informationLinear System of Equations
Linear System of Equations Linear systems are perhaps the most widely applied numerical procedures when real-world situation are to be simulated. Example: computing the forces in a TRUSS. F F 5. 77F F.
More informationAn Equivalent Circuit Formulation of the Power Flow Problem with Current and Voltage State Variables
An Equivalent Circuit Formulation of the Power Flow Problem with Current and Voltage State Variables David M. Bromberg, Marko Jereminov, Xin Li, Gabriela Hug, Larry Pileggi Dept. of Electrical and Computer
More informationNumerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD
Mathematical Question we are interested in answering numerically How to solve the following linear system for x Ax = b? where A is an n n invertible matrix and b is vector of length n. Notation: x denote
More informationCSC 578 Neural Networks and Deep Learning
CSC 578 Neural Networks and Deep Learning Fall 2018/19 3. Improving Neural Networks (Some figures adapted from NNDL book) 1 Various Approaches to Improve Neural Networks 1. Cost functions Quadratic Cross
More information