approximation-theory

Layer 0 — Mathematics24 concepts in this subtree

Branch of analysis that studies how functions may be approximated by simpler ones — polynomials, rational functions, splines, wavelets — and quantifies the error. Foundational theorems: Weierstrass 1885 uniform approximation (continuous f…

Chebyshev polynomials T_n: orthogonal basis + minimax optimality
Bernstein polynomials B_{k,n}(x): partition of unity + Weierstrass proof
Padé approximant [m/n]: rational P_m/Q_n matching Taylor to order m+n
T_2(x) = 2x² − 1: alternation (−1,0,1)→(1,−1,1); roots at ±√2/2
Bernstein partition-of-unity n=2: Σ_k B_{k,2}(x) ≡ 1; midpoint (1/4,1/2,1/4)
[1/1] Padé of exp: (1+x/2)/(1-x/2); leading O(x³) residual 1/12
Weierstrass approximation theorem
Taylor series approximation
Fourier series approximation
Spline interpolation (piecewise polynomial)
Minimax uniform approximation
Lebesgue constant for interpolation
Weierstrass approximation (1885)
Chebyshev equioscillation
Muntz-Szasz theorem (1914)
Jackson theorem (1911)
Fejer kernel (Cesaro summation 1900)
Nyquist-Shannon sampling theorem
Weierstrass theorem (1885)
Chebyshev (1854)
KAR theorem (1957)
Padé (1892)
Splines (Schoenberg 1946)
Wavelets (Mallat 1989)
Explore the approximation-theory subtree on the interactive graph →