About the Project

Fourier-series solutions

AdvancedHelp

(0.002 seconds)

11—11 of 11 matching pages

11: 3.11 Approximation Techniques
In fact, (3.11.11) is the Fourier-series expansion of f ( cos θ ) ; compare (3.11.6) and §1.8(i). … to the maximum error of the minimax polynomial p n ( x ) is bounded by 1 + L n , where L n is the n th Lebesgue constant for Fourier series; see §1.8(i). …
Example. The Discrete Fourier Transform
is called a discrete Fourier transform pair.
The Fast Fourier Transform