CS270 Combinatorial Algorithms & Data Structures Spring Lecture 9:
|
|
- Cynthia Cox
- 5 years ago
- Views:
Transcription
1 CS70 Comiatorial Algorithms & Data Structures Sprig 00 Lecture 9: 170 Lecturer: Satish Rao Scrie: Adam Chlipala Disclaimer: These otes have ot ee sujected to the usual scrutiy reserved for formal pulicatios They may e distriuted outside this class oly with the permissio of the Istructor 91 Liear programmig wrap-up 911 Seidel s algorithm Give the liear program Ax ; maxc with d variales ad costraits: Algorithm 1 Seidel(A,, c) 1: if there is oly oe variale the : Treat all iequalities i Ax as equalities ad solve for x i each 3: Retur the poit out of these that maximizes c : ed if 5: if there are as may costraits as variales the 6: Solve the liear system Ax = usig Gaussia elimiatio ad retur the resultig poit 7: ed if 8: Pick a costrait h : a i x i uiformly at radom 9: x Seidel(A a i, i, c) 10: if x satisfies h the 11: Retur x 1: else 13: A, sustitutio of the equality a i x = i i Ax 1: Retur Seidel(A,, c) 15: ed if 9111 Correctess Lies 1 through 7 solve the particularly simple cases that have oly oe variale or as may costraits as variales The remaiig code recurses util oe of these special cases is reached Clearly lie 11 will oly retur correct values: We iductively assume that x is the est solutio without the chose h Reicludig h could oly restrict the solutio space, ut x is verified to satisfy h, so it must e the solutio to the origial prolem Figure 91 illustrates this case If lie 1 is reached, the x did ot satisfy h This meas h is oe of the importat tight costraits that determies the solutio Therefore, we kow that the solutio lies o h s hyperplae, so a i x = i for the true solutio x This equatio may e simplified to oe with oly oe of the variales o the lefthad side, allowig the sustitutio of the righthad side for that variale i A ad, lowerig the dimesioality of the prolem We kow that the ew system is equivalet to the old, so, iductively, the retur value of the recursive ivocatio is the correct solutio Figure 9 illustrates this case 9-1
2 c x h Figure 91: Removig a otight costrait c x h Figure 9: Removig a tight costrait
3 911 Ruig time Deote y T(, d) the expected ruig time of Seidel s algorithm o a iput with d variales ad costraits Aside from the ase cases, Seidel will always make oe recursive call with a system of oe fewer costrait If the radomly chose h is a tight costrait, it will also make a recursive call with oe fewer variale There are exactly d tight costraits, so there is a d chace of this recursive call occurrig Thus, cosiderig that the time for recursio will domiate the time spet y the ase cases, we arrive at this recurrece: T(, d) = T( 1, d) + d T(, d 1) There are simple methods that ca e used for solvig commo recurreces, ut they do t apply to this oe! It turs out that a solutio for this oe is: T(, d) = O(d!) Thus, if we hold d fixed, Seidel s algorithm rus i expected liear time 91 Summary of liear programmig We ve looked at these algorithms: Simplex While it performs very well i practice, it does t ru i polyomial time However, it has recetly ee prove that a slight perturatio of ay family of liear programs leads to a family for which Simplex rus i polyomial time Karmarkar s iterior poit method Both polyomial time ad efficiet i practice The ellipsoid method The first polyomial time algorithm discovered, ut very iefficiet i practice However, it geeralizes to oliear systems ad is useful i reasoig aout may kids of prolems Seidel s algorithm Radomized algorithm that is efficiet for prolems with low fixed dimesioalities Liear programmig is very useful for game theoretic prolems May, may other iterestig prolems ca e reduced to liear programmig prolems 9 Recurreces 91 A example recurrece Cosider this recurrece: T() = T(1) = 1 T ( ) + We ve all see this oe efore for algorithms like merge sort, so the solutio T() = O( log ) comes to mid We ca verify this y guessig T() = a log for some a ad verifyig that the solutio has the
4 right properties: T ( ( ( ) + = a log + ) ) = a(log log ) + = a log a + = a log (a 1) a log = T() However, there s a simple procedure for solvig may divide-ad-coquer recurreces directly Cosider the recursio tree for a algorithm with ruig time descried y the T aove, with every ode laeled with the amout of work doe i it as opposed to the recursive calls it makes: 1() ( ) ( ) d ( d ) The umers i the righthad colum give the total work for each level of the tree, with the last row givig the geeral term for the sum of level d It is clear that the total work o each level is The umer of levels is O(log ) Thus, summig up the total amout of work, we arrive at a O( log ) oud 9 Geeral divide-ad-coquer recurreces This sort of reasoig geeralizes to recurreces of the form T() = at ( ) + for ay a, : a a 1() a ( ) a a ( ) d d For the geeral form, we have a rachig factor of a with d doe at every ode at level d Thus, we have: T() = log If a <, the a < 1, ad the sum is a prefix of a coverget geometric series, makig the sum O(1) for fixed a ad This meas T() = O() i=0 ( a ) i
5 If a =, the we have the same sort of recursio as i the origial example, yieldig T() = O( log ) Fially, if a >, the a > 1, ad the last term of the sum domiates asymptotically, so T() = O ( ( a ) log ) The time expressio simplifes to a log, ad usig the trick of switchig the ase ad log parameter, we have T() = O( log a ) 93 The Master s Theorem Now cosider the recurrece T() = at ( ) + By usig the sustitutio m =, we ca use the result from the last sectio to solve this recurrece Let S(m) = T() We otai: ( m ) S(m) = as + m Now the last sectio s result ca e used directly to fid S From there, we otai T() = S( ) Geeralizig this approach to aritrary expoets for, we ca otai the well-kow Master s Theorem This approach also works for recurreces that make recursive calls with differet size parameters For example, for ( ( ) T() = T + T + 3) 3 the recursio tree ca e see to look a lot like that for the first recurrece we cosidered The rachig factor is, ad the depth is log /3, leadig to aother T() = O( log ) coclusio 93 Clever multiplicatio Stadard grade-school multiplicatio of two -it itegers takes O( ) time, ut it is possile to do etter Cosider this decompositio of two umers x ad y to e multiplied: x y a c d We ca treat the multiplicatio of x ad y as multiplicatio of two two-digit ase- / umers I other words: xy = ac + c / + ad / + d Now these su-multiplicatios may e decomposed i the same way, dow to the poit where we oly wish to multiply sigle-digit umers This leads to the recurrece ( T() = T + ) Ufortuately, y the Master s Theorem, this oly gives T() = O( ), which is o etter tha what the aive algorithm achieves However, we ca use a clever trick iveted y five-year-old Gauss to do etter
6 We eed oly perform three multiplicatios: (a + )(c + d), d, ad ac The last two give us two of the four products we eed to fid the fial result, with ac shifted y i costat time to otai ac By sutractig d ad ac from the first product, we otai c + ad Shiftig this y i costat time, we otai c / + ad / Now we ca add all the terms we ve otaied so far to otai the aswer With this strategy, oly 3 multiplicatios are performed per recursio tree ode, chagig the recurrece to ( T() = 3T + ) So ow T() = O( log 3 ), so T() = O( 16 ), which makes a sigificat differece i practice It s possile to do eve etter tha this with similar techiques Karatsua s algorithm for multiplyig matrices is ased o this idea 9 Computig medias Defiitio 91 The media of a sequece S is the S th lowest elemet of the sequece Oe ovious way to fid a media of a sequece is to first sort it i O( log ) time ad the read the middle elemet of the sequece i O(1) time However, it is possile to do etter We ll use a divide-ad-coquer approach that solves a more geeral prolem: Defiitio 9 The selectio prolem is to, give a sequece S ad idex k etwee 0 ad S 1, fid the kth lowest elemet of S Algorithm Select(A, k) if k = 0 the Retur mi(a) else Choose x A uiformly at radom B y A : y x C y A : y > x if k < B the Retur Select(B, k) else Retur Select(C, k B ) ed if ed if The correctess of the algorithm is est argued with a diagram: A B k x C k B A sequece A is show divided ito the B ad C that Select would form for a chose x, with B ad C cosidered to e sorted If the k < B, the A[k] must e i B, sice B cotais at least the k + 1 lowest
7 elemets of A Furthermore, B must e the kth lowest elemet of B as well, so the first recursive call will always yield the correct retur Similarly, if k B, the A[k] must ed up i C, ad it must e the (k B )th lowest, sice the B lowest elemets of A have ee moved to B Thus, Select is correct Lettig T e the ruig time of Select o a A of legth We have: E[ T()] E[ T(γ)] + where γ is the proportio of A s elemets that ed up i the susequece that s used i the recursive call We might thik we ca proceed with E[ T()] E[ T(γ)] + E[ T(E[γ])] + β Pr[γ = β]e[ T(β)] + ut the secod step is ivalid Ituitively, we see that E[γ] 3 If we could sustitute this i the recurrece, we would get E[ T()] E [ T ( 3 )] + ad fid that T() = O() is a solutio However, we ca actually otai this result formally through a slight modificatio to the algorithm Algorithm 3 Select(A, k) if k = 0 the Retur mi(a) else repeat Choose x A uiformly at radom B y A : y x C y A : y > x util mi{ B, C } > A if k < B the Retur Select(B, k) else Retur Select(C, k B ) ed if ed if With a atagoistic radom umer geerator, the ew algorithm may ever termiate, ut most likely it will termiate, ad we kow that γ will ever e higher tha 3 Therefore: [ ( )] 3 E[ T()] E T + E[ d] where d is the umer of iteratios of the loop required efore a suitale x is foud Half of the x values are suitale, so E[ d] =, ad we otai E[ T()] = O() y the Master s Theorem The ruig time of Select is actually a upper oud o the ruig time of Select All of the work for these algorithms is doe i partitioig iput sequeces Whe Select chooses a x such that mi{ B, C } > A A, the it ehaves just like Select for that step If mi{ B, C } ad k is i the smaller susequece, the Select ca oly do etter tha Select does, sice Select makes its recursive call with a larger sequece I the fial case, mi{ B, C } A ad k is i the larger susequece Here, Select s recursive call uses a larger sequece tha Select s, ut Select s first repetitio of its loop whe Select s choice of x is picked
8 Figure 93: Liear system B a 0 a 1 a Figure 9: Liear system A first does the same work as Select s recursive call does I effect, the work doe y Select is pushed up ito the loops of Select util the property that recursive calls are oly made o arrays o larger tha 3 of the iput sequece size is met After such a trasformatio, every executio of Select ecomes a executio of Select, ad so the O() expected time oud applies 95 The Fast Fourier Trasform 951 Motivatio Cosider a cotiuous liear system B like that i Figure 93 The x axis represets time ad the y axis represets somethig like the eergy i the system at that time The cotiuous system is approximated with a discrete system through samplig, represeted y arrows i the figure Whe a istat force is applied to B, the shape of the resultig system is B s shape, ut the magitude is proportioal to the magitude of the force Whe a cotiuous force like A i Figure 9 is applied, the result is the superpositio of the differet results of istat forces withi A Samplig A discretely as well, we arrive at the decompositio show i Figure 95 for the system resultig from applyig A to B The
9 Figure 95: Decompositio of the result of applyig A to B eergy i the system at each time is the sum of the eergies of the differet parts of the decompositio active at that time Each decompositio correspods with a istat force withi A, ad each starts oe time uit later tha the last Now cosider geeral systems A ad B of the types cosidered aove, sampled over t time uits Deote y C the system resultig from the applicatio of A to B There is a simple patter i the equatios for the itesities of C at differet time uit: c 0 = a 0 0 c 1 = a a 1 0 c = a 0 + a a 0 The aive algorithm for calculatig C takes O(t ) multiplicatios, oe for each pair of itesities etwee A ad B It turs out that we ca do etter tha this Cosider the system A as a polyomial A(x) = a 0 + a 1 x + a x + + a t 1 x t 1 Defie B(x) aalogously, ad let C(x) = A(x) B(x) Upo ispectig the polyomial C, it ecomes clear that its coefficiets are exactly the c i values that we re lookig for Now that we ve reduced the prolem to multiplicatio of polyomials, we ca use the Fast Fourier Trasform algorithm to fid C i O(t log t) 95 Outlie of the algorithm There are two mai strategies used for represetig polyomials The oe we ve used so far represets a degree polyomial y its + 1 coefficiets Alteratively, a degree polyomial is also defied y + 1 distict poits
10 This meas we ca represet A(x) y (x 0, A(x 0 )),, (x t 1, A(x t 1 ) for distict x 0,, x t 1 If we represet B(x) i the same maer with the same x i s, the C(x) is (x 0, A(x 0 ) B(x 0 )),, (x t 1, A(x t 1 ) B(x t 1 )) Whe we have the ew forms of A ad B, the ew form of C ca e foud with O(t) multiplicatios Motivated y this possiility, we d like to covert etwee polyomial represetatios as ecessary to take advatage of it We ca propose the followig shell for a algorithm: Algorithm FFT(A, B) 1: Choose distict x 0,, x t 1 : Evaluatio: Calculate A(x i ) ad B(x i ) for each 0 i < t 3: Calculate C(x i ) for each 0 i < t y multiplyig A(x i ) B(x i ) : Iterpolatio: Determie C from its values at the x i s Lies 1 ad 3 take O(t) time To eat O(t ) overall ruig time, we ll eed to fid ways to do lies ad i o(t ) time Oe way to thik aout evaluatio is as computig the result of the followig matrix multiplicatio: 1 x 0 x 0 x t x t 1 x t 1 x t 1 t 1 a 0 a t 1 = A(x 0 ) A(x t 1 ) Iterpolatio ca e viewed very similarly Left multiplyig oth sides of this equatio y the iverse of the matrix yields a equatio for fidig C from eough poits through aother matrix multiplicatio The aive way of performig these multiplicatios takes O(t ) time However, if we ca fid a etter way that takes advatage of the special structure of the matrix, the we ca eat the aive polyomial multiplicatio algorithm I fact, the FFT does just this To e cotiued
Recursive 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 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 informationLecture 3: Divide and Conquer: Fast Fourier Transform
Lecture 3: Divide ad Coquer: Fast Fourier Trasform Polyomial Operatios vs. Represetatios Divide ad Coquer Algorithm Collapsig Samples / Roots of Uity FFT, IFFT, ad Polyomial Multiplicatio Polyomial operatios
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 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 informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
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 informationThis Lecture. Divide and Conquer. Merge Sort: Algorithm. Merge Sort Algorithm. MergeSort (Example) - 1. MergeSort (Example) - 2
This Lecture Divide-ad-coquer techique for algorithm desig. Example the merge sort. Writig ad solvig recurreces Divide ad Coquer Divide-ad-coquer method for algorithm desig: Divide: If the iput size is
More informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 13
Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig
More informationAbstract Vector Spaces. Abstract Vector Spaces
Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces
More informationSorting Algorithms. Algorithms Kyuseok Shim SoEECS, SNU.
Sortig Algorithms Algorithms Kyuseo Shim SoEECS, SNU. Desigig Algorithms Icremetal approaches Divide-ad-Coquer approaches Dyamic programmig approaches Greedy approaches Radomized approaches You are ot
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationCSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)
CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
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 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 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 informationAlgorithms and Data Structures Lecture IV
Algorithms ad Data Structures Lecture IV Simoas Šalteis Aalborg Uiversity simas@cs.auc.dk September 5, 00 1 This Lecture Aalyzig the ruig time of recursive algorithms (such as divide-ad-coquer) Writig
More informationAlgorithms Design & Analysis. Divide & Conquer
Algorithms Desig & Aalysis Divide & Coquer Recap Direct-accessible table Hash tables Hash fuctios Uiversal hashig Perfect Hashig Ope addressig 2 Today s topics The divide-ad-coquer desig paradigm Revised
More informationA widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α
Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
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 information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
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 informationLet A(x) and B(x) be two polynomials of degree n 1:
MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 2/42 Operatios o polyomials MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 4/42 Efficiet Patter Matchig (MI-EVY) 4. DFT, FFT
More informationGRAPHING LINEAR EQUATIONS. Linear Equations ( 3,1 ) _x-axis. Origin ( 0, 0 ) Slope = change in y change in x. Equation for l 1.
GRAPHING LINEAR EQUATIONS Quadrat II Quadrat I ORDERED PAIR: The first umer i the ordered pair is the -coordiate ad the secod umer i the ordered pair is the y-coordiate. (,1 ) Origi ( 0, 0 ) _-ais Liear
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationMth 95 Notes Module 1 Spring Section 4.1- Solving Systems of Linear Equations in Two Variables by Graphing, Substitution, and Elimination
Mth 9 Notes Module Sprig 4 Sectio 4.- Solvig Sstems of Liear Equatios i Two Variales Graphig, Sustitutio, ad Elimiatio A Solutio to a Sstem of Two (or more) Liear Equatios is the commo poit(s) of itersectio
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 informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationCSE 202 Homework 1 Matthias Springer, A Yes, there does always exist a perfect matching without a strong instability.
CSE 0 Homework 1 Matthias Spriger, A9950078 1 Problem 1 Notatio a b meas that a is matched to b. a < b c meas that b likes c more tha a. Equality idicates a tie. Strog istability Yes, there does always
More informationDivide & Conquer. Divide-and-conquer algorithms. Conventional product of polynomials. Conventional product of polynomials.
Divide-ad-coquer algorithms Divide & Coquer Strategy: Divide the problem ito smaller subproblems of the same type of problem Solve the subproblems recursively Combie the aswers to solve the origial problem
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 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 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 informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationThe Binomial Theorem
The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k
More informationCIS 121 Data Structures and Algorithms with Java Spring Code Snippets and Recurrences Monday, February 4/Tuesday, February 5
CIS 11 Data Structures ad Algorithms with Java Sprig 019 Code Sippets ad Recurreces Moday, February 4/Tuesday, February 5 Learig Goals Practice provig asymptotic bouds with code sippets Practice solvig
More informationCS583 Lecture 02. Jana Kosecka. some materials here are based on E. Demaine, D. Luebke slides
CS583 Lecture 02 Jaa Kosecka some materials here are based o E. Demaie, D. Luebke slides Previously Sample algorithms Exact ruig time, pseudo-code Approximate ruig time Worst case aalysis Best case aalysis
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationHonors Algebra 2 Summer Assignment
Hoors Algera Summer Assigmet Dear Future Hoors Algera Studet, Cogratulatios o your erollmet i Hoors Algera! Below you will fid the summer assigmet questios. It is assumed that these cocepts, alog with
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 informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More informationSection 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations
Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationCS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2
Geeral remarks Week 2 1 Divide ad First we cosider a importat tool for the aalysis of algorithms: Big-Oh. The we itroduce a importat algorithmic paradigm:. We coclude by presetig ad aalysig two examples.
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
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 informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
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 informationChapter 6: Determinants and the Inverse Matrix 1
Chapter 6: Determiats ad the Iverse Matrix SECTION E pplicatios of Determiat By the ed of this sectio you will e ale to apply Cramer s rule to solve liear equatios ermie the umer of solutios of a give
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationCS 332: Algorithms. Linear-Time Sorting. Order statistics. Slide credit: David Luebke (Virginia)
1 CS 332: Algorithms Liear-Time Sortig. Order statistics. Slide credit: David Luebke (Virgiia) Quicksort: Partitio I Words Partitio(A, p, r): Select a elemet to act as the pivot (which?) Grow two regios,
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =
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 informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More informationLINEAR ALGEBRA. Paul Dawkins
LINEAR ALGEBRA Paul Dawkis Table of Cotets Preface... ii Outlie... iii Systems of Equatios ad Matrices... Itroductio... Systems of Equatios... Solvig Systems of Equatios... 5 Matrices... 7 Matrix Arithmetic
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee
More informationCS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016
CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationCSE Introduction to Parallel Processing. Chapter 3. Parallel Algorithm Complexity
Dr. Izadi CSE-40533 Itroductio to Parallel Processig Chapter 3 Parallel Algorithm Complexity Review algorithm complexity ad various complexity classes Itroduce the otios of time ad time-cost optimality
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
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 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 informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationChapter 6. Advanced Counting Techniques
Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationPolynomial Multiplication and Fast Fourier Transform
Polyomial Multiplicatio ad Fast Fourier Trasform Com S 477/577 Notes Ya-Bi Jia Sep 19, 2017 I this lecture we will describe the famous algorithm of fast Fourier trasform FFT, which has revolutioized digital
More informationPC5215 Numerical Recipes with Applications - Review Problems
PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,
More informationMAT 271 Project: Partial Fractions for certain rational functions
MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig
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 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 50-004 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
More informationA recurrence equation is just a recursive function definition. It defines a function at one input in terms of its value on smaller inputs.
CS23 Algorithms Hadout #6 Prof Ly Turbak September 8, 200 Wellesley College RECURRENCES This hadout summarizes highlights of CLRS Chapter 4 ad Appedix A (CLR Chapters 3 & 4) Two-Step Strategy for Aalyzig
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationChapter 22 Developing Efficient Algorithms
Chapter Developig Efficiet Algorithms 1 Executig Time Suppose two algorithms perform the same task such as search (liear search vs. biary search). Which oe is better? Oe possible approach to aswer this
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
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 informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More information15.083J/6.859J Integer Optimization. Lecture 3: Methods to enhance formulations
15.083J/6.859J Iteger Optimizatio Lecture 3: Methods to ehace formulatios 1 Outlie Polyhedral review Slide 1 Methods to geerate valid iequalities Methods to geerate facet defiig iequalities Polyhedral
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationModel of Computation and Runtime Analysis
Model of Computatio ad Rutime Aalysis Model of Computatio Model of Computatio Specifies Set of operatios Cost of operatios (ot ecessarily time) Examples Turig Machie Radom Access Machie (RAM) PRAM Map
More informationRay-triangle intersection
Ray-triagle itersectio ria urless October 2006 I this hadout, we explore the steps eeded to compute the itersectio of a ray with a triagle, ad the to compute the barycetric coordiates of that itersectio.
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationThe Adomian Polynomials and the New Modified Decomposition Method for BVPs of nonlinear ODEs
Mathematical Computatio March 015, Volume, Issue 1, PP.1 6 The Adomia Polyomials ad the New Modified Decompositio Method for BVPs of oliear ODEs Jusheg Dua # School of Scieces, Shaghai Istitute of Techology,
More information