EXACT ORDERS IN SIMULTANEOUS APPROXIMATION BY COMPLEX BERNSTEIN-STANCU POLYNOMIALS
Abstract
In this paper the exact orders in approximation by the complex Bernstein-Stancu polynomials (depending on two parameters) and their derivatives on compact disks are obtained.
MSC 2000. Primary: 30E10; Secondary: 41A25, 41A28.
Keywords. Complex Bernstein-Stancu polynomials, exact orders in simultaneous approximation.
Keywords. Complex Bernstein-Stancu polynomials, exact orders in simultaneous approximation.
1. INTRODUCTION
In the recent paper [1] the following upper estimates and Voronovskaja's theorem in approximation by complex Bernstein-Stancu polynomials depending on two parameters were proved.
Theorem 1.1. Let be with and let us suppose that is analytic in , i.e. , for all . Also, for (independent of ) let us define the complex Bernstein-Stancu polynomials by
(i) For and , we have
(ii) If , then for all , we have
(iii) For all , we have
where and depends only on and .
Remark 1.2. Following exactly the lines in the proof of Theorem 1.1, (iii) in [1], it is immediate that in fact for any we have an upper estimate of the form
where the constant is independent of and depends on and . This estimate will be useful in Section 3.
(iii) For all
where
Remark 1.2. Following exactly the lines in the proof of Theorem 1.1, (iii) in [1], it is immediate that in fact for any
where the constant
The goal of this paper is to show that in Theorem 1.1, (i) and (ii), also lower estimates hold. Thus, in Section 2 we prove that if the analytic function is not a polynomial of degree and , then we have , that is in Theorem 1.1, (i), in fact the equivalence holds. In Section 3 we prove that for any and , if is not a polynomial of degree then we have , where the constants in the equivalence depend only on and .
Since the case (i.e. the case of classical Bernstein polynomials) was already considered in [2], in the rest of the paper we will exclude it.
2. EXACT ORDER OF APPROXIMATION FOR COMPLEX BERNSTEIN-STANCU POLYNOMIALS
The main result of this section is the following.
Theorem 2.1. Let with and let us suppose that is analytic in , that is we can write , for all . If is not a polynomial of degree 0 and , then we have
Theorem 2.1. Let
where the constant depends only on and .
Proof. For all and we have
Proof. For all
Note that in the case in [2], necessarily was supposed to be not a polynomial of degree .
In what follows we will apply to the above identity the following obvious property:
It follows
Since by Remark 1.2 we have
and denoting , if we prove that , then it is clear that there exists an index depending only on and , such that
For we have with , which finally implies for all , with .
Therefore it remains to show that . Indeed, suppose that 0 . We have two possibilities: 1) or 2) .
Case 1). We obtain , for all and denoting , it follows that is an analytic function in , solution of the differential equation , which after simplification with becomes . Now, seeking in the form and replacing it in the differential equation, by the identification of the coefficients we easily obtain for all . Therefore for all , which by the identity theorem on analytic (holomorphic) functions implies for all and the contradiction that is a polynomial of degree .
Case 2). Denoting by hypothesis it follows that is an analytic function in solution of the differential equation .
Taking it follows , which means . Seeking in the form and replacing it in the differential equation, by the
identification of the coefficients we easily obtain for all , which finally leads to the contradiction that is a constant.
identification of the coefficients we easily obtain
Combining now Theorem 2.1 with Theorem 1.1, (i), we immediately get the following.
Corollary 2.2. Let with and let us suppose that is analytic in . If is not a polynomial of degree 0 and , then we have
where the constants in the equivalence depend on and .
3. EXACT ORDERS OF APPROXIMATION FOR DERIVATIVES OF COMPLEX BERNSTEIN-STANCU POLYNOMIALS
The main result of this section is the following.
Theorem 3.1. Let be with with and let us suppose that is analytic in , i.e. , for all . Also, let and be fixed. If is not a polynomial of degree , then we have
Theorem 3.1. Let
where the constants in the equivalence depend on and .
Proof. Taking into account Theorem 1.1, (ii), it remains only to prove the lower estimate for .
Proof. Taking into account Theorem 1.1, (ii), it remains only to prove the lower estimate for
Denoting by the circle of radius (with ) and center 0 , by the Cauchy's formulas it follows that for all and we have
where we have the inequality valid for all and .
As in the proof of Theorem 2.1 (keeping the notation for ), for all and we have
As in the proof of Theorem 2.1 (keeping the notation for
which replaced in the above Cauchy's formula implies
Passing now to absolute value, for all and it follows
where by using the Remark 1.2, for all and we get
Denoting now , we prove that . Indeed, if we suppose that then it follows that satisfies the differential equation
where is a polynomial of degree . Simplifying with , making the substitution , searching in the form and then replacing in the differential equation, by simple calculations we easily obtain that for all , that is is a polynomial of degree . This implies the contradiction that is a polynomial of degree .
Continuing exactly as in the proof of Theorem 2.1 (with replaced by ), finally there exists an index depending on and , such that for all we have
Also, the cases when are similar with those in the proof of Theorem 2.1.
REFERENCES
[1] Gal, S.G., Approximation by complex Bernstein-Stancu polynomials in compact disks, Results in Mathematics, 2008, accepted for publication.
[2] Gal, S.G., Exact orders in simultaneous approximation by complex Bernstein polynomials, J. Concr. Applic. Math., 2009, accepted for publication.
[2] Gal, S.G., Exact orders in simultaneous approximation by complex Bernstein polynomials, J. Concr. Applic. Math., 2009, accepted for publication.
Received by the editors: March 2, 2008.
This work has been supported by the Romanian Ministry of Education and Research, under CEEX grant: 2-CEx 06-11-96.
*Department of Mathematics and Computer Science, University of Oradea, Universităţii str., no. 1, 410087 Oradea, Romania, e-mail: galso@uoradea.ro.
Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

This work is licensed under a Creative Commons Attribution 4.0 International License.







