Characterization of generalized Bessel polynomials in terms of polynomial inequalities

Generalized Bessel polynomials (GBPs) are characterized as the extremal polynomials in certain inequalities in L-2 norm of Markov type. (C) 1998 Academic Press.

Nonnegative trigonometric polynomials

An extremal problem for the coefficients of sine polynomials, which are nonnegative in [0,π] , posed and discussed by Rogosinski and Szego is under consideration. An analog of the Fejér-Riesz representation of nonnegative general trigonometric and cosine polynomials is proved for nonnegative sine polynomials. Various extremal sine polynomials for the problem of Rogosinski and Szego are obtained explicitly. Associated cosine polynomials k n (θ) are constructed in such a way that { k n (θ) } are summability kernels. Thus, the L p , pointwise and almost everywhere convergence of the corresponding convolutions, is established. © 2002 Springer-Verlag New York Inc.

Landau and Kolmogoroff type polynomial inequalities

Let 0polynomials of degree not exceeding n).For the particular case j=1 and m=2, we provide a complete characterisation of the positive constants A and B, for which the corresponding Landau type polynomial inequalities parallel to f'parallel to less than or equal toA parallel to f parallel to + B parallel to f parallel to/ A theta(k) + B mu(k)hold. In each case we determine the corresponding extremal polynomials for which equalities are attained.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

A class of hypergeometric polynomials with zeros on the unit circle: Extremal and orthogonal properties and quadrature formulas

The class of hypergeometric polynomials F12(-m,b;b+b̄;1-z) with respect to the parameter b=λ+iη, where λ>0, are known to have all their zeros simple and exactly on the unit circle |z|=1. In this note we look at some of the associated extremal and orthogonal properties on the unit circle and on the interval (-1,1). We also give the associated Gaussian type quadrature formulas. © 2012 IMACS.

Monotonicity of zeros of Jacobi polynomials

Denote by x(nk)(alpha, beta), k = 1...., n, the zeros of the Jacobi polynornial P-n((alpha,beta)) (x). It is well known that x(nk)(alpha, beta) are increasing functions of beta and decreasing functions of alpha. In this paper we investigate the question of how fast the functions 1 - x(nk)(alpha, beta) decrease as beta increases. We prove that the products t(nk)(alpha, beta) := f(n)(alpha, beta) (1 - x(nk)(alpha, beta), where f(n)(alpha, beta) = 2n(2) + 2n(alpha + beta + 1) + (alpha + 1)(beta + 1) are already increasing functions of beta and that, for any fixed alpha > - 1, f(n)(alpha, beta) is the asymptotically extremal, with respect to n, function of beta that forces the products t(nk)(alpha, beta) to increase. (c) 2007 Elsevier B.V. All rights reserved.

Almost strict total positivity and a class of Hurwitz polynomials

We establish sufficient conditions for a matrix to be almost totally positive, thus extending a result of Craven and Csordas who proved that the corresponding conditions guarantee that a matrix is strictly totally positive. Then we apply our main result in order to obtain a new criteria for a real algebraic polynomial to be a Hurwitz one. The properties of the corresponding extremal Hurwitz polynomials are discussed. (C) 2004 Elsevier B.V. All rights reserved.

Chebyshev-Laurent polynomials and weighted approximation

Let (a, b) subset of (0, infinity) and for any positive integer n, let S-n be the Chebyshev space in [a, b] defined by S-n:= span{x(-n/2+k),k= 0,...,n}. The unique (up to a constant factor) function tau(n) is an element of S-n, which satisfies the orthogonality relation S(a)(b)tau(n)(x)q(x) (x(b - x)(x - a))(-1/2) dx = 0 for any q is an element of Sn-1, is said to be the orthogonal Chebyshev S-n-polynomials. This paper is an attempt to exibit some interesting properties of the orthogonal Chebyshev S-n-polynomials and to demonstrate their importance to the problem of approximation by S-n-polynomials. A simple proof of a Jackson-type theorem is given and the Lagrange interpolation problem by functions from S-n is discussed. It is shown also that tau(n) obeys an extremal property in L-q, 1 less than or equal to q less than or equal to infinity. Natural analogues of some inequalities for algebraic polynomials, which we expect to hold for the S-n-pelynomials, are conjectured.

An extremal nonnegative sine polynomial

For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn (θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each Pi 1 ≤ P ≤ ∞ and for any 27π-periodic function f ∈ Lp [-π, π], the sequence of convolutions Kn * f is proved to converge to f in Lp[-ππ]. The pointwise and almost everywhere convergences are also consequences of our construction.

Monotonicity and asymptotics of zeros of Sobolev type orthogonal polynomials: A general case

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the zeros of polynomials: An extension of the Enestrom-Kakeya theorem

This paper presents an extension of the Enestrom-Kakeya theorem concerning the roots of a polynomial that arises from the analysis of the stability of Brown (K, L) methods. The generalization relates to relaxing one of the inequalities on the coefficients of the polynomial. Two results concerning the zeros of polynomials will be proved, one of them providing a partial answer to a conjecture by Meneguette (1994)[6]. (C) 2011 Elsevier B.V. All rights reserved.

Convexity of the extreme zeros of Gegenbauer and Laguerre polynomials

Let C-n(lambda)(x), n = 0, 1,..., lambda > -1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal. in (-1, 1) with respect to the weight function (1 - x(2))(lambda-1/2). Denote by X-nk(lambda), k = 1,....,n, the zeros of C-n(lambda)(x) enumerated in decreasing order. In this short note, we prove that, for any n is an element of N, the product (lambda + 1)(3/2)x(n1)(lambda) is a convex function of lambda if lambda greater than or equal to 0. The result is applied to obtain some inequalities for the largest zeros of C-n(lambda)(x). If X-nk(alpha), k = 1,...,n, are the zeros of Laguerre polynomial L-n(alpha)(x), also enumerated in decreasing order, we prove that x(n1)(lambda)/(alpha + 1) is a convex function of alpha for alpha > - 1. (C) 2002 Published by Elsevier B.V. B.V.

Asymptotics of zeros of polynomials arising from rational integrals

We prove that the zeros of the polynomials P.. (a) of degree m, defined by Boros and Moll via[GRAPHICS]approach the lemmiscate {zeta epsilon C: \zeta(2) - 1\ = Hzeta < 0}, as m --> infinity. (C) 2004 Elsevier B.V. All rights reserved.

Real orthogonal polynomials in frequency analysis

We study the use of para-orthogonal polynomials in solving the frequency analysis problem. Through a transformation of Delsarte and Genin, we present an approach for the frequency analysis by using the zeros and Christoffel numbers of polynomials orthogonal on the real line. This leads to a simple and fast algorithm for the estimation of frequencies. We also provide a new method, faster than the Levinson algorithm, for the determination of the reflection coefficients of the corresponding real Szego polynomials from the given moments.