Showing posts with label rate of convergence. Show all posts
Showing posts with label rate of convergence. Show all posts

Monday, 15 September 2025

Note on Bernstein Inequalities Concerning Complex Polynomials | Chapter 1 | Research Updates in Mathematics and Computer Science Vol. 7

 

 

Let \(p(z)\) be a polynomial of degree \(n\) having no zero in \(|z|<1\), then Erdös conjectured and later Lax [Bull. Amer. Math. Soc., \(50(1944), 509-513\) ] prove that

\[\max _{|z|=1}\left|p^{\prime}(z)\right| \leq \frac{n}{2} \max _{|z|=1}|p(z)|\]

 

This Erdös-Lax's inequality was generalized for the first time by Malik [J. London Math. Soc., 1(1969), 57-60] that if \(p(z)\) is a polynomial of degree \(n\) having no zero in \(|z|<k, k \geq 1\), then

\[\max _{|z|=1}\left|p^{\prime}(z)\right| \leq \frac{n}{1+k} \max _{|z|=1}|p(z)|\]

 

For the class of polynomials not vanishing in \(|z|<k, k \leq 1\), the precise estimate for maximum of \(\left|p^{\prime}(z)\right|\) on \(|z|=1\), in general, does not seem to be easily obtainable. But for the particular class of polynomials having all its zeros on \(|z|=k, k \leq 1\), Govil [J. Math. and Phy. Sci., 14(1980), 183-187] was able to prove that

\[\max _{|z|=1}\left|p^{\prime}(z)\right| \leq \frac{n}{k^{n-1}+k^n} \max _{|z|=1}|p(z)| .\]

 

In this article, we compare some inequalities of later type concerning the ordinary and polar derivatives of the polynomial.

 

Author(s) Details

Sangeeta Garg

Department of Computer Science, Faculty of Mathematics, Mewar Institute of Management, Vasundhara-4C, Ghaziabad, CCS University, Meerut, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/rumcs/v7/342

Thursday, 6 February 2025

Comprehensive Review of λ−Bernstein Operators | Chapter 11 | Exploration of Knowledge and Information in Sciences, Edition 1

In this chapter, we explore the historical development of the significant results surrounding λ -Bernstein operators within the field of approximation theory. The primary objective of this study is to review the progress in this area and evaluate both the rapidity of convergence, using the modulus of continuity, and the rate of convergence, utilizing Lipschitz functions and Peetre’s K-functional. Operator theory has garnered considerable interest over the past two decades, largely due to the widespread applicability of Bernstein polynomials in approximation theory. These polynomials are now integral to numerous fields, including fixed point theory, numerical analysis, image processing, neural networks, machine learning, and the solution of both ordinary and partial differential equations. This chapter also highlights a few significant outcomes and includes the authors’ pertinent opinions, tracing the development of these operators from their inception to the present day.

 

Author (s) Details

 

Mohd Raiz
Department of Applied Sciences, Global Institute of Technology and Management, 5KM Milestone, Kheda Khurampur, Farrukhnagar, Haily Mandi Road, Gurugramn, Haryana-122506, India.

 

Nadeem Rao
Department of Mathematics, University Center for Research and Development, Chandigarh University, Mohali, Punjab-140413, India.

 

Vishnu Narayan Mishra
Department of Mathematics, Indira Gandhi National Tribal University, Lalpur, Amarkantak, Madhya Pradesh 484 887, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mono/978-93-48859-02-0/CH11

Wednesday, 15 January 2025

The Calculus of Reverse Order of q-Analogue | Chapter 2 | Research Updates in Mathematics and Computer Science Vol. 7

 

This chapter is an introduction to a new type of analogue named Q -analogue for some operators. Here we have considered well-known operators named Baskakov Durrmeyer operators. This new type of analogue is considered as reverse order of q-analogue. In this chapter, we establish a direct approximation theorem, a weighted approximation theorem followed by the estimations of the rate of convergence of these new types of operators for functions of polynomial growth on the interval [0,∞).

 

Author(s)details:-

 

Sangeeta Garg
Department of Computer Science, Faculty of Mathematics, Mewar Institute of Management, Vasundhara-4C, Ghaziabad, CCS University, Meerut, India.

 

Please See the book here :- https://doi.org/10.9734/bpi/rumcs/v7/342