Modulus of smoothness

This sandbox is in the article namespace. Either move this page into your userspace, or remove the {{User sandbox}} template.

Moduli of smoothness

Modulus of smoothness of order n of a function f∈C[a,b] is the function ${\displaystyle \omega _{n}}$ :[0,∞)→ℝ defined by ${\displaystyle \omega _{n}(t,f,[a,b])=\sup _{h\in [0,t]}\sup _{x\in [a,b-nh]}|\Delta _{h}^{n}(f,x)|,}$  for ${\displaystyle t\in [0,{\frac {b-a}{n}}],}$  and ${\displaystyle \omega _{n}(t,f,[a,b])=\omega _{n}({\frac {b-a}{n}},f,[a,b]),}$  for ${\displaystyle t>{\frac {b-a}{n}}.}$ 

^[1]

Here we used the definition of the [difference] (n-th order forward difference)

${\displaystyle \Delta _{h}^{n}(f,x_{0})=\sum _{i=1}^{n}(-1)^{n-i}{\binom {n}{i}}f(x_{0}+ih).}$ 

Properties:

1. ${\displaystyle \omega _{n}(0)=0,}$  ${\displaystyle \omega _{n}(0+)=0.}$ 

2. ${\displaystyle \omega _{n}}$  is non-decreasing on ${\displaystyle [0,\infty ).}$ 

3. ${\displaystyle \omega _{n}}$  is continuous on ${\displaystyle [0,\infty ).}$ 

4. ${\displaystyle \omega _{n}(mt)\leq m^{n}\omega _{n}(t)}$ , ${\displaystyle m\in \mathbb {N} }$ , ${\displaystyle t\geq 0.}$ 

5. ${\displaystyle \omega _{n}(f,\lambda t)\leq (\lambda +1)^{n}\omega _{n}(f,\lambda t)}$ , ${\displaystyle \lambda >0.}$ 

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

   Here ${\displaystyle \|g(x)\|_{L_{\infty }[-1,1]}=\sup _{x\in [-1,1]}|g(x)|.}$  

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 more general version of Jackson inequality.

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