Content deleted Content added
Lenohka8400 (talk | contribs) No edit summary |
Andriy prm (talk | contribs) m Added context, other small changes |
||
Line 2:
<!-- EDIT BELOW THIS LINE -->
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===▼
Modulus of smoothness of order <math>n</math> ▼
▲Modulus of smoothness of order n
<ref>DeVore, Ronald A., Lorentz, George G., Constructive approximation, Springer-Verlag, 1993.</ref>
of a function <math>f\in C[a,b]</math> is the function <math>\omega_n:[0,\infty)\to\mathbb{R}</math> defined by
Line 22 ⟶ 20:
:<math>\Delta_h^n(f,x_0)=\sum_{i=1}^n(-1)^{n-i}\binom{n}{i} f(x_0+ih).</math>
1. <math>\omega_n(0)=0,</math> <math>\omega_n(0+)=0.</math>
Line 36 ⟶ 34:
6. For <math>r\in N</math>, denote by <math>W^r</math> the space of continuous function on <math>[-1,1]</math> that have <math>(r-1)</math>-st absolutely continuous derivative on <math>[-1,1]</math> and <math>\|f^{(r)}\|_{L_{\infty}[-1,1]}<+\infty.</math> If <math>f\in W^r</math>, then <math>\omega_r(t,f,[-1,1])\leq t^r\|f^{(r)}\|_{L_{\infty}[-1,1]}, t\geq 0,</math> where <math>\|g(x)\|_{L_{\infty}[-1,1]}={\mathrm{ess} \sup}_{x\in [-1,1]}|g(x)|.</math>
==
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 <math>n</math>, if <math>f</math> is <math>2\pi</math>-periodic continuous function, there exists a [[trigonometric polynomial]] <math>T_n</math> of degree <math>\le n</math> such that
Line 48 ⟶ 46:
where the constant <math>c(k)</math> depends on <math>k\in\mathbb{N}.</math>
==References==
{{reflist}}
[[Category:Approximation theory]]
[[Category:Numerical analysis]]
|