Solving DivideandConquer Recurrences


 Gertrude Welch
 2 years ago
 Views:
Transcription
1 Solvig DivideadCoquer Recurreces Victor Adamchik A divideadcoquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios to subproblems to get solutio to origial problem We use recurreces to aalyze the ruig time of such algorithms. Suppose T is the umber of steps i the worst case eeded to solve the problem of size. Let us split a problem ito a 1 subproblems, each of which is of the iput size where b>1. b Observe, that the umber of subproblems a is ot ecessarily equal to b. The total umber of steps T is obtaied by all steps eeded to solve smaller subproblems T êb plus the umber eeded to combie solutios ito a fial oe. The followig equatio is called divideadcoquer recurrece relatio T = a T êb + fhl As a example, cosider the mergesort: divide the iput i half recursively sort the two halves combie the two sorted subsequeces by mergig them. Let THL be worstcase rutime o a sequece of keys: If = 1, the THL = QH1L costat time If >1, the THL = 2 THê2L + QHL here Q() is time to do the merge. The
2 15451: Algorithm Desig ad Aalysis 2 T = 2 T ê2 +QHL Other examples of divide ad coquer algorithms: quicksort, iteger multiplicatio, matrix multiplicatio, fast Fourier trsform, fidig cover hull ad more. There are several techiques of solvig such recurrece equatios: the iteratio method the tree method the mastertheorem method guessadverify ü Tree method We could visualize the recursio as a tree, where each ode represets a recursive call. The root is the iitial call. Leaves correspod to the exit coditio. We ca ofte solve the recurrece by lookig at the structure of the tree. To illustrate, we take this example THL=2 TK 2 O+2 TH1L=1 Here is a recursio tree that diagrams the recursive fuctio calls T() T(/2) T(/2) T(/4) T(/4) T(/4) T(/4) T(1) Usig a recursio tree we ca model the time of a recursive executio by writig the size of the problem i each ode. T(1)
3 3 Usig a recursio tree we ca model the time of a recursive executio by writig the size of the problem i each ode. The last level correspods to the iitial coditio of the recurrece. Sice the work at each leaf is costat, the total work at all leaves is equal to the umber of leaves, which is 2 h = 2 log 2 = To fid the total time (for the whole tree), we must add up all the terms 1+log 2 THL= = + 2 The sum is easily computed by meas of the geometric series This yeilds h k=0 x k = xh+11 x1, x 1 k=0 1 2 k
4 15451: Algorithm Desig ad Aalysis 4 THL= = Check with Mathematica == 2 + 2, ä 1=, E H 1+2L<< Example. Solve the recurrece THL=3 TK 4 O+ The work at all levels is Sice the height is log 4, the tree has 3 log 4 leaves. Hece, the total work is give by 1+log 4 THL= k=0 3 4 k + 3 log 4 TH1L By meas of the geometric series ad takig ito accout 3 log 4 = log 4 3 the above sum yields THL=44 log log 4 3 TH1L = OHL ü The Master Theorem The master theorem solves recurreces of the form THL = a T b + fhl for a wide variety of fuctio fhl ad a 1, b>1. I this sectio we will outlie the
5 5 mai idea. Here is the recursive tree for the above equatio It is easy to see that the tree has a log b leaves. Ideed, sice the height is log b, ad the tree brachig factor is a, the umber of leaves is log a h = a log b a log = a a b Summig up values at each level, gives Therefore, the solutio is THL= fhl + a f b + a2 f = 1 log a b b 2 = log b a log b a TH1L 1+log b THL= log b a TH1L+ a k f k=0 b k Now we eed to compare the asymptotic behavior of fhl with log b a. There are three possible cases. QI log b a M if fhl=oi log b a M THL= QI log b log k+1 M if fhl=qi log b a log k M, k 0 QH fhll if fhl=wi log b a M The followig examples demostrate the theorem. Case 1. THL=4 TI M+ 2 We have fhl= ad log b a = log 2 4 = 2, therefore fhl=oi 2 M. The the solutio is THL= QI 2 M by case 1. Case 2. THL=4 TI 2 M+2 I this case fhl= 2 ad fhl=qi 2 M. The THL= QI 2 log M by case 2. Case 3. THL=4 TI 2 M+3 I this case fhl= 3 ad fhl=wi log b a M=WI 2 M. The THL= QI 3 M by case 3.
6 15451: Algorithm Desig ad Aalysis 6 ü Multiplicatio of large itegers Karatsuba Algorithm The brute force approach ("grammar school" method) We say that multiplicatio of two digits itegers has time complexity at worst OI 2 M. We develop a algorithm that has better asymptotic complexity. The idea is based o divideadcoquer techique. Cosider the above itegers ad split each of them i two parts 123 = 12 * = 4 * ad the multiply them: 123*45 = (12*10 + 3)(4*10 + 5) = H L I geeral, the iteger which has digits ca be represeted as um = x * 10 m + y where m=floork 2 O x=ceiligk 2 O y=floork 2 O Example, = Cosider two digits umbers
7 7 um 1 = x 1 * 10 p + x 0 um 2 = y 1 * 10 p + y 0 Their product is um 1 * um 2 = x 1 * y 1 * 10 2 p +Hx 1 * y 0 + x 0 * y 1 L*10 p + x 0 * y 0 Just lookig at this geeral formula you ca say that just istead of oe multiplicatio we have 4. Where is the advatage? ü The worstcase complexity umbers x 1, x 0 ad y 1, y 0 have twice less digits. Let THL deote the umber of digit multiplicatios eeded to multiply two digits umbers. The recurrece (sice the algorithm does 4 multiplicatios o each step) THL=4 TI M+OHL, THcL = 1 2 Note, we igore multiplicatios by a base!!! Its solutio is give by The algorithm is still quadratic! THL = 4 log 2 = 2 ü The Karatsuba Algorithm 1962, Aatolii Karatsuba, Russia. um 1 * um 2 = x 1 * y 1 * 10 2 p +Hx 1 * y 0 + x 0 * y 1 L*10 p + x 0 * y 0 The goal is to decrease the umber of multiplicatios from 4 to 3. We ca do this by observig that It follows that Hx 1 + x 0 L*Hy 1 + y 0 L= x 1 * y 1 + x 0 * y 0 +Hx 1 * y 0 + x 0 * y 1 L um 1 * um 2 = x 1 * y 1 * 10 2 p +JHx 1 + x 0 L* Hy 1 + y 0 L x 1 * y 1  x 0 * y 0 N*10 p + x 0 * y 0 ad it is oly 3 multiplicatios (see it?). The total umber of multiplicatios is give by (we igore multiplicatios by a base) Its solutio is THL=3 TI M+OHL, T(c) = 1 2
8 15451: Algorithm Desig ad Aalysis 8 ü ToomCook 3Way Multiplicatio 1963, A. L. Toom, Russia. 1966, Cook, Harvard, Ph.D Thesis THL = 3 log 2 = log 2 3 = The key idea of the algorithm is to divide a large iteger ito 3 parts (rather tha 2) of size approximately ê 3 ad the multiply those parts. Here is the equatio of for the total umber of multiplicatios THL=9 T 3 + OHL, THcL = 1 ad the solutio TH L=9 log 3 = 2 Let us reduce the umber of multiplicatios by oe THL=8 T 3 + OHL THL=8 log 3 = log 3 8 = No advatage. This does ot improve the previous algorithm, that rus at OI M How may multiplicatio should we elimiate? Let us cosider that equatio i a geeral form, where parameter p>0 is arbitrary THL= p T 3 + OHL THL= p log 3 = log 3 p Therefore, the ew algoritm will be faster tha OI 1.58 M if we reduce the umber of multiplicatios to five This is a improvemet over Karatsuba. THL=5 log 3 = log 3 5 = Is it possible to reduce a umber of multiplicatios to 5? Yes, it follows from this system of equatios: where x 0 y 0 = Z 0 12Hx 1 y 0 + x 0 y 1 L=8 Z 1  Z 28 Z 3 + Z 4 24Hx 2 y 0 + x 1 y 1 + x 0 y 2 L=30 Z Z 1  Z Z 3  Z 4 12Hx 2 y 1 + x 1 y 2 L=2 Z 1 + Z Z 3  Z 4 24 x 2 y 2 = 6 Z 04 Z 1 + Z 24 Z 3 + Z 4
9 9 ü Further Geeralizatio Z 0 = x 0 y 0 Z 1 = Hx 0 + x 1 + x 2 LHy 0 + y 1 + y 2 L Z 2 = Hx x x 2 LHy y y 2 L Z 3 = Hx 0  x 1 + x 2 LHy 0  y 1 + y 2 L Z 4 = Hx 02 x x 2 LHy 02 y y 2 L It is possible to develop a faster algorithm by icreasig the umber of splits. Let us cosider a 4way splittig. How may multiplicatios should we have o each step so this algorithm will outperform the 3way splittig? We fid parameter p from which yields THL= p TK 4 O+OHL THL= p log 4 = log 4 p log 4 p log 3 5 p = 7 The followig table demostrates a relatioship betwee splits ad the umber of multiplicatios: Ituitively we see that the kway split requires 2 k  1 multiplicatios. This meas that istead of k 2 multiplicatios we do oly 2 k 1. The recurrece equatio for the total umber of multiplicatio is give by THL=H2 k 1L T k + OHL ad its solutio is THL=H2 k 1L log k = log k H2 k1l Here is the sequece of the kway splits whe k rus from 2 to 10:
10 15451: Algorithm Desig ad Aalysis , 1.46, 1.40, 1.36, 1.33, 1.31, 1.30, 1.28, We ca prove that asymptotically multiplicatio of two digits umbers requires OI 1+e M multiplicatios, where eø0. Note, we will NEVER get a liear performace (prove this!) Is it always possible to fid such 2 k 1 multiplicatios? Cosider two polyomials of k 1 degree poly 1 = a k1 x k1 + a k2 * x k a 1 * x+a 0 poly 2 = b k1 x k1 + b k2 * x k b 1 * x+b 0 whe we multiply them we get a polyomial of 2 k 2 degree poly 1 * poly 2 = a k1 b k1 * x 2 k Ha 1 b 0 + b 1 a 0 L* x + a 0 b 0 The above polyomial has exactly 2 k 1 coefficiets, therefore it's uiquely defied by 2 k 1 values.
Soving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationS. Tanny MAT 344 Spring 1999. be the minimum number of moves required.
S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
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 informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a stepbystep procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationCooleyTukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley CooleyTuey Tuey FFT Algorithms FFT Algorithms Cosider a legth sequece x[ with a poit DFT X[ where Represet the idices ad as +, +, Cooley CooleyTuey Tuey FFT Algorithms FFT Algorithms Usig these
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More information23 The Remainder and Factor Theorems
 The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationConcept: Types of algorithms
Discrete Math for Bioiformatics WS 10/11:, by A. Bockmayr/K. Reiert, 18. Oktober 2010, 21:22 1001 Cocept: Types of algorithms The expositio is based o the followig sources, which are all required readig:
More informationLecture 2: Karger s Min Cut Algorithm
priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More information.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More informationSolutions to Exercises Chapter 4: Recurrence relations and generating functions
Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationReview: Classification Outline
Data Miig CS 341, Sprig 2007 Decisio Trees Neural etworks Review: Lecture 6: Classificatio issues, regressio, bayesia classificatio Pretice Hall 2 Data Miig Core Techiques Classificatio Clusterig Associatio
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More information7.1 Finding Rational Solutions of Polynomial Equations
4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More informationSection 8.3 : De Moivre s Theorem and Applications
The Sectio 8 : De Moivre s Theorem ad Applicatios Let z 1 ad z be complex umbers, where z 1 = r 1, z = r, arg(z 1 ) = θ 1, arg(z ) = θ z 1 = r 1 (cos θ 1 + i si θ 1 ) z = r (cos θ + i si θ ) ad z 1 z =
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationCHAPTER 11 Financial mathematics
CHAPTER 11 Fiacial mathematics I this chapter you will: Calculate iterest usig the simple iterest formula ( ) Use the simple iterest formula to calculate the pricipal (P) Use the simple iterest formula
More information5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?
5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso
More informationBENEFITCOST ANALYSIS Financial and Economic Appraisal using Spreadsheets
BENEITCST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal  Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts
More informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More information5.3. Generalized Permutations and Combinations
53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationFast Fourier Transform
18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible sixfigure salaries i whole dollar amouts are there that cotai at least
More informationEscola Federal de Engenharia de Itajubá
Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica PósGraduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationA Note on Sums of Greatest (Least) Prime Factors
It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423432 HIKARI Ltd, www.mhikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos
More informationMultiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives
Douglas A. Lapp Multiple Represetatios for Patter Exploratio with the Graphig Calculator ad Maipulatives To teach mathematics as a coected system of cocepts, we must have a shift i emphasis from a curriculum
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationA Faster ClauseShortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 4960 A Faster ClauseShorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationListing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2
74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationPartial Di erential Equations
Partial Di eretial Equatios Partial Di eretial Equatios Much of moder sciece, egieerig, ad mathematics is based o the study of partial di eretial equatios, where a partial di eretial equatio is a equatio
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
More informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More informationSystems Design Project: Indoor Location of Wireless Devices
Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 6985295 Email: bcm1@cec.wustl.edu Supervised
More informationQuantitative Computer Architecture
Performace Measuremet ad Aalysis i Computer Quatitative Computer Measuremet Model Iovatio Proposed How to measure, aalyze, ad specify computer system performace or My computer is faster tha your computer!
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 612 pages of text (ca be loger with appedix) 612 figures (please
More informationElementary Theory of Russian Roulette
Elemetary Theory of Russia Roulette iterestig patters of fractios Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some
More informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationTHE HEIGHT OF qbinary SEARCH TREES
THE HEIGHT OF qbinary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationOn Formula to Compute Primes. and the n th Prime
Applied Mathematical cieces, Vol., 0, o., 3535 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih AbdulNabi
More informationNEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff,
NEW HIGH PERFORMNCE COMPUTTIONL METHODS FOR MORTGGES ND NNUITIES Yuri Shestopaloff, Geerally, mortgage ad auity equatios do ot have aalytical solutios for ukow iterest rate, which has to be foud usig umerical
More informationBINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients
652 (1226) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you
More informationEkkehart Schlicht: Economic Surplus and Derived Demand
Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 200617 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät LudwigMaximiliasUiversität Müche Olie at http://epub.ub.uimueche.de/940/
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 KolmogorovSmirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationHeat (or Diffusion) equation in 1D*
Heat (or Diffusio) equatio i D* Derivatio of the D heat equatio Separatio of variables (refresher) Worked eamples *Kreysig, 8 th Ed, Sectios.4b Physical assumptios We cosider temperature i a log thi wire
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: CouratFischer formula ad Rayleigh quotiets The
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationMath 114 Intermediate Algebra Integral Exponents & Fractional Exponents (10 )
Math 4 Math 4 Itermediate Algebra Itegral Epoets & Fractioal Epoets (0 ) Epoetial Fuctios Epoetial Fuctios ad Graphs I. Epoetial Fuctios The fuctio f ( ) a, where is a real umber, a 0, ad a, is called
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationGCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4
GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook Alevel Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationChapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions
Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationTHE ARITHMETIC OF INTEGERS.  multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS  multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
More information3. If x and y are real numbers, what is the simplified radical form
lgebra II Practice Test Objective:.a. Which is equivalet to 98 94 4 49?. Which epressio is aother way to write 5 4? 5 5 4 4 4 5 4 5. If ad y are real umbers, what is the simplified radical form of 5 y
More informationSolving Logarithms and Exponential Equations
Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationLearning objectives. Duc K. Nguyen  Corporate Finance 21/10/2014
1 Lecture 3 Time Value of Moey ad Project Valuatio The timelie Three rules of time travels NPV of a stream of cash flows Perpetuities, auities ad other special cases Learig objectives 2 Uderstad the timevalue
More informationEngineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationCURIOUS MATHEMATICS FOR FUN AND JOY
WHOPPING COOL MATH! CURIOUS MATHEMATICS FOR FUN AND JOY APRIL 1 PROMOTIONAL CORNER: Have you a evet, a workshop, a website, some materials you would like to share with the world? Let me kow! If the work
More informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real oegative umber R, called the radius
More informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More information