Approximation by Boolean sums of positive linear operators. II: Gopengauz-type estimates (Q808358): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q582509
Property / reviewed by
 
Property / reviewed by: Manfred W. Müller / rank
Normal rank
 

Revision as of 10:57, 16 February 2024

scientific article
Language Label Description Also known as
English
Approximation by Boolean sums of positive linear operators. II: Gopengauz-type estimates
scientific article

    Statements

    Approximation by Boolean sums of positive linear operators. II: Gopengauz-type estimates (English)
    0 references
    0 references
    0 references
    1989
    0 references
    A theorem of Gopengauz says that for every \(f\in C[-1,1]\) there exists an algebraic polynomial \(p_ n\) of degree n (depending on f) such that there holds \[ | f(x)-p_ n(x)| \leq c\omega_ 2(f,\sqrt{1-x^ 2}\cdot n^{-1}),\quad | x| \leq 1, \] where \(\omega_ 2\) denotes the classical second order modulus of continuity and c is an absolute constant independent of n, f and x. The main result of the present paper gives a construction for algebraic polynomials of degree sn-s, \(s\geq 3\), furnishing an estimate of the same type. This construction is based on the Boolean sum of positive linear and polynomial operators introduced by Pichugov and Lehnhoff respectively and certain interpolation operators. [For part I see Rend. Mat. Appl. VII., Ser. 6, No.4, 525-546 (1986; Zbl 0689.41019).]
    0 references
    Gopengauz estimates
    0 references
    algebraic polynomial
    0 references
    Boolean sum
    0 references

    Identifiers