Fourier sine series, Fourier cosine series

-

When a function is an odd function, its Fourier series contains only the sine functions. Such a Fourier series is called a Fourier sine series. When a function is an even function, its Fourier series contains only the cosine functions (and possibly a constant). Such a Fourier series is called a Fourier cosine series.



Example. Consider the function \(f \in \mathcal{P}_{2\pi}\) defined by

\[f(x) = x ~~~ (-\pi < x < \pi).\]

Note that \(f\) is an odd function (i.e., \(f(-x) = -f(x)\)). The Fourier coefficients are obtained as (exercise!)

\[\begin{eqnarray*} a_n &=& \frac{1}{\pi}\int_0^{2\pi}f(x)\cos(nx)dx =\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\cos(nx)dx\\ &=& 0 \\ b_n &=& \frac{1}{\pi}\int_0^{2\pi}f(x)\sin(nx)dx =\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\sin(nx)dx.\\ &=& (-1)^{n+1}\frac{2}{n}. \end{eqnarray*}\]

Thus, we have

\[x \sim 2\left[\frac{\sin x}{1} - \frac{\sin(2x)}{2} + \frac{\sin(3x)}{3} -\cdots +(-1)^{n+1}\frac{\sin(nx)}{n} + \cdots\right]\]

for \(-\pi < x < \pi\). □

More generally, if \(f\in \mathcal{R}_{2\pi}^{1}\) is an odd function, the coefficients of \(\cos(nx)\) are all 0 so \(S[f]\) consists of only the \(\sin(nx)\) terms,

\[f \sim S[f] = \sum_{n=1}^{\infty}b_n\sin(nx).\]

Such a Fourier series is called a Fourier sine series.

In contrast, if \(f\in \mathcal{R}_{2\pi}^{1}\) is an even function, the coefficients of \(\sin(nx)\) are all 0 so \(S[f]\) consists of only the \(\cos(nx)\) terms,

\[f \sim S[f] = \frac{1}{2}a_0 + \sum_{n=1}^{\infty}a_n\cos(nx).\]

Such a Fourier series is called a Fourier cosine series.

Example (evenfunc). Consider the function \(f \in \mathcal{P}_{2\pi}\) defined by

\[f(x) = 1 - \frac{|x|}{\pi} ~~~ (|x| \leq \pi).\]

\(f\) is a continuous, even, and periodic function. Clearly, \(b_n = 0\) (verify!). It is easy to see \(a_0 = 1\). For \(n = 1, 2, \cdots\),

\[\begin{eqnarray*} \pi a_n &=& \int_{-\pi}^{\pi}f(x)\cos(nx)dx = 2\int_{0}^{\pi}\left(1 - \frac{x}{\pi}\right)\cos(nx)dx\\ &=& \frac{2}{n^2\pi}\{1 - (-1)^n\} ~~~ (n = 1, 2, \cdots). \end{eqnarray*}\]

That is,

\[a_n = \left\{ \begin{array}{cc} 1 & (n = 0),\\ \frac{4}{\pi^2 n^2} & (n = 1, 3, 5, \cdots),\\ 0 & (n = 2, 4, 6, \cdots). \end{array} \right.\]

Therefore,

\[1 - \frac{|x|}{\pi} \sim \frac{1}{2} + \frac{4}{\pi^2}\left(\frac{\cos x}{1^2} + \frac{\cos(3x)}{3^2} + \frac{\cos(5x)}{5^2} + \cdots\right) ~~~ (-\pi < x < \pi).\]

□

Now, suppose we have a function \(g(x)\) on \(I_0 = (0, \pi)\) that is integrable and continuous on \(I_0\) except for finitely many points. Based on this function, let us define the following odd function \(f_o\):

\[\begin{eqnarray*} f_o(x) &=& g(x) \text{ for } x \in (0, \pi),\\ f_o(x) &=& -g(-x) \text{ for } x \in (-\pi, 0),\\ f_o(x + 2n\pi) &=& f_o(x) \text{ for } x \in (-\pi, \pi)\setminus \{0\}, n\in \mathbb{N}. \end{eqnarray*}\]

Similarly, we can define the following even function \(f_e\):

\[\begin{eqnarray*} f_e(x) &=& g(x) \text{ for } x \in (0, \pi),\\ f_e(x) &=& g(-x) \text{ for } x \in (-\pi, 0),\\ f_e(x + 2n\pi) &=& f_e(x) \text{ for } x \in (-\pi, \pi)\setminus \{0\}, n\in \mathbb{N}. \end{eqnarray*}\]

The corresponding Fourier series are of the forms

\[\begin{eqnarray*} f_o &\sim & \sum_{n=1}^{\infty}b_n\sin(nx),\\ f_e &\sim & \frac{1}{2}a_0 + \sum_{n=1}^{\infty}a_n\cos(nx), \end{eqnarray*}\]

where

\[\begin{eqnarray*} a_n &=& \frac{1}{\pi}\int_{-\pi}^{\pi}f_e(x)\cos(nx)dx = \frac{2}{\pi}\int_{0}^{\pi}g(x)\cos(nx)dx,\\ b_n &=& \frac{1}{\pi}\int_{-\pi}^{\pi}f_o(x)\sin(nx)dx = \frac{2}{\pi}\int_{0}^{\pi}g(x)\sin(nx)dx. \end{eqnarray*}\]

Using these coefficients, \(g(x)\) on \(I_0 = (0, \pi)\) can be expressed in two ways:

\[\begin{eqnarray*} g(x) &\sim& \sum_{n=1}^{\infty}b_n\sin(nx),\\ g(x) &\sim & \frac{1}{2}a_0 + \sum_{n=1}^{\infty}a_n\cos(nx). \end{eqnarray*}\]

Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

-
Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

-
Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

-
Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more