Inequalities for zeros of associated polynomials and derivatives of orthogonal polynomials

It is well known and easy to see that the zeros of both the associated polynomial and the derivative of an orthogonal polynomial p(n)(x) interlace with the zeros of p(n)(x) itself. The natural question of how these zeros interlace is under discussion. We give a sufficient condition for the mutual location of kth, 1 less than or equal to k less than or equal to n - 1, zeros of the associated polynomial and the derivative of an orthogonal polynomial in terms of inequalities for the corresponding Cotes numbers. Applications to the zeros of the associated polynomials and the derivatives of the classical orthogonal polynomials are provided. Various inequalities for zeros of higher order associated polynomials and higher order derivatives of orthogonal polynomials are proved. The results involve both classical and discrete orthogonal polynomials, where, in the discrete case, the differential operator is substituted by the difference operator. (C) 2001 IMACS. Published by Elsevier B.V. B.V. All rights reserved.

INEQUALITIES FOR ZEROS of JACOBI POLYNOMIALS VIA OBRECHKOFF'S THEOREM

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

Inequalities for zeros of Jacobi polynomials via Sturm's theorem: Gautschi's conjectures

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Connection coefficients and zeros of orthogonal polynomials

We discuss an old theorem of Obrechkoff and some of its applications. Some curious historical facts around this theorem are presented. We make an attempt to look at some known results on connection coefficients, zeros and Wronskians of orthogonal polynomials from the perspective of Obrechkoff's theorem. Necessary conditions for the positivity of the connection coefficients of two families of orthogonal polynomials are provided. Inequalities between the kth zero of an orthogonal polynomial p(n)(x) and the largest (smallest) zero of another orthogonal polynomial q(n)(x) are given in terms of the signs of the connection coefficients of the families {p(n)(x)} and {q(n)(x)}, An inequality between the largest zeros of the Jacobi polynomials P-n((a,b)) (x) and P-n((alpha,beta)) (x) is also established. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Positive solutions of the p-Laplacian involving a superlinear nonlinearity with zeros

Using a combination of several methods, such as variational methods. the sub and supersolutions method, comparison principles and a priori estimates. we study existence, multiplicity, and the behavior with respect to lambda of positive solutions of p-Laplace equations of the form -Delta(p)u = lambda h(x, u), where the nonlinear term has p-superlinear growth at infinity, is nonnegative, and satisfies h(x, a(x)) = 0 for a suitable positive function a. In order to manage the asymptotic behavior of the solutions we extend a result due to Redheffer and we establish a new Liouville-type theorem for the p-Laplacian operator, where the nonlinearity involved is superlinear, nonnegative, and has positive zeros. (C) 2009 Elsevier Inc. All rights reserved.

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.

Controle ótimo H2 e H¥ com modificação de zeros para o problema de rastreamento usando LMI

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

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.

Convolutions and zeros of orthogonal polynomials

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

Alocação de zeros aplicada a sistemas de controle via LMI

A systematic procedure of zero placement to design control systems is proposed. A state feedback controller with vector gain K is used to perform the pole placement. An estimator with vector gain L is also designed for output feedback control. A new systematic method of zero assignment to reduce the effect of the undesirable poles of the plant and also to increase the velocity error constant is presented. The methodology places the zeros in a specific region and it is based on Linear Matrix Inequalities (LMIs) framework, which is a new approach to solve this problem. Three examples illustrate the effectiveness of the proposed method.

Controle ótimo H 'INFINITO' e H2 com a locação de pólos e modificação de zeros para rastreamento de sinais e rejeição de distúrbios em sistemas de controle usando LMIs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Controle ótimo H 'INFINITO' com modificação de zeros para o problema de rastreamento em sistemas discretos usando LMI

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

Projeto de Controladores Robustos H∞ para Sistemas Discretos Utilizando Modificação de Zeros

Pós-graduação em Engenharia Elétrica - FEIS

Modificação de zeros em sistemas de controle robusto utilizando LMIs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

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 Inc. All rights reserved.