On operators of almost best approximation on the classes \(W^ rH_ \omega\) (Q1908432)

From MaRDI portal





scientific article; zbMATH DE number 848926
Language Label Description Also known as
default for all languages
No label defined
    English
    On operators of almost best approximation on the classes \(W^ rH_ \omega\)
    scientific article; zbMATH DE number 848926

      Statements

      On operators of almost best approximation on the classes \(W^ rH_ \omega\) (English)
      0 references
      0 references
      27 March 1996
      0 references
      Let \(P\) be the operator of metric projection, i.e. \(Px= y\) for any \(x\in K\subset Y\), where \(y\) is such that \(|x-y |= \rho (x, Y)\), \(P^\varepsilon_x= x\{ y\in Y: |x- y|\leq \rho (x, Y) (1+ \varepsilon)\}\), \(P^\varepsilon_+ x\{ y\in Y: |x- y|\leq \rho (x, Y)+ \varepsilon\}\). By a multiplicative (additive) \(\varepsilon\)-sampling \(M: K\to Y (A: K\to Y)\) will be meant a mapping such that \(Mx\in P^\varepsilon_\times x (Ax\in P^\varepsilon_+ x)\) for any \(x\in K\). The existence of multiplicative and additive \(\varepsilon\)-sampling whose moduli of continuity have the best order is established for \(K= W^r H_\omega= \{f\in C^r [a; b]: \omega (f^{(r)}, \delta)\leq \omega (\delta)\}\) and \(Y= P_n\) being the space of polynomials of degree no higher than \(n\geq 0\). Namely for the additive \(\varepsilon\)-sampling an order estimation is \(\min \{ {\delta\over \varepsilon} \omega (P, \varepsilon), \omega (P, \delta)\}\) and for the multiplicative \(\varepsilon\)-sampling the estimation of \(\min\{ {{\delta (1+ \varepsilon)} \over \varepsilon}, \omega (P, \delta) \}\), where \[ \delta= \begin{cases} |x_1- x_2|, &r\geq 1 \text{ or } r=0, \varepsilon>1\\ h(x_1, x_2), &r=0,\;\varepsilon\leq 1 \end{cases} \] with \(h(x_1, x_2)\) denoting Hausdorff's distance between the graphs of the functions \(x_1\) and \(x_2\) on the plane \(\mathbb{R}^2\). The author proves also that the established estimates for the classes \(W^2\) in \(\text{Lip}_\alpha\) are unimprovable.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references