• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.305-313
• /
• 2022

In this paper we consider a modified version of Smirnov operator and obtain some Bernstein-type inequalities preserved by this operator. In particular, we prove some results which in turn provide the compact generalizations of some well-known inequalities for polynomials.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.287-294
• /
• 2023

The goal of this paper is to extend some inequalities of Bernstein as well as Turán type to polar derivative of a polynomial.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.45-72
• /
• 2022

In this work, we study Bernstein-Walsh-type estimations for the derivative of an arbitrary algebraic polynomial in regions with piecewise smooth boundary without cusps of the complex plane. Also, estimates are given on the whole complex plane.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.343-355
• /
• 2007

Using the modulus of smoothness ${\omega}^2_{{\varphi}^{\lambda}(f,t)_{\omega}$ Stechkin-Marchaud-Type inequalities with Jacobi weights of Bernstein Operators is established.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.275-293
• /
• 2024

In this paper, we obtain integral analogues of inequalities concerning polynomials proved by Soraisam et al. [33]. The results improve other known inequalities as well.

• Korean Journal of Mathematics
• /
• v.29 no.2
• /
• pp.435-443
• /
• 2021

In this paper, we consider an operator N : 𝓟_n → 𝓟_n on the space of polynomials 𝓟_n of degree at most n and establish some compact generalizations of Bernstein-type polynomial inequalities, which include several well known polynomial inequalities as special cases.

• Communications for Statistical Applications and Methods
• /
• v.21 no.3
• /
• pp.245-251
• /
• 2014

Two exponential inequalities are established for a wide class of general weakly dependent sequences of random variables, called ${\psi}$-weakly dependent process which unify weak dependence conditions such as mixing, association, Gaussian sequences and Bernoulli shifts. The ${\psi}$-weakly dependent process includes, for examples, stationary ARMA processes, bilinear processes, and threshold autoregressive processes, and includes essentially all classes of weakly dependent stationary processes of interest in statistics under natural conditions on the process parameters. The two exponential inequalities are established on more general conditions than some existing ones, and are proven in simpler ways.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.