Lably
Skip to content

Least-squares function approximation

  • 2 min read
  • 2 chapters

Related on Lably

Through Mathematics, Least squares and Real number

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)≈fn(x)=a1ϕ1(x)+a2ϕ2(x)+⋯+anϕn(x),

with the set of functions {ϕj(x)} an orthonormal set over the interval of interest, say [a, b]: see also Fejér's theorem. The coefficients {aj} are selected to make the magnitude of the difference ||f − fn||2 as small as possible. For example, the magnitude, or norm, of a function g (x ) over the interval [a, b] can be defined by:

‖g‖=(∫abg∗(x)g(x)dx)1/2

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 { ϕj(x) } satisfy orthonormality relations:

∫abϕi∗(x)ϕj(x)dx=δij,

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

‖fn‖2=|a1|2+|a2|2+⋯+|an|2.

The coefficients {aj} making ||f − fn||2 as small as possible are found to be:

aj=∫abϕ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.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Statistics and probability