eschiesser
- 17
- 0
Homework Statement
So I'm supposed to show that a finite Fourier approximation is the optimal approximation for a given function.
I am to suppose we have a given set of functions \phi _k(x),k=1,2,\text{...}N defined on a\leq x\leq b.
They are orthogonal \int _a^b\phi _m(x)\phi _n(x)dx=0 \text{ for } m\neq n
and are normalized \int _a^b\left[\phi _m(x)\right]{}^2dx=1
a general approximation for f(x) in terms of these N functions is
f_{\text{app}} (x)=\sum _{m=1}^N \gamma _m\phi _m(x)
One possible choice of coefficients is the Fourier coefficients defined by:
f_m=\int _a^bf(x)\phi _m(x)dx
The mean square error is defined as:
E=\int_a^b \left[f(x)-f_{\text{app}} (x)\right]{}^2 \, dx=\int_a^b \left[f(x)-\sum _{m=1}^N \gamma _m\phi _m(x)\right]{}^2 \, dx
I am supposed to show that the Fourier coefficients would be the optimal choice of \gamma _m to minimize E
The Attempt at a Solution
Thus far, I have carried out the square in the integrand of the error term, used the idea of orthogonality, and substituted the Fourier coefficients in for gamma, but from there I am stuck! Here is what I have...
E=\int _a^b[f(x)]^2dx-2\int _a^bf(x)\left[\sum _{m=1}^N \int _a^bf(x)\phi _m(x)dx\right]\phi _m(x)dx+\left[\sum _{m=1}^N \int _a^bf(x)\phi _m(x)dx\right]{}^2
From here, I am stuck! is there some kind of simplification that I am missing? this is very frustrating. Any help/nudge would be appreciated.
-Eric