Next Article in Journal
Uniform Persistence and Global Attractivity in a Delayed Virus Dynamic Model with Apoptosis and Both Virus-to-Cell and Cell-to-Cell Infections
Next Article in Special Issue
Algebraic Systems with Positive Coefficients and Positive Solutions
Previous Article in Journal
Tuning of PID Control for the Double Integrator Plus Dead Time Model by Modified Real Dominant Pole and Performance Portrait Methods
Previous Article in Special Issue
A Note on New Construction of Meyer-König and Zeller Operators and Its Approximation Properties
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a New Generalization of Bernstein-Type Rational Functions and Its Approximation

by
Esma Yıldız Özkan
1,* and
Gözde Aksoy
2
1
Department of Mathematics, Faculty of Science, Gazi University, Ankara 06500, Turkey
2
Department of Mathematics, Graduate School of Natural and Applied Sciences, Gazi University, Ankara 06500, Turkey
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 973; https://doi.org/10.3390/math10060973
Submission received: 23 February 2022 / Revised: 13 March 2022 / Accepted: 16 March 2022 / Published: 18 March 2022
(This article belongs to the Special Issue Mathematical Inequalities, Models and Applications)

Abstract

:
In this study, we introduce a new generalization of a Bernstein-type rational function possessing better estimates than the classical Bernstein-type rational function. We investigate its error of approximation globally and locally in terms of the first and second modulus of continuity and a class of Lipschitz-type functions. We present graphical comparisons of its approximation with illustrative examples.

1. Introduction

Bernstein polynomials [1] are defined to prove the well-known convergence theorem of Weierstreiss for each real-valued function f defined on 0 , 1 by
B n f ; x = k = 0 n f k / n n k x k 1 x n k , n = 1 , 2 , . . . .
In 1975, Balázs [2] defined an operator for each real-valued function f defined on 0 , and appropriately chosen real sequences a n and b n such that a n = b n n by
R n f ; x = 1 1 + a n x n k = 0 n f k b n n k a n x k , n = 1 , 2 , . . . .
When b n = n , this operator possesses the following relation with a Bernstein polynomial:
R n f ; x = B n f ; a n x 1 + a n x ,
which is known as a Bernstein-type rational function. Balàzs estimated its rate of convergence for each continuous function f defined on 0 , and proved an asymptotic approximation theorem under the condition that f x = O e τ x , x for some real number τ . In [3], Balàzs and Szabados improved the estimates given in [2] under more restrictive conditions by choosing a n = n ζ 1 and b n = n ζ for 0 < ζ 2 3 , n = 1 , 2 , . . . by assumming that f is uniformly continuous on 0 , . Additionally, in [4], Balázs presented approximation results for Balázs–Szabados operators on all real axes. Totik investigated in [5] saturation properties of Balázs–Szabados operators, and Abel and Veccia [6] obtained Voronovskaja type asiymtotic results for Balázs–Szabados operators. In [7], Holhoş have presented new approximation results for Balázs–Szabados operators by means of super-exponential functions.
In [8], İspir and Atakut gave a generalization of Bernstein-type rational functions as follows:
G n f ; x = 1 ϕ a n x k = 0 ϕ k 0 k ! a n x k f k b n ,
where a n and b n are suitably chosen positive numbers, and ϕ n is a sequence of functions satisfying certain conditions. Recently, Agratini [9] has studied a class of Bernstein-type rational functions by choosing a strictly decreasing positive real sequence λ n such that lim n λ n = 0 as follows:
L n f ; x = 1 1 + λ n x n k = 0 n f k n λ n n k λ n x k , n = 1 , 2 , . . . ,
where f is continuous on 0 , satisfying a certain growing condition. Agratini has investigated both a local and global estimation of rate of convergence and has presented a weighted approximation result by using weighted modulus of continuity. Researchers can also find approximation results of some other Bernstein-type rational functions in those references [10,11,12,13,14,15,16,17,18,19,20].
Denoted by C B 0 , is the Banach space of all real-valued continuous and bounded functions on 0 , endowed with the sup-norm f = sup x 0 , f x .
For a compact subinterval a , b 0 , , the same norm is valid and reduced to f a , b = sup x a , b f x .
In this paper, we construct a new generalization of Bernstein-type rational function, which is reducible to (2) and (3), and it is a rational function associated with the Bernstein polynomial given in (1). In an effort to define a well-defined Bernstein-type rational function, we choose non-negative real sequences α n , β n and γ n such that γ n = n α n satisfying the property
lim n α n = 0 , lim n β n = 1 and lim n γ n = .
We consider a newly defined Bernstein-type rational function as follows:
R n G f ; x = k = 0 n f k γ n n k α n x k ( β n ) n k β n + α n x n , x 0 , n N ,
where f is a real-valued continuous function on 0 , , α n , β n and γ n are real sequences such that γ n = n α n satisfies the property (4). It is clear that R n G is a well-defined, linear and positive operator. When β n = 1 , α n = a n and γ n = b n , under the condition that f x = O e τ x , x for some real number τ , it is reduced to the Bernstein-type rational functions given by (2). When α n : = λ n is a strictly decreasing positive real sequence, and f is continuous on 0 , satisfying a certain growing condition, it is induced to Agratini’s modification given by (3). Additionally, since it has the following connection with the Bernstein polynomial given by (1):
R n G f ; x = B n f ; α n x β n + α n x ,
when γ n = n for β n = 1 , it can be called a generalized Bernstein-type rational function.

2. Approximation Results

Firstly, we present the following auxiliary result, which will be used throughout the paper:
Lemma 1.
We have the following values of the generalized Bernstein-type rational function at monomials:
R n G ( e 0 ; x ) = 1 ,
R n G ( e 1 ; x ) = x β n + α n x ,
R n G ( e 2 ; x ) = 1 1 n x 2 β n + α n x 2 + x γ n β n + α n x ,
where e i ( t ) = t i for i = 0 , 1 , 2 , ( α n ) , ( β n ) and ( γ n ) are real sequences such that γ n = n α n .
Proof. 
By considering
β n + α n x n = k = 0 n n k ( α n x ) k ( β n ) n k ,
We calculate that
R n G ( e 0 ; x ) = R n G ( 1 ; x ) = k = 0 n n k ( α n x ) k ( β n ) n k β n + α n x n = 1 , R n G ( e 1 ; x ) = R n G ( t ; x ) = k = 0 n k γ n n k ( α n x ) k ( β n ) n k β n + α n x n = n α n x γ n β n + α n x k = 0 n 1 n 1 k α n x β n + α n x k β n β n + α n x n 1 k = n α n x γ n β n + α n x . 1 = x β n + α n x , R n G ( e 2 ; x ) = R n G ( t 2 ; x ) = k = 0 n k 2 γ n 2 n k ( α n x ) k ( β n ) n k β n + α n x n = n ( n 1 ) α n 2 x 2 γ n 2 β n + α n x 2 k = 0 n 2 n 2 k ( α n x ) k ( β n ) n 2 k β n + α n x n 2 + n α n x γ n 2 β n + α n x k = 0 n 1 n 1 k ( α n x ) k ( β n ) n 1 k β n + α n x n 1 = n ( n 1 ) α n 2 x 2 γ n 2 β n + α n x 2 + n α n x γ n 2 β n + α n x = 1 1 n x 2 β n + α n x 2 + x γ n β n + α n x .
Remark 1.
We have the following first- and second-order central moments by considering Lemma 1:
R n G ( e 1 x ; x ) = 1 β n x β n + α n x α n x 2 β n + α n x ,
R n G ( e 1 x 2 ; x ) = β n x γ n β n + α n x 2 + α n + β n 1 2 1 n x 2 β n + α n x 2 + 2 α n β n 1 x 3 β n + α n x 2 + α n 2 x 4 β n + α n x 2 .
Theorem 1.
Let R n G , n N , be the generalized Bernstein-type rational function defined by (5). If ( α n ) , ( β n ) and ( γ n ) are non-negative real sequences satisfying (4) for each n N , then R n G ( f ; x ) converges to f ( x ) uniformly with respect to x on 0 , r 0 , ,   r > 0 , for each f C 0 , r .
Proof. 
The proof can be fulfilled easily from the well-known Bohman–Korovkin theorem [21]. From (6) of Lemma 1, it is clear that
lim n R n G e 0 ; . e 0 ( . ) 0 , r = 0 .
Since 1 β n + α n x 1 β n for each x 0 , r , by Remark 1, we can write
R n G e 1 ; x e 1 x = R n G e 1 x ; x = 1 β n x β n + α n x α n x 2 β n + α n x 1 β n r β n + α n r 2 β n : = μ n 1 .
By considering relation (4), in (13), since lim n μ n 1 = 0 , we obtain
lim n R n G e 1 ; . e 1 . 0 , r = 0 .
By considering () of Lemma 1, we can calculate that
R n G e 2 ; x e 2 x = x γ n β n + α n x + 1 1 n x 2 β n + α n x 2 x 2 x γ n β n + α n x + 1 1 n β n 2 x 2 β n + α n x 2 + 2 β n α n x 3 β n + α n x 2 + α n 2 x 4 β n + α n x 2 r γ n β n + 1 1 n β n 2 r 2 β n 2 + 2 α n r 3 β n + α n 2 r 4 β n 2 : = μ n 2 .
Under conditions of relation (4), from (15), since lim n μ n 2 = 0 , we get
lim n R n G e 2 ; . e 2 . 0 , r = 0 .
From relations (12), (14) and (16), the criterion of the Bohman–Korovkin theorem is satisfied. Therefore, the proof of the theorem is completed. □

3. Local and Global Approximation

In this part, we present local and global results of approximation with the help of the first and second modulus of continuity and a Lipschitz class of functions.
For any μ > 0 , modulus of continuity of f C B 0 , is defined as
ω f ; μ = sup 0 < h < μ sup x 0 , f x + h f x ,
which possesses the following property:
ω f ; κ μ κ + 1 ω f ; μ ,
for κ , μ > 0 , and lim μ 0 + ω f ; μ = 0 , when f is uniformly continuous [22].
Theorem 2.
Let α n , β n and γ n be real sequences such that γ n = n α n , satisfying the property (4). For any f C B 0 , , we have
R n G f ; x f x 2 ω f ; μ n x ,
where
μ n x : = β n x γ n β n + α n x 2 + α n + β n 1 2 1 n x 2 β n + α n x 2 + 2 α n β n 1 x 3 β n + α n x 2 + α n 2 x 4 β n + α n x 2 .
Proof. 
Let f C B 0 , .By (18), we have
f t f x 1 + t x μ ω f ; μ .
By applying the operator R n G to (20), by taking linearity and positivity of the operator R n G into account and by applying Cauchy–Schwarz inequality, we obtain
R n G f ; x f x R n G f t f x ; x ω f ; μ 1 + 1 μ R n G e 1 x ; x ω f ; μ 1 + 1 μ R n G e 1 x 2 ; x .
From (11) of Remark 1, by choosing
μ n x : = R n G e 1 x 2 ; x = β n x γ n β n + α n x 2 + α n + β n 1 2 1 x 2 β n + α n x 2 + 2 α n β n 1 x 3 β n + α n x 2 + α n 2 x 4 β n + α n x 2 ,
and by replacing μ : = μ n x , we complete the proof of the theorem. □
Remark 2.
In Theorem 2, μ n x is dependent on x and choosing of α n , β n and γ n . α n , β n and γ n must be non-negative real sequences satisfying μ n x 0 . Otherwise, Theorem 2 becomes invalid. For example, if β n 1 and α n + β n 1 2 1 n then μ n x 0 . This is not the only possible condition as μ n x 0 .
Moreover, for f C 0 , r , Theorem 2 is reduced to the following inequality:
R n G f ; . f 0 , r 2 ω f ; μ n ,
where
μ n : = r γ n β n + α n + β n 1 2 1 n r 2 β n 2 + 2 α n β n 1 r 3 β n 2 + α n 2 r 4 β n 2 .
For f C B 0 , , Petree’s K-functional is defined by
K 2 f ; μ = inf g C B ( 2 ) 0 , f g + μ g ,
where
C B ( 2 ) 0 , : = g C B 0 , : g , g C B 0 , .
We have the following connection (see p. 192 in [23]) between Petree’s K-functional and the second modulus of continuity ω 2 f ; .
K 2 f ; μ C ω 2 f ; μ ,
where
ω 2 f ; μ = sup 0 < h < μ sup x 0 , f x + 2 h 2 f x + h + f x .
Theorem 3.
Let α n , β n and γ n be real sequences such that γ n = n α n satisfying property (4). For each f C B 0 , , then there exists a C > 0 such that
R n G f ; x f x C ω 2 f ; μ n x + μ n x , x 0 ,
where μ n x is given as in (19).
Proof. 
We initially define an auxilary operator by
E n G f ; x : = R n G f ; x + f x f η n x ,
where
η n x : = R n G e 1 x ; x = 1 β n x α n x 2 β n + α n x .
By (26), we obtain
E n G e 1 x ; x = R n G e 1 x ; x x η n x = 0 .
For any g C B ( 2 ) 0 , , from Taylor’s formula, we can write
g t g x = g x t x + x t t u g u d u .
By applying the operator R n G to (29), by (28), we obtain
R n G g ; x g x g x R n G t x ; x + R n G x t t u g u d u ; x g R n G t x ; x + g R n G t x 2 ; x .
Since g C B 0 , , there exists a k 0 > 0 such that g = k 0 . Therefore, by applying Cauchy–Schwarz inequality, we obtain
R n G g ; x g x k 0 R n G t x 2 ; x + g R n G t x 2 ; x .
Additionally, for f C B 0 , , we have
R n G f ; x k = 0 n f k γ n n k α n x k β n n k β n + α n x n f R n G e 0 ; x = f .
By considering (30) and (32), we can write
R n G f ; x f x R n G f g ; x f g x + R n G g ; x g x R n G f g ; x + f g x + R n G g ; x g x 2 f g + g R n G e 1 x 2 ; x + k 0 R n G e 1 x 2 ; x .
In (33), considering Remark 1 and choosing μ n x as in (19), by taking the infimum right-hand side of the last inequality, for g C B ( 2 ) 0 , , we obtain
R n G f ; x f x 2 K f ; μ n x + k 0 μ n x .
Lastly, by applying (24) to (34), we acquire
R n G f ; x f x c 0 ω 2 f ; μ n x + k 0 μ n x ,
where c 0 > 0 . By choosing C = max k 0 , c 0 , we obtain the desired result. □
Remark 3.
For f C 0 , r , Theorem 3 is induced to the following result:
R n G f ; . f 0 , r C ω 2 f ; μ n + μ n , C > 0 ,
where μ n is as in (22).
Let E be any subset of R and θ 0 , 1 . Let L i p M f E , θ denote a class of Lipschitz functions in C B 0 , satisfying
f t f x M f t x θ , t E ¯ , x 0 ,
where M f is a constant, and E ¯ is the closure of E in 0 , .
Theorem 4.
Let α n , β n and γ n be real sequences such that γ n = n α n , satisfying the property (4). For any f L i p M f E , θ , we have
R n G f ; x f x M f μ n x θ + 2 d x , E θ ,
where μ n x is given as in (19), M f is a constant depending on f, and E is any subset of 0 , , x 0 , and θ 0 , 1 .
Proof. 
Let x 0 , and x E ¯ such that d x , x 0 = x x 0 . We can write
f f x f f x 0 + f x 0 f x .
By applying R n G to (36), and by considering the linearity and positivity of R n G and (35), we obtain
R n G f ; x f x R n G f f x 0 ; x + R n G f x f x 0 ; x M f R n G e 1 x 0 θ e 0 ; x + R n G x x 0 θ e 0 ; x = M f R n G e 1 x 0 θ e 0 ; x + x x 0 θ R n G e 0 ; x .
In (37), by using Hölder’s inequality for p = 2 θ and q = 2 2 θ such that 1 p + 1 q = 1 , by considering Lemma 1 and (11) of Remark 1, we obtain
R n G f ; x f x M f R n G e 1 x θ p ; x 1 / p R n G e 0 q ; x 1 / q + 2 d x , E θ = M f R n G e 1 x 2 ; x θ / 2 1 1 / q + 2 d x , E θ = M f μ n x θ + 2 d x , E θ ,
which completes the proof of theorem. □
Remark 4.
When x 0 , r : = E 0 , , it is clear that d x , E = 0 . From Theorem 4, we have the following inequality:
R n G f ; . f 0 , r M f μ n θ ,
where μ n is as in (22).

4. Graphical Comparison

In this part, we present some graphical results produced in Maple software.
Example 1.
Let us choose f x = x x + 1 2 x + 1 3 , α n = 1 n , γ n = n for x 0 and n N .
In Figure 1 and Figure 2, by choosing β n = 1 1 n , graphical comparison of approximation of R n G f ; x to f for n = 50 , 75 and 100 is presented on 0 , and 0 , 3 . It is clear that approximation of R n G f ; x to f is better for increasing the value of n.
In Figure 3 and Figure 4, by choosing β n = 1 1 n , R n G f ; x is compared graphically with the classical Bernstein-type rational function R n f ; x given by (2) to f for n = 25 on 0 , and 0 , 3 . It is obvious that approximation of R n G f ; x to f is better than approximation by R n f ; x to f on 0 , and 0 , 3 .
In Figure 5 and Figure 6, by denoting R n G f ; x : = R n G f ; x , β n and choosing β n = 1 2 n , 1 and 1 + 2 n , R n G f ; x , 1 2 n , R n G f ; x , 1 and R n G f ; x , 1 + 2 n are graphically compared. Here, it is clear that R n G f ; x , 1 is reduced to R n f ; x for β n = 1 . If we choose β n as a real sequence such that lim n β n = 1 , and β n is not constant, then we see that approximation by R n G f ; x , 1 2 n is better than R n G f ; x , 1 = R n f ; x and R n G f ; x , 1 + 2 n on 0 , and 0 , 3 .

5. Conclusions

In this study, we have introduced a newly defined Bernstein-type rational function R n G , which is a generalized Bernstein-type rational function in terms of including the classical Bernstein-type rational function defined by (2) and Agratini’s modification, defined by (3). We have estimated the error of its approximation for conveniently chosen non-negative real sequences α n and β n . Consequently, the newly defined generalized Bernstein-type rational function possesses better results than the classical Bernstein-type rational function defined by (2) for certain functions.

Author Contributions

Conceptualization, E.Y.Ö.; methodology, E.Y.Ö. and G.A.; software, E.Y.Ö.; validation, E.Y.Ö. and G.A.; investigation, E.Y.Ö. and G.A.; resources, E.Y.Ö. and G.A.; data curation, E.Y.Ö.; writing—original draft preparation, E.Y.Ö. and G.A.; writing—review and editing, E.Y.Ö.; visualization, E.Y.Ö.; supervision, E.Y.Ö. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All the data for this article are included in the text.

Acknowledgments

The authors are grateful to all the referees who contributed to the best presentation of the paper with their valuable comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bernstein, S.N. Démonstration du théorème de Weierstrass fondée sur le calcul de probabilités. Commun. Soc. Math. Kharkow 2013, 13, 1–2. [Google Scholar]
  2. Balázs, K. Approximation by Bernstein type rational funstions. Acta Math. Acad. Sci. Hungar. 1975, 26, 123–134. [Google Scholar] [CrossRef]
  3. Balázs, K.; Szabados, J. Approximation by Bernstein type rational functions II. Acta Math. Acad. Sci. Hungar. 1982, 40, 331–337. [Google Scholar] [CrossRef]
  4. Balázs, K. Approximation by Bernstein type rational functions on the real axis. Acta Math. Hung. 1985, 46, 195–204. [Google Scholar] [CrossRef]
  5. Totik, V. Saturation for Bernstein type rational functions. Acta Math. Hung. 1984, 43, 219–250. [Google Scholar] [CrossRef]
  6. Abel, U.; Vecchia, B.D. Asymptotic approximation by the operators of K. Balázs and Szabados. Acta Sci. Math. 2000, 66, 137–145. [Google Scholar]
  7. Holhos, A. On the approximation by Balázs-Szabados operators. Mathematics 2021, 9, 1588. [Google Scholar] [CrossRef]
  8. İspir, N.; Atakut, Ç. Approximation by generalized Balázs type rational functions. Int. J. Comput. Numer. Anal. 2003, 4, 297–316. [Google Scholar]
  9. Agratini, O. On a class of Bernstein-type rational functions. Numer. Funct. Anal. Optim. 2020, 41, 483–494. [Google Scholar] [CrossRef]
  10. Gupta, V.; İspir, N. On Bézier variant of generalized Kantorovich type Balázs operators. Appl. Math. Lett. 2005, 18, 1053–1061. [Google Scholar] [CrossRef] [Green Version]
  11. Gupta, V.; Lupaş, A. On the rate of approximation for the Bézier variant of Kantorovich-Balázs operators. Gen. Math. 2004, 1, 3–18. [Google Scholar] [CrossRef] [Green Version]
  12. Gupta, V.; Zeng, X.M. Rate of approximation fort he Bézier variant of Balázs Kantorovich operators. Math. Slovaca 2007, 57, 349–358. [Google Scholar] [CrossRef] [Green Version]
  13. Hamal, H.; Sabancıgil, P. Some approximation properties of new Kantorovich type q-analogue of Balázs-Szabados operators. J. Inequal. Appl. 2020, 2020, 159. [Google Scholar] [CrossRef]
  14. İspir, N.; Özkan, E.Y. Approximation properties of complex q-Balázs-Szabados operators in compact disks. J. Inequal. Appl. 2013, 2013, 361. [Google Scholar] [CrossRef] [Green Version]
  15. Özkan, E.Y.; İspir, N. Approximation by (p,q)-analogue of Balázs-Szabados operators. Filomat 2018, 32, 2257–2271. [Google Scholar] [CrossRef] [Green Version]
  16. Özkan, E.Y. Approximation properties of bivariate complex q-Balázs-Szabados operators of tensor product kind. J. Inequal. Appl. 2014, 2014, 20. [Google Scholar] [CrossRef] [Green Version]
  17. Özkan, E.Y. Statistical approximation properties of q-Balázs-Szabados-Stancu operators. Filomat 2014, 28, 1943–1952. [Google Scholar] [CrossRef] [Green Version]
  18. Özkan, E.Y. Approximation by complex bivariate Balázs-Szabados operators. Bull. Malays. Math. Sci. Soc. 2016, 39, 1–16. [Google Scholar] [CrossRef]
  19. Özkan, E.Y. Approximation properties of Kantorovich type q-Balázs-Szabados operators. Demonstr. Math. 2019, 52, 10–19. [Google Scholar] [CrossRef]
  20. Özkan, E.Y. Quantitative estimates for the tensor product (p,q)-Balázs-Szabados operators and associated Boolean sum operators. Filomat 2020, 34, 779–793. [Google Scholar] [CrossRef]
  21. Korovkin, P.P. On convergence of linear positive operators in the space of continuous functions. Dokl. Akad. Nauk. SSSR 1953, 90, 961–964. [Google Scholar]
  22. Devore, R.A.; Lorentz, G.G. Constructive Approximation: Polynomials and Splines Approximation; Springer: Berlin/Heidelberg, Germany, 1993. [Google Scholar]
  23. Butzer, P.L.; Berens, H. Semi-Groups of Operators and Approximation; Springer: New York, NY, USA, 1967. [Google Scholar]
Figure 1. Approximation by R n G on 0 , , for β n = 1 1 n , n = 50 , 75 and 100.
Figure 1. Approximation by R n G on 0 , , for β n = 1 1 n , n = 50 , 75 and 100.
Mathematics 10 00973 g001
Figure 2. Approximation by R n G on 0 , 3 , for β n = 1 1 n , n = 50 , 75 and 100.
Figure 2. Approximation by R n G on 0 , 3 , for β n = 1 1 n , n = 50 , 75 and 100.
Mathematics 10 00973 g002
Figure 3. Comparison by R n G and R n on 0 , , for β n = 1 1 n , n = 25 .
Figure 3. Comparison by R n G and R n on 0 , , for β n = 1 1 n , n = 25 .
Mathematics 10 00973 g003
Figure 4. Comparison of R n G and R n on 0 , 3 , for β n = 1 1 n , n = 25 .
Figure 4. Comparison of R n G and R n on 0 , 3 , for β n = 1 1 n , n = 25 .
Mathematics 10 00973 g004
Figure 5. Approximation by R n G on 0 , , for β n = 1 2 n , 1 and 1 + 2 n , n = 25 .
Figure 5. Approximation by R n G on 0 , , for β n = 1 2 n , 1 and 1 + 2 n , n = 25 .
Mathematics 10 00973 g005
Figure 6. Approximation by R n G on 0 , 3 , for β n = 1 2 n , 1 and 1 + 2 n , n = 25 .
Figure 6. Approximation by R n G on 0 , 3 , for β n = 1 2 n , 1 and 1 + 2 n , n = 25 .
Mathematics 10 00973 g006
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Özkan, E.Y.; Aksoy, G. On a New Generalization of Bernstein-Type Rational Functions and Its Approximation. Mathematics 2022, 10, 973. https://doi.org/10.3390/math10060973

AMA Style

Özkan EY, Aksoy G. On a New Generalization of Bernstein-Type Rational Functions and Its Approximation. Mathematics. 2022; 10(6):973. https://doi.org/10.3390/math10060973

Chicago/Turabian Style

Özkan, Esma Yıldız, and Gözde Aksoy. 2022. "On a New Generalization of Bernstein-Type Rational Functions and Its Approximation" Mathematics 10, no. 6: 973. https://doi.org/10.3390/math10060973

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop