14 results
Search Results
Now showing 1 - 10 of 14
Article Citation - WoS: 9Citation - Scopus: 9The Approximation of Logarithmic Function by q-bernstein Polynomials in the Case q > 1(Springer, 2007) Ostrovska, SofiyaSince in the case q > 1, q-Bernstein polynomials are not positive linear operators on C[ 0, 1], the study of their approximation properties is essentially more difficult than that for 0 < q < 1. Despite the intensive research conducted in the area lately, the problem of describing the class of functions in C[ 0, 1] uniformly approximated by their q-Bernstein polynomials ( q > 1) remains open. It is known that the approximation occurs for functions admitting an analytic continuation into a disc {z : | z| < R}, R > 1. For functions without such an assumption, no general results on approximation are available. In this paper, it is shown that the function f ( x) = ln( x + a), a > 0, is uniformly approximated by its q-Bernstein polynomials ( q > 1) on the interval [ 0, 1] if and only if a >= 1.Article Citation - WoS: 2Citation - Scopus: 2On the q-bernstein Polynomials of the Logarithmic Function in the Case q > 1(Walter de Gruyter Gmbh, 2016) Ostrovska, SofiyaThe q-Bernstein basis used to construct the q-Bernstein polynomials is an extension of the Bernstein basis related to the q-binomial probability distribution. This distribution plays a profound role in the q-boson operator calculus. In the case q > 1, q-Bernstein basic polynomials on [0, 1] combine the fast increase in magnitude with sign oscillations. This seriously complicates the study of q-Bernstein polynomials in the case of q > 1. The aim of this paper is to present new results related to the q-Bernstein polynomials B-n,B- q of discontinuous functions in the case q > 1. The behavior of polynomials B-n,B- q(f; x) for functions f possessing a logarithmic singularity at 0 has been examined. (C) 2016 Mathematical Institute Slovak Academy of SciencesArticle Citation - WoS: 7On the Approximation of Analytic Functions by the q-bernstein Polynomials in the Case q > 1(Kent State University, 2010) Ostrovska, SofiyaSince for q > 1, the q-Bernstein polynomials B(n,q) are not positive linear operators on C[0, 1], the investigation of their convergence properties turns out to be much more difficult than that in the case 0 < q < 1. In this paper, new results on the approximation of continuous functions by the q-Bernstein polynomials in the case q > 1 are presented. It is shown that if f is an element of C[0, 1] and admits an analytic continuation f(z) into {z : |z| < a}, then B(n,q) (f; z) -> f (z) as n -> infinity, uniformly on any compact set in {z : |z| < a}.Article Citation - WoS: 2Citation - Scopus: 1The Continuity in Q of the Lupaş Q-Analogues of the Bernstein Operators(Academic Press inc Elsevier Science, 2024) Yilmaz, Ovgue Gurel; Turan, Mehmet; Ostrovska, Sofiya; Turan, Mehmet; Ostrovska, Sofiya; Turan, Mehmet; Ostrovska, Sofiya; Mathematics; MathematicsThe Lupas q-analogue Rn,q of the Bernstein operator is the first known q-version of the Bernstein polynomials. It had been proposed by A. Lupas in 1987, but gained the popularity only 20 years later, when q-analogues of classical operators pertinent to the approximation theory became an area of intensive research. In this work, the continuity of operators Rn,q with respect to parameter q in the strong operator topology and in the uniform operator topology has been investigated. The cases when n is fixed and n -> infinity have been considered. (c) 2022 Elsevier Inc. All rights reserved.Article Qualitative results on the convergence of the q-Bernstein polynomials(North Univ Baia Mare, 2015) Ostrovska, Sofiya; Turan, MehmetDespite many common features, the convergence properties of the Bernstein and the q-Bernstein polynomials are not alike. What is more, the cases 0 < q < 1 and q > 1 are not similar to each other in terms of convergence. In this work, new results demonstrating the striking differences which may occur in those convergence properties are presented.Article Citation - WoS: 2The Approximation of Power Function by the q-bernstein Polynomials in the Case q > 1(Element, 2008) Ostrovska, SofiyaSince for q > 1. q-Bernstein polynomials are not positive linear operators on C[0, 1] the investigation of their convergence properties turns out to be much more difficult than that in the case 0 < q < 1. It is known that, in the case q > 1. the q-Bernstein polynomials approximate the entire functions and, in particular, polynomials uniformly on any compact set in C. In this paper. the possibility of the approximation for the function (z + a)(alpha), a >= 0. with a non-integer alpha > -1 is studied. It is proved that for a > 0, the function is uniformly approximated on any compact set in {z : vertical bar z vertical bar < a}, while on any Jordan arc in {z : vertical bar z vertical bar > a}. the uniform approximation is impossible, In the case a = 0(1) the results of the paper reveal the following interesting phenomenon: the power function z(alpha), alpha > 0: is approximated by its, q-Bernstein polynomials either on any (when alpha is an element of N) or no (when alpha is not an element of N) Jordan arc in C.Article Citation - WoS: 1Citation - Scopus: 1On the Rate of Convergence for the q-durrmeyer Polynomials in Complex Domains(Walter de Gruyter Gmbh, 2024) Gurel, Ovgu; Ostrovska, Sofiya; Turan, MehmetThe q-Durrmeyer polynomials are one of the popular q-versions of the classical operators of approximation theory. They have been studied from different points of view by a number of researchers. The aim of this work is to estimate the rate of convergence for the sequence of the q-Durrmeyer polynomials in the case 0 < q < 1. It is proved that for any compact set D subset of C, the rate of convergence is O(q(n)) as n -> infinity. The sharpness of the obtained result is demonstrated.Article Citation - WoS: 15Citation - Scopus: 18The Sharpness of Convergence Results for q-bernstein Polynomials in The Case q > 1(Springer Heidelberg, 2008) Ostrovska, SofiyaDue to the fact that in the case q > 1 the q-Bernstein polynomials are no longer positive linear operators on C[0, 1], the study of their convergence properties turns out to be essentially more difficult than that for q 1. In this paper, new saturation theorems related to the convergence of q-Bernstein polynomials in the case q > 1 are proved.Article Citation - WoS: 3Citation - Scopus: 2The Approximation of All Continuous Functions on [0,1] by q-bernstein Polynomials in the Case q → 1+(Springer Basel Ag, 2008) Ostrovska, SofiyaSince for q > 1, the q-Bernstein polynomials B-n,B-q(f;.) are not positive linear operators on C[0, 1], their convergence properties are not similar to those in the case 0 < q = 1. It has been known that, in general, B-n,B-qn(f;.) does not approximate f is an element of C[0, 1] if q(n) -> 1(+), n ->infinity, unlike in the case q(n) -> 1(-). In this paper, it is shown that if 0 <= q(n) - 1 = o(n(-1)3(-n)), n -> infinity, then for any f is an element of C[0, 1], we have: B-n,B-qn(f; x) -> f(x) as n -> infinity, uniformly on [ 0,1].Article Citation - WoS: 170Citation - Scopus: 188q-bernstein Polynomials and Their Iterates(Academic Press inc Elsevier Science, 2003) Ostrovska, SLet B-n (f,q;x), n = 1,2,... be q-Bernstein polynomials of a function f: [0, 1] --> C. The polynomials B-n(f, 1; x) are classical Bernstein polynomials. For q not equal 1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: \z\ < q + ε} the rate of convergence of {B-n(f, q; x)} to f (x) in the norm of C[0, 1] has the order q(-n) (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B-n(jn) (f, q; x)}, where both n --> infinity and j(n) --> infinity, are studied. It is shown that for q is an element of (0, 1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j(n) --> infinity. (C) 2003 Elsevier Science (USA). All rights reserved.
