Archive for May, 2010

III.26 The Fast Fourier Transform: Page 203

Monday, May 31st, 2010

The Fast Fourier Transform

Inverse

Convert convolutions into multiplication

Quick way to multiply two polynomials

Quantum computer to factorize large integers with fast fourier transform and a result of Peter Shor.

III.26 The Fast Fourier Transform: Page 202

Friday, May 28th, 2010

The Fast Fourier Transform

Continuous

Discrete

III.25 The Exponential and Logarithmic Functions, The Logarithm Function: Page 202

Thursday, May 27th, 2010

The Logarithm Function

III.25 The Exponential and Logarithmic Functions, Complex Number Extension: Page 201

Wednesday, May 26th, 2010

The Exponential Function Complex Number Extension

III.25 The Exponential and Logarithmic Functions, Exponentiation and the Exponential Function: Pages 199 – 200

Tuesday, May 25th, 2010

The Exponential and Logarithmic Functions

Exponentiation

Exponential Function

III.24 Expanders: Eigenvalues and Applications by Avi Wigderson: Page 198

Monday, May 24th, 2010

Expanders and Eigenvalues

Applications of Expanders

III.24 Expanders: Existence by Avi Wigderson: Page 197

Friday, May 21st, 2010

Existence of Expanders

Some graphs can be most effectively described by a listing of the neighbors of a node rather than a complete listing of the graph.

III.23 The Euler and Navier-Stokes Equations by Charles Fefferman and III.24 Expanders by Avi Wigderson: Pages 195 – 196

Thursday, May 20th, 2010

The Euler and Navier-Stokes Equations

Expanders

III.22 The Continued Fractions For Functions and III.23 The Euler and Navier-Stokes Equations by Charles Fefferman: Pages 193 – 194

Friday, May 14th, 2010

The Continued Fractions For Functions

The Euler and Navier-Stokes Equations by Charles Fefferman

III.22 The Euclidean Algorithm and Continued Fractions For Numbers: Pages 191 – 192

Thursday, May 13th, 2010

The Euclidean Algorithm

Continued Fractions For Numbers