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)

Evaluation of an average numerator relationship matrix model and a Bayesian hierarchical model for growth traits in Nellore cattle with uncertain paternity

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

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.

Stabilizing controller design for uncertain nonlinear systems using fuzzy models

A Lyapunov-based stabilizing control design method for uncertain nonlinear dynamical systems using fuzzy models is proposed. The controller is constructed using a design model of the dynamical process to be controlled. The design model is obtained from the truth model using a fuzzy modeling approach. The truth model represents a detailed description of the process dynamics. The truth model is used in a simulation experiment to evaluate the performance of the controller design. A method for generating local models that constitute the design model is proposed. Sufficient conditions for stability and stabilizability of fuzzy models using fuzzy state-feedback controllers are given. The results obtained are illustrated with a numerical example involving a four-dimensional nonlinear model of a stick balancer.

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.

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.

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.

Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

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.

On the behaviour of zeros of Jacobi polynomials

Denote by x(n,k)(alpha, beta) and x(n,k) (lambda) = x(n,k) (lambda - 1/2, lambda - 1/2) the zeros, in decreasing order, of the Jacobi polynomial P-n((alpha, beta))(x) and of the ultraspherical (Gegenbauer) polynomial C-n(lambda)(x), respectively. The monotonicity of x(n,k)(alpha, beta) as functions of a and beta, alpha, beta > - 1, is investigated. Necessary conditions such that the zeros of P-n((a, b)) (x) are smaller (greater) than the zeros of P-n((alpha, beta))(x) are provided. A. Markov proved that x(n,k) (a, b) < x(n,k)(α, β) (x(n,k)(a, b) > x(n,k)(alpha, beta)) for every n is an element of N and each k, 1 less than or equal to k less than or equal to n if a > alpha and b < β (a < alpha and b > beta). We prove the converse statement of Markov's theorem. The question of how large the function could be such that the products f(n)(lambda) x(n,k)(lambda), k = 1,..., [n/2] are increasing functions of lambda, for lambda > - 1/2, is also discussed. Elbert and Siafarikas proved that f(n)(lambda) = (lambda + (2n(2) + 1)/ (4n + 2))(1/2) obeys this property. We establish the sharpness of their result. (C) 2002 Elsevier B.V. (USA).

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.