Applications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems

We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to determine optimally localized polynomials on the unit ball.     

A note on some improvements of the simultaneous methods for determination of polynomial zeros

Applying Gauss-Seidel approach to the improvements of two simultaneous methods for finding polynomial zeros, presented in [9], two iterative methods with faster convergence are obtained. The lower bounds of the R-order of convergence for the accelerated methods are given. The improved methods and their accelerated modifications are discussed in view of the convergence order and the number of numerical operations. The considered methods are illustrated numerically in the example of an algebraic equation.     

The zeros of linear combinations of orthogonal polynomials

Let {p_n} be a sequence of monic polynomials with p_n of degree n, that are orthogonal with respect to a suitable Borel measure on the real line. Stieltjes showed that if m<n and x₁,…,x_n are the zeros of p_n with x₁<<x_n then there are m distinct intervals f the form (x_j,x_j+1) each containing one zero of p_m. Our main theorem proves a similar result with p_m replaced by some linear combinations of p₁,…,p_m. The interlacing of the zeros of linear combinations of two and three adjacent orthogonal polynomials is also discussed.     

A note on exponent of convergence of zeros of entire functions

If f(z) is an entire function with ρ ₁ > 0 as its exponent of convergence of zeros and if 0 ≤ α < ρ ₁, then we prove the existence of entire functions each having α as its exponent of convergence of zeros.      

Graphs of zeros of analytic families

Let be a family of holomorphic functions in a domain depending holomorphically on . We study the distribution of zeros of in a subdomain whose boundary is a closed non-singular analytic curve. As an application, we obtain several results about distributions of zeros of families of generalized exponential polynomials and displacement maps related to certain ODE's.

     

First and second kind paraorthogonal polynomials and their zeros

Given a probability measure μ with infinite support on the unit circle , we consider a sequence of paraorthogonal polynomials h_n(z,λ) vanishing at z=λ where is fixed. We prove that for any fixed z₀supp(dμ) distinct from λ, we can find an explicit ρ>0 independent of n such that either h_n or h_n+1 (or both) has no zero inside the disk B(z₀,ρ), with the possible exception of λ.Then we introduce paraorthogonal polynomials of the second kind, denoted s_n(z,λ). We prove three results concerning s_n and h_n. First, we prove that zeros of s_n and h_n interlace. Second, for z₀ an isolated point in supp(dμ), we find an explicit radius such that either s_n or s_n+1 (or both) have no zeros inside . Finally, we prove that for such z₀ we can find an explicit radius such that either h_n or h_n+1 (or both) has at most one zero inside the ball .     

On the coefficients of a polynomial with restricted zeros

LetP(Z)=αn Zn + αn-1Zn-1 +…+α0 be a complex polynomial of degree n. There is a close connection between the coefficients and the zeros of P(z). In this paper we prove some sharp inequalities concerning the coeffi-cients of the polynomial P(z) with restricted zeros. We also establish a sufficient condition for the separation of zeros of P(z).     

Convergence of random zeros on complex manifolds

We show that the zeros of random sequences of Gaussian systems of polynomials of in- creasing degree almost surely converge to the expected limit distribution under very general hypotheses. In particular,the normalized distribution of zeros of systems of m polynomials of degree N,orthonor- malized on a regular compact set K(?)C~m,almost surely converge to the equilibrium measure on K as N→∞.     

ON THE ZEROS OF A CLASS OF POLYNOMIALS AND RELATED ANALYTIC FUNCTIONS

In this paper we prove some interesting extensions and generalizations of Enestrom- Kakeya Theorem concerning the location of the zeros of a polynomial in a complex plane. We also obtain some zero-free regions for a class of related analytic functions. Our results not only contain some known results as a special case but also a variety of interesting results can be deduced in a unified way by various choices of the parameters.     

Approximating the zeros of analytic functions by the exclusion algorithm

We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of . We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.     

A note on Sobolev orthogonality for Laguerre matrix polynomials

Let {Ln(A,λ)(x)}n≥0 be the sequence of monic Laguerre matrix polynomials defined on [0, ∞) by Ln(A,λ)(x)=n!/(-λ)n∑nk=0(-λ)κ/k!(n-1)! (A I)n[(A I)k]-1 xk,where A ∈ Cr×r. It is known that {Ln(A,λ)(x)}n≥0 is orthogonal with respect to a matrix moment functional when A satisfies the spectral condition that Re(z) ＞ - 1 for every z ∈σ(A).In this note we show that forA such that σ(A) does not contain negative integers, the Laguerre matrix polynomials Ln(A,λ) (x) are orthogonal with respect to a non-diagonal SobolevLaguerre matrix moment functional, which extends two cases: the above matrix case and the known scalar case.     

Bounds on the moduli of polynomial zeros

In this paper, we develop methods for establishing improved bounds on the moduli of the zeros of complex and real polynomials. Specific (lacunary) as well as arbitrary polynomials are considered. The methods are applied to specific polynomials by way of example. Finally, we evaluate the quality of some bounds numerically.     

On the zeros of a polynomial and its derivatives

If is univariate polynomial with complex coefficients having all its zeros inside the closed unit disk, then the Gauss-Lucas theorem states that all zeros of lie in the same disk. We study the following question: what is the maximum distance from the arithmetic mean of all zeros of to a nearest zero of ? We obtain bounds for this distance depending on degree. We also show that this distance is equal to for polynomials of degree 3 and polynomials with real zeros.

     

Interlacing of positive real zeros of Bessel functions

We unify the three distinct inequality sequences (Abramowitz and Stegun (1972) [1, 9.5.2]) of positive real zeros of Bessel functions into a single one.     

The zeros of Euler's Psi function and its derivatives

We investigate the locations of the points of inflexion of Euler's Psi function, and the positions of the stationary points of its derivative. We also establish some trigonometric approximations to Psi which lead to improved estimates for the positions of its zeros. Finally we consider the behaviour of the horizontal separation between the branches.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

A generalization of Laguerre's theorems on zeros of entire functions

We prove some results generalizing the classical Laguerre theorems about the multiplicity and the number of zeros of the function

A higher order family for the simultaneous inclusion of multiple zeros of polynomials

Starting from a suitable fixed point relation, a new family of iterative methods for the simultaneous inclusion of multiple complex zeros in circular complex arithmetic is constructed. The order of convergence of the basic family is four. Using Newtons and Halleys corrections, we obtain families with improved convergence. Faster convergence of accelerated methods is attained with only few additional numerical operations, which provides a high computational efficiency of these methods. Convergence analysis of the presented methods and numerical results are given. AMS subject classification 65H05, 65G20, 30C15     

Numerical computation of polynomial zeros by means of Aberth's method

An algorithm for computing polynomial zeros, based on Aberth's method, is presented. The starting approximations are chosen by means of a suitable application of Rouché's theorem. More precisely, an integerq 1 and a set of annuliA _i,i=1,...,q, in the complex plane, are determined together with the numberk _i of zeros of the polynomial contained in each annulusA _i. As starting approximations we choosek _i complex numbers lying on a suitable circle contained in the annulusA _i, fori=1,...,q. The computation of Newton's correction is performed in such a way that overflow situations are removed. A suitable stop condition, based on a rigorous backward rounding error analysis, guarantees that the computed approximations are the exact zeros of a nearby polynomial. This implies the backward stability of our algorithm. We provide a Fortran 77 implementation of the algorithm which is robust against overflow and allows us to deal with polynomials of any degree, not necessarily monic, whose zeros and coefficients are representable as floating point numbers. In all the tests performed with more than 1000 polynomials having degrees from 10 up to 25,600 and randomly generated coefficients, the Fortran 77 implementation of our algorithm computed approximations to all the zeros within the relative precision allowed by the classical conditioning theorems with 11.1 average iterations. In the worst case the number of iterations needed has been at most 17. Comparisons with available public domain software and with the algorithm PA16AD of Harwell are performed and show the effectiveness of our approach. A multiprecision implementation in MATHEMATICA is presented together with the results of the numerical tests performed.Work performed under the support of the ESPRIT BRA project 6846 POSSO (POlynomial System SOlving).     

Stability of the orthogonality preserving property in finite-dimensional inner product spaces

We establish a stability property for inner product preserving (not necessarily linear) mappings. Then, as a consequence, we show that a linear mapping, defined on a finite-dimensional inner product space, which approximately preserves orthogonality can be approximated by a linear, orthogonality preserving one.