Abstract
Jackson type theorems are established for the approximation of a function f f that changes sign finitely many times in [ − 1 , 1 ] [ - 1,1] by polynomials p n {p_n} which are copositive with it f p n ⩾ 0 on [ − 1 , 1 ] f{p_n} \geqslant 0{\text { on }}[ - 1,1] . The results yield the rate of nonconstrained approximation and are thus best possible in the same sense as in the nonconstrained case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
