Least-squares Function Approximation

In mathematics, least squares function approximation applies the principle of least squares to function approximation, by means of a weighted sum of other functions. The best approximation can be defined as that which minimizes the difference between the original function and the approximation; for a least-squares approach the quality of the approximation is measured in terms of the squared differences between the two.

Functional analysis

A generalization to approximation of a data set is the approximation of a function by a sum of other functions, usually an orthogonal set:

:$f(x) \approx f_n (x) = a_1 \phi _1 (x) + a_2 \phi _2(x) + \cdots + a_n \phi _n (x), \$

with the set of functions an orthonormal set over the interval of interest, : see also Fejér's theorem. The coefficients are selected to make the magnitude of the difference , , , , ² as small as possible. For example, the magnitude, or norm, of a function over the can be defined by:

:$\, g\, = \left(\int_a^b g^*(x)g(x) \, dx \right)^$

where the ‘*’ denotes complex conjugate in the case of complex functions. The extension of Pythagoras' theorem in this manner leads to function spaces and the notion of Lebesgue measure, an idea of “space” more general than the original basis of Euclidean geometry. The satisfy orthonormality relations:

:$\int_a^b \phi _i^* (x)\phi _j (x) \, dx =\delta_,$

where ''δ''_''ij'' is the Kronecker delta. Substituting function into these equations then leads to
the ''n''-dimensional Pythagorean theorem:

:$\, f_n\, ^2 = , a_1, ^2 + , a_2, ^2 + \cdots + , a_n, ^2. \,$

The coefficients making , , ''f'' − ''f''_''n'', , ² as small as possible are found to be:

:$a_j = \int_a^b \phi _j^* (x)f (x) \, dx.$

The generalization of the ''n''-dimensional Pythagorean theorem to ''infinite-dimensional '' real inner product spaces is known as Parseval's identity or Parseval's equation.

Particular examples of such a representation of a function are the Fourier series and the generalized Fourier series.

Further discussion

Using linear algebra

It follows that one can find a "best" approximation of another function by minimizing the area between two functions, a continuous function $f$ on ,b/math> and a function $g\in W$ where $W$ is a subspace of C ,b/math>:
:$\text = \int_a^b \left\vert f(x) - g(x)\right\vert \, dx,$
all within the subspace $W$. Due to the frequent difficulty of evaluating integrands involving absolute value, one can instead define
:$\int_a^b$f(x) - g(x) ^2\, dx
as an adequate criterion for obtaining the least squares approximation, function $g$, of $f$ with respect to the inner product space $W$.

As such, $\lVert f-g \rVert ^2$ or, equivalently, $\lVert f-g \rVert$, can thus be written in vector form:

:$\int_a^b$f(x)-g(x) 2\, dx = \left\langle f-g , f-g\right\rangle = \lVert f-g\rVert^2.

In other words, the least squares approximation of $f$ is the function $g\in \text W$ closest to $f$ in terms of the inner product $\left \langle f,g \right \rangle$. Furthermore, this can be applied with a theorem:
:Let $f$ be continuous on a,b /math>, and let $W$ be a finite-dimensional subspace of C ,b/math>. The least squares approximating function of $f$ with respect to $W$ is given by
::$g = \left \langle f,\vec w_1 \right \rangle \vec w_1 + \left \langle f,\vec w_2 \right \rangle \vec w_2 + \cdots + \left \langle f,\vec w_n \right \rangle \vec w_n,$
:where $B = \$ is an orthonormal basis for $W$.

References

{{reflist

Least squares
Approximation theory