We give a short and elementary proof of an inverse Bernsteintype inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle . The inequality is used to show that equally-spaced points solve a min-max-min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we s...

We overview numerous algorithms in computational D-module theory together with the theoretical background as well as the implementation in the computer algebra system Singular. We discuss new approaches to the computation of Bernstein operators, of logarithmic annihilator of a polynomial, of annihilators of rational functions as well as complex powers of polynomials. We analyze algorithms for l...

A symmetric basis of trigonometric polynomial space is presented. Based on the basis, symmetric trigonometric polynomial approximants like Bernstein polynomials are constructed. Two kinds of nodes are given to show that the trigonometric polynomial sequence is uniformly convergent. The convergence of the derivative of the trigonometric polynomials is shown. Trigonometric quasi-interpolants of r...

Recently, Ryoo introduced the weighted q-Euler numbers and polynomials which are a slightly different Kim’s weighted q-Euler numbers and polynomials(see C. S. Ryoo, A note on the weighted q-Euler numbers and polynomials, 2011]). In this paper, we give some interesting new identities on the weighted q-Euler numbers related to the q-Bernstein polynomials 2000 Mathematics Subject Classification 11...