# 13 Fast Fourier Transform (FFT)

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform Cotiuous ad Discrete Fourier Trasforms Revisited Let E k be the complex expoetial defied by ad cosider the complex ier product The ad for k l we have f, g 1 E k x) : e ikx fx)gx)dx. E k, E k 1 e } ikx {{ e ikx } dx 1, 1 E k, E l e ikx e ilx dx e ik l)x dx e ik l)x ik l) [e ik l) e ik l)] 1 ik l) 1 ik l) eik l) [ 1 e l k)i }{{} 1 As we just saw, the complex expoetials are orthoormal o the iterval [, ]. I fact, they are used as the basis fuctios for complex Fourier series with Fourier coefficiets c k 1 fx) k c k e ikx ft)e ikt dt f, E k ˆfk). As metioed earlier, the coefficiets c k ˆfk) are also kow as the Fourier trasform of f. Remark ote that the otatio used here is a bit differet from that used i Chapter 11. I particular, earlier we used the iterval, ). ]

2 I order to get to the discrete Fourier trasform we first trucate the Fourier series ad obtai P x) c k E k x) a trigoometric polyomial. This ca be verified by writig P x) c k e ikx c k e ix ) k so that P is a polyomial of degree i the complex expoetial e ix. We ow also cosider equally spaced data i the iterval [0, ), i.e., x j, fx j )) with x j j, j 0, 1,..., 1, 1) ad itroduce a discrete pseudo-)ier product f, g 1 f ) j g ) j. 13) Remark This is oly a pseudo-ier product sice f, f 0 implies f 0 oly at the discrete odes j, j 0, 1,..., 1. Theorem 13.1 The set {E k } of complex expoetials is orthoormal with respect to the ier product, defied i 13). Proof First, E k, E k 1 1 ) ) j j E k E k e ikj/ e ikj/ }{{} 1 1. ext, for k l we have E k, E l ) ) j j E k E l e ikj/ e ilj/ ) e i k l) j. ow, sice k l, e i k l) 1 136

3 we ca apply the formula for the sum of a fiite geometric series to get Fially, sice E k, E l 1 e i k l) ) e i k l) 1 ) 1. e i k l) 1 the orthogoality result follows. This gives rise to a best approximatio result just as for stadard Fourier series): Corollary 13. Let data be give as i 1) ad cosider G spa{e k } with <. The the best least squares approximatio to the data from G with respect to the ier product 13)) is give by the discrete Fourier series with c k f, E k 1 gx) f c k E k x) ) j j ik e, k 0, 1,...,. Remark 1. The coefficiets c k of the discrete Fourier series are called the discrete Fourier trasform DFT) of f.. It is our goal to compute the DFT ad also evaluate g) via the fast Fourier trasform FFT). 3. ote that, eve if the data is real, ) the DFT will i geeral be complex. If, e.g., 4, ad the values f j, j 0, 1,, 3 are 4, 0, 3, 6 respectively, the the coefficiets c k are 13. The FFT Algorithm We start with the trigoometric polyomial c 0 13 c i c 1 c 3 1 6i. with DFT coefficiets P x) c k 1 f c k E k x) ) j j ik e 137

4 1 fx j )λ k ) j where x j j ad we set k i λ k e. Remark The values λ k or more aturally λ k ) are ofte referred to as the -th roots of uity. This is illustrated i Figure 8 for l 4 l Re l 0 l Im l Figure 8: Roots of uity λ k, k 0, 1,..., 1, for 5. The computatio of each coefficiet c k correspods to evaluatio of a polyomial of degree 1 i λ k. Usig ested multiplicatio Horer s method) this ca be doe i O) operatios. Sice we have coefficiets, the polyomial P ca be costructed i O ) operatios. The major beefit of the fast Fourier trasform is that it reduces the amout of work to O log ) operatios. The FFT was discovered by Cooley ad Tukey i However, Gauss seemed to already be aware of similar ideas. Oe of the most popular moder refereces is the DFT Owers Maual by Briggs ad Heso published by SIAM i 1995). It is the dramatic reductio i computatioal complexity that eared the FFT a spot o the list of Top 10 Algorithms of the 0th Cetury see hadout). The FFT is based o the followig observatio: Theorem 13.3 Let data x k, fx k )), x k k, k 0, 1,..., 1, be give, ad assume that p ad q are expoetial polyomials of degree at most 1 which iterpolate 138

5 part of the data accordig to px j ) fx j ), qx j ) fx j+1 ), j 0, 1,..., 1, the the expoetial polyomial of degree at most 1 which iterpolates all the give data is P x) e ix ) px) e ix ) q x ). 14) Proof Sice e ix e ix) has degree, ad p ad q have degree at most 1 it is clear that P has degree at most 1. We eed to verify the iterpolatio claim, i.e., show that By assumptio we have where P x k ) 1 P x k ) fx k ), k 0, 1,..., e ix k ) pxk ) + 1 e ix k e i k e i ) k 1) k. ) 1 e ix k q x k ) Therefore { px k ) if k eve, P x k ) q x k ) if k odd. Let k be eve, i.e., k j. The, by the assumptio o p P x j ) px j ) fx j ), j 0, 1,..., 1. O the other had, for k j + 1 odd), we have usig the assumptio o q) P x j+1 ) q x j+1 ) qx j ) fx j+1 ), j 0, 1,..., 1. This is true sice x j+1 j + 1) j x j. The secod useful fact tells us how to obtai the coefficiets of P from those of p ad q. Theorem 13.4 Let 1 1 p α j E j, q β j E j, ad P The, for j 0, 1,..., 1, 1 γ j E j. γ j 1 α j + 1 e ij/ β j γ j+ 1 α j 1 e ij/ β j. 139

6 Proof I order to use 14) we eed to rewrite q x ) 1 β j E j x ) 1 β j e ijx ) 1 β j e ijx e ij/. Therefore P x) e ix ) px) e ix ) q x ) e ix ) α j e ijx e ix ) β j e ijx e ij/ 1 1 [ α j + β j e ij/) e ijx + α j β j e ij/) e i+j)x]. However, the terms i paretheses together with the factor 1/) lead precisely to the formulæ for the coefficiets γ. Example We cosider the data x 0 y f0) f) ow we apply the DFT to fid the iterpolatig polyomial P. We have 1 ad P x) 1 γ j E j x) γ 0 e 0 + γ 1 e ix. Accordig to Theorem 13.4 the coefficiets are give by γ 0 1 α0 + β 0 e 0), γ 1 1 α0 β 0 e 0). Therefore, we still eed to determie α 0 ad β 0. They are foud via iterpolatio at oly oe poit cf. Theorem 13.3): px) qx) 0 α j E j x) α 0 such that px 0 ) fx 0 ) α 0 fx 0 ) 0 β j E j x) β 0 such that qx 0 ) fx 1 ) β 0 fx 1 ). With x 0 0 ad x 1 we obtai P x) 1 f0) + f)) + 1 f0) f)) eix.. 140

7 Example We ow refie the previous example, i.e., we cosider the data ow, ad P is of the form x 0 y f0) f ) P x) 3 f) 3 γ j E j x). f 3 Accordig to Theorem 13.4 the coefficiets are give by γ 0 1 α 0 + β 0 ), γ 1 1 ) α 1 + β 1 e i/ }{{}, i γ 1 α 0 β 0 ), γ 3 1 ) α 1 β 1 e i/ }{{}. i This leaves the coefficiets α 0, β 0 ad α 1, β 1 to be determied. They are foud via iterpolatio at two poits cf. Theorem 13.3): px) qx) ). 1 α j E j x) such that px 0 ) fx 0 ), px ) fx ), 1 β j E j x) such that qx 0 ) fx 1 ), qx ) fx 3 ). These are both problems of the form dealt with i the previous example, so a recursive strategy is suggested. A geeral recursive algorithm for the FFT is give i the Kicaid/Cheey textbook o pages 455 ad 456. I order to figure out the computatioal complexity of the FFT algorithm we assume ) m so that the recursive strategy for the FFT ca be directly applied. If is ot a power of, the the data ca be padded appropriately with zeros). I order to evaluate the iterpolatig expoetial polyomial P x) c k E k x) 1 γ j E j x) we ca use the FFT to compute the coefficiets c k or γ j ). Istead of givig a exact cout of the arithmetic operatios ivolved i this task, we estimate the miimum umber of multiplicatios required to compute the coefficiets of a expoetial polyomial with terms. 141

8 Lemma 13.5 Let R) be the miimum umber of multiplicatios required to compute the coefficiets of a expoetial polyomial with terms. The R) R) +. Proof There are coefficiets γ j computed recursively via the formulas γ j 1 α j + 1 e ij/ β j γ j+ 1 α j 1 e ij/ β j listed i Theorem If the factors 1 e ij/, 0, 1,..., 1, are pre-computed, the each of these formulas ivolves multiplicatios for a total of multiplicatios. Moreover, the coefficiets α j ad β j are determied recursively usig R) multiplicatios each. Theorem 13.6 Uder the same assumptios as i Lemma 13.5 we have R m ) m m. Proof We use iductio o m. For m 0 there are o multiplicatios sice P x) c 0. ow, assume the iequality holds for m. The, by Lemma 13.5 with m ) R m+1) R m ) R m ) + m. By the iductio hypothesis this is less tha or equal to m m + m m + 1) m+1. Settig m m log i Theorem 13.6 implies R) log, i.e., the fast Fourier trasform reduces the amout of computatio required to evaluate a expoetial polyomial from O ) if doe directly) to O log ). For 1000 this meas roughly 10 4 istead of 10 6 operatios. Remark 1. Applicatio of the classical fast Fourier trasform is limited to the case where the data is equally spaced, periodic, ad of legth m. The ofte suggested strategy of paddig with zeros to get a data vector of legth m ) or the applicatio of the FFT to o-periodic data may produce uwated oise.. Various versio of the FFT for o-equally spaced data have also bee proposed i recet years e.g., FFT by Daiel Potts, Gabriele Steidl ad Mafred Tasche). 14

9 Remark Give a vector a [a 0, a 1,..., a ] T of discrete data, Corollary 13. tells us that the discrete Fourier trasform â of a is computed compoetwise as â k 1 j ik a j e, k 0, 1,..., 1. Of course, the FFT ca be used to compute these coefficiets. There is a aalogous formula for the iverse DFT, i.e., a j j ik â k e, j 0, 1,..., 1. We close with a few applicatios of the FFT. Use of the FFT for may applicatios beefits from the fact that covolutio i the fuctio domai correspods to multiplicatio i the trasform domai, i.e., f g ˆfĝ so that we have f g ˆfĝ )ˇ. Some applicatios are ow Filters i sigal or image processig. Compressio of audio of video sigals. E.g., the MP3 file format makes use of the discrete cosie trasform. De-oisig of data cotamiated with measuremet error see, e.g., the Maple worksheet FFT.mws). Multiplicatio with cyclic matrices. A cyclic matrix is of the form a 0 a 1... a 1 a a a 0 a 1... a 1 C a 1 a a 0 a a 1... a 1 a a 0 ad multiplicatio by C correspods to a discrete covolutio, i.e., Cy) i C ij y j a j i y j, i 0,...,, where the subscript o a is to be iterpreted cyclically, i.e., a +1+i a i or a i a +1 i. Thus, a coupled system of liear equatios with cyclic system matrix ca be decoupled ad thus trivially solved) by applyig the discrete Fourier trasform. 143

10 High precisio iteger arithmetic also makes use of the FFT. umerical solutio of differetial equatios. Remark Aother trasform techique that has some similarities to but also some sigificat differeces from) the FFT is the fast wavelet trasform. Usig so-called scalig fuctios ad associated wavelets as orthogoal basis fuctios oe ca also perform best approximatio of fuctios or data). A advatage of wavelets over the trigoometric basis used for the FFT is the fact that ot oly do we have localizatio i the trasform domai, but also i the fuctio domai. 144

### Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

### The Euler Totient, the Möbius and the Divisor Functions

The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

### Properties 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

### Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015

CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a

### 0.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 Kolmogorov-Smirov 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.

### Module 4: Mathematical Induction

Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

### 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

### The second difference is the sequence of differences of the first difference sequence, 2

Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

### Sequences 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

### Infinite 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...

### Tagore Engineering College Department of Electrical and Electronics Engineering EC 2314 Digital Signal Processing University Question Paper Part-A

Tagore Egieerig College Departmet of Electrical ad Electroics Egieerig EC 34 Digital Sigal Processig Uiversity Questio Paper Part-A Uit-I. Defie samplig theorem?. What is kow as Aliasig? 3. What is LTI

### Convexity, 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

### Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.

Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the

### Asymptotic 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

### TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

### Fast 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.

### A 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

### THE 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

### arxiv:1012.1336v2 [cs.cc] 8 Dec 2010

Uary Subset-Sum is i Logspace arxiv:1012.1336v2 [cs.cc] 8 Dec 2010 1 Itroductio Daiel M. Kae December 9, 2010 I this paper we cosider the Uary Subset-Sum problem which is defied as follows: Give itegers

### SAMPLE 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

### SECTION 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,

### Lecture 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.;

### Example 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

### Sequences II. Chapter 3. 3.1 Convergent Sequences

Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

### Class 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,

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 o-egative umber R, called the radius

### Chapter 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

### 1. 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

### Lecture 4: Cheeger s Inequality

Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

### 8.1 Arithmetic Sequences

MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

### Trigonometric 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

### FIBONACCI 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

### Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

### 4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then

SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or p-series (the Compariso Test), but of

### 7. Sample Covariance and Correlation

1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

### Solving Divide-and-Conquer Recurrences

Solvig Divide-ad-Coquer Recurreces Victor Adamchik A divide-ad-coquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios

### Section 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

### x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

### Lesson 15 ANOVA (analysis of variance)

Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

### 4.1 Sigma Notation and Riemann Sums

0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

### Normal 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

### NUMBERS COMMON TO TWO POLYGONAL SEQUENCES

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively

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

### Systems 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) 698-5295 Email: bcm1@cec.wustl.edu Supervised

### The Field Q of Rational Numbers

Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees

### I. Chi-squared Distributions

1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

### THE 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,

### Our 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

### Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant

MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is

### In 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

### Chapter One BASIC MATHEMATICAL TOOLS

Chapter Oe BAIC MATHEMATICAL TOOL As the reader will see, the study of the time value of moey ivolves substatial use of variables ad umbers that are raised to a power. The power to which a variable is

### Maximum 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

### CME 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

### APPLICATION NOTE 30 DFT or FFT? A Comparison of Fourier Transform Techniques

APPLICATION NOTE 30 DFT or FFT? A Compariso of Fourier Trasform Techiques This applicatio ote ivestigates differeces i performace betwee the DFT (Discrete Fourier Trasform) ad the FFT(Fast Fourier Trasform)

### Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the

### Output Analysis (2, Chapters 10 &11 Law)

B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

### Overview 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

### Section 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 =

### 2-3 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

### Notes on exponential generating functions and structures.

Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

### Approximating 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.

### NOTES ON INEQUALITIES FELIX LAZEBNIK

NOTES ON INEQUALITIES FELIX LAZEBNIK Order ad iequalities are fudametal otios of moder mathematics. Calculus ad Aalysis deped heavily o them, ad properties of iequalities provide the mai tool for developig

### CS103A 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

### Factoring 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

### Incremental 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

### Chapter 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

### Lecture 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: Courat-Fischer formula ad Rayleigh quotiets The

### Factors of sums of powers of binomial coefficients

ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

### Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

### Recursion and Recurrences

Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example,

### {{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

### Approximating the Sum of a Convergent Series

Approximatig the Sum of a Coverget Series Larry Riddle Ages Scott College Decatur, GA 30030 lriddle@agesscott.edu The BC Calculus Course Descriptio metios how techology ca be used to explore covergece

### Modified 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

### CHAPTER 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

### Limits, Continuity and derivatives (Stewart Ch. 2) say: the limit of f(x) equals L

Limits, Cotiuity ad derivatives (Stewart Ch. 2) f(x) = L say: the it of f(x) equals L as x approaches a The values of f(x) ca be as close to L as we like by takig x sufficietly close to a, but x a. If

### CS103X: 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 six-figure salaries i whole dollar amouts are there that cotai at least

### THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary 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

### WHEN 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

### 1.3 Binomial Coefficients

18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to

### Cantilever Beam Experiment

Mechaical Egieerig Departmet Uiversity of Massachusetts Lowell Catilever Beam Experimet Backgroud A disk drive maufacturer is redesigig several disk drive armature mechaisms. This is the result of evaluatio

### Escola Federal de Engenharia de Itajubá

Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica Pós-Graduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José

### where: 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

### Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites

Gregory Carey, 1998 Liear Trasformatios & Composites - 1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio

### DEFINITION OF INVERSE MATRIX

Lecture. Iverse matrix. To be read to the music of Back To You by Brya dams DEFINITION OF INVERSE TRIX Defiitio. Let is a square matrix. Some matrix B if it exists) is said to be iverse to if B B I where

### A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

### Using Excel to Construct Confidence Intervals

OPIM 303 Statistics Ja Stallaert Usig Excel to Costruct Cofidece Itervals This hadout explais how to costruct cofidece itervals i Excel for the followig cases: 1. Cofidece Itervals for the mea of a populatio

### Basic Measurement Issues. Sampling Theory and Analog-to-Digital Conversion

Theory ad Aalog-to-Digital Coversio Itroductio/Defiitios Aalog-to-digital coversio Rate Frequecy Aalysis Basic Measuremet Issues Reliability the extet to which a measuremet procedure yields the same results

### An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function

A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;

### Irreducible polynomials with consecutive zero coefficients

Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

### Descriptive statistics deals with the description or simple analysis of population or sample data.

Descriptive statistics Some basic cocepts A populatio is a fiite or ifiite collectio of idividuals or objects. Ofte it is impossible or impractical to get data o all the members of the populatio ad a small

### Here 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

### Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

### Your 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

### Distributions of Order Statistics

Chapter 2 Distributios of Order Statistics We give some importat formulae for distributios of order statistics. For example, where F k: (x)=p{x k, x} = I F(x) (k, k + 1), I x (a,b)= 1 x t a 1 (1 t) b 1

### Department of Computer Science, University of Otago

Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

### Measures of Central Tendency

Measures of Cetral Tedecy A studet s grade will be determied by exam grades ( each exam couts twice ad there are three exams, HW average (couts oce, fial exam ( couts three times. Fid the average if the

### Chair 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

### 1 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.

### Project 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 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity