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.

Interesting scientific or quantitative thoughts or ideas!

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.

The Fast Fourier Transform

Continuous

Discrete

The Logarithm Function

The Exponential Function Complex Number Extension

The Exponential and Logarithmic Functions

Exponentiation

Exponential Function

Expanders and Eigenvalues

Applications of Expanders

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.

The Euler and Navier-Stokes Equations

Expanders

The Continued Fractions For Functions

The Euler and Navier-Stokes Equations by Charles Fefferman

The Euclidean Algorithm

Continued Fractions For Numbers