Element of a basis for a function space

This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these messages )

•
This article includes a list of general references , but it lacks sufficient corresponding inline citations . Please help to improve this article by introducing more precise citations. (March 2013) (Learn how and when to remove this message )
•
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts , without removing the technical details. (September 2019) (Learn how and when to remove this message )
•
This article may need to be rewritten to comply with Wikipedia’s quality standards . You can help. The talk page may contain suggestions. (September 2019)
(Learn how and when to remove this message )

In mathematics , a basis function is an element of a particular basis for a function space , serving as a fundamental building block for constructing more complex functions within that space. Every function within the function space can be expressed as a linear combination of these basis functions, with the nature of this representation varying significantly between finite-dimensional and infinite-dimensional contexts. In finite-dimensional vector spaces , this representation is purely algebraic and involves only finitely many basis functions, allowing exact reconstruction through linear algebra techniques. In contrast, infinite-dimensional settings typically require infinite series expansions whose convergence properties depend critically on the topology of the function space and the specific basis chosen.

Within numerical analysis and approximation theory , basis functions are frequently termed blending functions due to their essential role in interpolation problems. In these applications, an appropriate mixture of basis functions generates an interpolating function that passes through given data points, with the “blend” determined by evaluating the basis functions at those discrete locations. This blending property makes basis functions indispensable for constructing splines, finite element approximations, and spectral methods across scientific computing domains.

Examples

Monomial basis for C^ω

The monomial basis provides the foundational structure for the vector space of analytic functions , consisting of the infinite set:

{ x^n | n ∈ ℕ }

This basis underpins the construction of Taylor series expansions, where analytic functions are represented as infinite sums of scaled monomials. The monomial basis proves particularly valuable for local approximations near expansion points, though its global approximation properties on finite intervals are often suboptimal compared to orthogonal polynomial bases. This limitation stems from the increasing similarity between higher-degree monomials, leading to numerical instability in practical computations requiring high-degree approximations.

Monomial basis for polynomials

For the vector space of polynomials of degree at most n, the monomial basis {1, x, x², …, xⁿ} provides the most straightforward representation system. Every polynomial p(x) can be expressed uniquely as:

p(x) = a₀ + a₁x + a₂x² + ⋯ + aₙxⁿ

where the coefficients a_k are real or complex numbers. While algebraically convenient, this basis suffers from numerical ill-conditioning when solving interpolation problems, as demonstrated by Runge’s phenomenon for equidistant interpolation points. Alternative bases like orthogonal polynomials (Legendre, Chebyshev) often provide superior numerical stability for polynomial approximation tasks.

Fourier basis for L²[0,1]

The Fourier basis provides a fundamental orthonormal Schauder basis for the space of square-integrable functions on the unit interval. This basis consists of normalized trigonometric functions organized as:

{ √2 sin(2πnx) | n ∈ ℕ } ∪ { √2 cos(2πnx) | n ∈ ℕ } ∪ {1 }

The inclusion of both sine and cosine functions with matching frequencies enables the representation of arbitrary periodic functions through their phase components, while the constant function 1 completes the basis for DC offset representation. The orthonormality of this system with respect to the standard L² inner product guarantees unique coefficient determination through orthogonal projection. This basis underpins Fourier series expansions central to harmonic analysis , signal processing, and solving partial differential equations with periodic boundary conditions.

Advanced Considerations

The selection of appropriate basis functions involves careful consideration of several factors:

Approximation power: How efficiently the basis can represent functions of interest with few terms
Numerical stability: Condition number of associated interpolation matrices
Computational efficiency: Complexity of evaluating basis functions and computing coefficients
Special properties: Preservation of continuity, differentiability, or other structural features

Different applications demand specialized basis functions:

Radial basis functions excel at scattered data interpolation in multiple dimensions
Orthogonal wavelet bases provide multiresolution analysis capabilities
Finite element bases offer localized support for solving PDEs
Biorthogonal system bases balance analysis and synthesis requirements

Basis Function