Fast Power Flow Methods 1.0 Introduction
|
|
- Ami Hood
- 6 years ago
- Views:
Transcription
1 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.
2 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,
3 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:
4 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
5 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 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
6 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
7 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
8 . 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 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
10 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
11 oti that the acobia matrix has o equatios or variables for bus the swi bus, we defie the matrix as: ' 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
12 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
13 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
14 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:
15 5 Multiplicatio of by the reactive power mismatch vector ives the riht-had-side of 8: ased o ad, eqs. 7 ad 8 become:
16 6 ~ ~ 4 where the otatio of the far riht-had-side i ad 4 idicates the riht-had-sides of ad. Two commets remai:
17 . 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
18 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
19 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
20 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..
LECTURE 17: Linear Discriminant Functions
LECURE 7: Liear Discrimiat Fuctios Perceptro leari Miimum squared error (MSE) solutio Least-mea squares (LMS) rule Ho-Kashyap procedure Itroductio to Patter Aalysis Ricardo Gutierrez-Osua exas A&M Uiversity
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationMatrices and vectors
Oe Matrices ad vectors This book takes for grated that readers have some previous kowledge of the calculus of real fuctios of oe real variable It would be helpful to also have some kowledge of liear algebra
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationLINEARIZATION OF NONLINEAR EQUATIONS By Dominick Andrisani. dg x. ( ) ( ) dx
LINEAIZATION OF NONLINEA EQUATIONS By Domiick Adrisai A. Liearizatio of Noliear Fctios A. Scalar fctios of oe variable. We are ive the oliear fctio (). We assme that () ca be represeted si a Taylor series
More informationGeometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT
OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationSection 7 Fundamentals of Sequences and Series
ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationGoodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)
Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................
More informationMath 25 Solutions to practice problems
Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationECE Spring Prof. David R. Jackson ECE Dept. Notes 20
ECE 6341 Sprig 016 Prof. David R. Jackso ECE Dept. Notes 0 1 Spherical Wave Fuctios Cosider solvig ψ + k ψ = 0 i spherical coordiates z φ θ r y x Spherical Wave Fuctios (cot.) I spherical coordiates we
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationChapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io
Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationMathematics Extension 1 SOLUTIONS
Bored of Studies Trial Examiatios Mathematics Extesio SOLUTIONS Disclaimer: These solutios may cotai small errors. If ay are foud, please feel free to cotact either Carrotstics or Trebla o www.boredofstudies.or,
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMatsubara-Green s Functions
Matsubara-Gree s Fuctios Time Orderig : Cosider the followig operator If H = H the we ca trivially factorise this as, E(s = e s(h+ E(s = e sh e s I geeral this is ot true. However for practical applicatio
More informationBasic Iterative Methods. Basic Iterative Methods
Abel s heorem: he roots of a polyomial with degree greater tha or equal to 5 ad arbitrary coefficiets caot be foud with a fiite umber of operatios usig additio, subtractio, multiplicatio, divisio, ad extractio
More informationMATH 10550, EXAM 3 SOLUTIONS
MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More information3. 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,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationFrequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More informationSequences, Series, and All That
Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationBecause it tests for differences between multiple pairs of means in one test, it is called an omnibus test.
Math 308 Sprig 018 Classes 19 ad 0: Aalysis of Variace (ANOVA) Page 1 of 6 Itroductio ANOVA is a statistical procedure for determiig whether three or more sample meas were draw from populatios with equal
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationMath 257: Finite difference methods
Math 257: Fiite differece methods 1 Fiite Differeces Remember the defiitio of a derivative f f(x + ) f(x) (x) = lim 0 Also recall Taylor s formula: (1) f(x + ) = f(x) + f (x) + 2 f (x) + 3 f (3) (x) +...
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationLet l be an index for latent variables (l=1,2,3,4). Consider the latent variable z. vector of observed covariates (excluding a constant), α
Olie Supplemet to MaaS i Car-Domiated Cities: Modeli the adoptio, frequecy, ad characteristics of ride-haili trips i Dallas, TX Patrícia S. Lavieri ad Chadra R. Bhat (correspodi author) A Overview of the
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationPHY4905: Nearly-Free Electron Model (NFE)
PHY4905: Nearly-Free Electro Model (NFE) D. L. Maslov Departmet of Physics, Uiversity of Florida (Dated: Jauary 12, 2011) 1 I. REMINDER: QUANTUM MECHANICAL PERTURBATION THEORY A. No-degeerate eigestates
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ANDREW SALCH 1. The Jacobia criterio for osigularity. You have probably oticed by ow that some poits o varieties are smooth i a sese somethig
More information62. 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 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationIntro to Learning Theory
Lecture 1, October 18, 2016 Itro to Learig Theory Ruth Urer 1 Machie Learig ad Learig Theory Comig soo 2 Formal Framework 21 Basic otios I our formal model for machie learig, the istaces to be classified
More informationFLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV
More information(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:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationComplex Number Theory without Imaginary Number (i)
Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationB = B is a 3 4 matrix; b 32 = 3 and b 2 4 = 3. Scalar Multiplication
MATH 37 Matrices Dr. Neal, WKU A m matrix A = (a i j ) is a array of m umbers arraged ito m rows ad colums, where a i j is the etry i the ith row, jth colum. The values m are called the dimesios (or size)
More informationResponse Analysis on Nonuniform Transmission Line
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. No. November 5 173-18 Respose Aalysis o Nouiform Trasmissio Lie Zlata Cvetković 1 Slavoljub Aleksić Bojaa Nikolić 3 Abstract: Trasiets o a lossless epoetial
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationPHYC - 505: Statistical Mechanics Homework Assignment 4 Solutions
PHYC - 55: Statistical Mechaics Homewor Assigmet 4 Solutios Due February 5, 14 1. Cosider a ifiite classical chai of idetical masses coupled by earest eighbor sprigs with idetical sprig costats. a Write
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationAverage-Case Analysis of QuickSort
Average-Case Aalysis of QuickSort Comp 363 Fall Semester 003 October 3, 003 The purpose of this documet is to itroduce the idea of usig recurrece relatios to do average-case aalysis. The average-case ruig
More informationCastiel, Supernatural, Season 6, Episode 18
13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio
More informationINTEGRATION BY PARTS (TABLE METHOD)
INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationSection 6.4: Series. Section 6.4 Series 413
ectio 64 eries 4 ectio 64: eries A couple decides to start a college fud for their daughter They pla to ivest $50 i the fud each moth The fud pays 6% aual iterest, compouded mothly How much moey will they
More informationKinetics of Complex Reactions
Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationSet Notation Review. N the set of positive integers (aka set of natural numbers) {1, 2, 3, }
11. Notes o Mathematical Iductio Before we delve ito the today s topic, let s review some basic set otatio Set Notatio Review N the set of positive itegers (aa set of atural umbers) {1,, 3, } Z the set
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationTest One (Answer Key)
CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)
More informationChapter 1 Simple Linear Regression (part 6: matrix version)
Chapter Simple Liear Regressio (part 6: matrix versio) Overview Simple liear regressio model: respose variable Y, a sigle idepedet variable X Y β 0 + β X + ε Multiple liear regressio model: respose Y,
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationANALYSIS OF EXPERIMENTAL ERRORS
ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More information( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.
Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get
More informationBernoulli numbers and the Euler-Maclaurin summation formula
Physics 6A Witer 006 Beroulli umbers ad the Euler-Maclauri summatio formula I this ote, I shall motivate the origi of the Euler-Maclauri summatio formula. I will also explai why the coefficiets o the right
More informationARIMA Models. Dan Saunders. y t = φy t 1 + ɛ t
ARIMA Models Da Sauders I will discuss models with a depedet variable y t, a potetially edogeous error term ɛ t, ad a exogeous error term η t, each with a subscript t deotig time. With just these three
More informationSequences, Sums, and Products
CSCE 222 Discrete Structures for Computig Sequeces, Sums, ad Products Dr. Philip C. Ritchey Sequeces A sequece is a fuctio from a subset of the itegers to a set S. A discrete structure used to represet
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More information