Modulus of smoothness

In mathematics, moduli of smoothness are used to quantitatively measure smoothness of functions. Moduli of smoothness generalise modulus of continuity and are used in approximation theory and numerical analysis to estimate errors of approximation by polynomials and splines.

Moduli of smoothness

The modulus of smoothness of order $n$ ^[1] of a function $f\in C[a,b]$ is the function $\omega_n:[0,\infty)\to\mathbb{R}$ defined by

$\omega_n(t,f,[a,b])=\sup_{h\in[0,t]}\sup_{x\in[a,b-nh]}|\Delta_h^n(f,x)|\text{ for }0\le t\le \frac{b-a} n,$

and

$\omega_n(t,f,[a,b])=\omega_n\left(\frac{b-a}{n},f,[a,b]\right),\text{ for }t>\frac{b-a}{n},$

where we the finite difference (n-th order forward difference) are defined as

$\Delta_h^n(f,x_0)=\sum_{i=1}^n(-1)^{n-i}\binom{n}{i} f(x_0+ih).$

Properties

1. $\omega_n(0)=0,$ $\omega_n(0+)=0.$

2. $\omega_n$ is non-decreasing on $[0,\infty).$

3. $\omega_n$ is continuous on $[0,\infty).$

4. $\omega_n(mt)\leq m^n\omega_n(t)$, $m\in\mathbb{N}$, $t\geq0.$

5. $\omega_n(f,\lambda t)\leq (\lambda +1)^n\omega_n(f,t)$, $\lambda>0.$

6. For $r\in N$, denote by $W^r$ the space of continuous function on $[-1,1]$ that have $(r-1)$-st absolutely continuous derivative on $[-1,1]$ and $\|f^{(r)}\|_{L_{\infty}[-1,1]}<+\infty.$ If $f\in W^r$, then $\omega_r(t,f,[-1,1])\leq t^r\|f^{(r)}\|_{L_{\infty}[-1,1]}, t\geq 0,$ where $\|g(x)\|_{L_{\infty}[-1,1]}={\mathrm{ess} \sup}_{x\in [-1,1]}|g(x)|.$

Applications

Moduli of smoothness can be used to prove estimates on the error of approximation. Due to property (6), moduli of smoothness provide more general estimates than the estimates in terms of derivatives.

For example, moduli of smoothness are used in Whitney inequality to estimate the error of local polynomial approximation. Another application is given by the following more general version of Jackson inequality:

For every natural number $n$, if $f$ is $2\pi$-periodic continuous function, there exists a trigonometric polynomial $T_n$ of degree $\le n$ such that

$|f(x)-T_n(x)|\leq c(k)\omega_k\left(\frac{1}{n},f\right),\quad x\in[0,2\pi],$

where the constant $c(k)$ depends on $k\in\mathbb{N}.$

References

1. DeVore, Ronald A., Lorentz, George G., Constructive approximation, Springer-Verlag, 1993.