Polynomials associated with a functional product of the Hermite type

We have found the motivation for this paper in the research of a quantized closed Friedmann cosmological model. There, the second‐order linear ordinary differential equation emerges as a wave equation for the physical state functions. Studying the polynomial solutions of this equation, we define a new functional product in the space of real polynomials. This product includes the indexed weight functions which depend on the degrees of participating polynomials. Although it does not have all of the properties of an inner product, a unique sequence of polynomials can be associated with it by an additional condition. In the special case presented here, we consider the Hermite‐type weight functions and prove that the associated polynomial sequence can be expressed in the closed form via the Hermite polynomials. Also, we find their Rodrigues‐type formula and a four‐term recurrence relation. In contrast to the zeros of Hermite polynomials, which are symmetrically located with respect to the origin, the zeros of the new polynomial sequence are all positive. Copyright © 2015 John Wiley & Sons, Ltd.     

Zeros of univariate interval polynomials

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros is exactly n if multiplicities are counted. The boundaries of complex block zeros on a complex plane are analyzed. Numeric algorithms to bound interval zeros and complex block zeros are presented.     

An iteration formula for the simultaneous determination of the zeros of a polynomial

The need for efficient algorithms for determining zeros of given polynomials has been stressed in many applications. In this paper we give a new cubic iteration method for determining simultaneously all the zeros of a polynomial (assumed distinct) starting with ‘reasonably close’ initial approximations (also assumed distinct).The polynomial is expressed as an expansion in terms of the starting and their correction terms.A formula which gives cubic convergence without involving second derivatives is derived by retaining terms up to second order of the expansion in the correction terms.Numerical evidence is given to illustrate the cubic convergence of the process.     

An automatic search procedure for finding real zeros

Summary The paper describes the implementation of a globally convergent iterative algorithm for determining all the real zeros of certain classes of functions in any given interval. The algorithm is developed in terms of Ostrowski's square root formula and in the case of polynomials the relation with Laguerre's formula is obtained. A device is incorporated for overcoming the problem of numerical instability together with a number of associated devices for ensuring that no zeros have been missed. Application of the method is illustrated by two examples having clustered zeros.     

Sturm's Method in Counting Roots of Random Polynomial Equations

The problem of finding the probability distribution of the number of zeros in some real interval of a random polynomial whose coefficients have a given continuous joint density function is considered. An algorithm which enables one to express this probability as a multiple integral is presented. Formulas for the number of zeros of random quadratic polynomials and random polynomials of higher order, some coefficients of which are non-random and equal to zero, are derived via use of the algorithm. Finally, the applicability of these formulas in numerical calculations is illustrated.     

Separable polynomials over finite dimensional algebras

In [5] it was shown that for a polynomial P of precise degree n with coefficients in an arbitrary m-ary algebra of dimension d as a vector space over an algebraically closed fields, the zeros of P together with the homogeneous zeros of the dominant part of P form a set of cardinality n^d or the cardinality of the base field. We investigate polynomials with coefficients in a d dimensional algebra A without assuming the base field k to be algebraically closed. Separable polynomials are defined to be those which have exactly n^d distinct zeros in [Ktilde] ?_k A [Ktilde] where [Ktilde] denotes an algebraic closure of k. The main result states that given a separable polynomial of degree n, the field extension L of minimal degree over k for which L ?_k A contains all nd zeros is finite Galois over k. It is shown that there is a non empty Zariski open subset in the affine space of all d-dimensional k algebras whose elements A have the following property: In the affine space of polynomials of precise degree n with coefficients in A there is a non empty Zariski open subset consisting of separable polynomials; in other polynomials with coefficients in a finite dimensional algebra are “generically” separable.     

Polynomials whose coefficients coincide with their zeros

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results. We obtain estimates on the number of Ulam polynomials of degree N. We provide additional methods to obtain algebraic identities satisfied by the zeros of Ulam polynomials, beyond the straightforward comparison of their zeros and coefficients. To address the question about the existence of orthogonal Ulam polynomial sequences, we show that the only Ulam polynomial eigenfunctions of hypergeometric type differential operators are the trivial Ulam polynomials \(\{x^N\}_{N=0}^\infty \). We propose a family of solvable N-body problems such that their stable equilibria are the zeros of certain Ulam polynomials.     

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.     

Polynomial evaluation and associated polynomials

We show a connection between the Clenshaw algorithm for evaluating a polynomial , expanded in terms of a system of orthogonal polynomials, and special linear combinations of associated polynomials. These results enable us to get the derivatives of analogously to the Horner algorithm for evaluating polynomials in monomial representations. Furthermore we show how a polynomial given in monomial (!) representation can be evaluated for using the Clenshaw algorithm without complex arithmetic. From this we get a connection between zeros of polynomials expanded in terms of Chebyshev polynomials and the corresponding polynomials in monomial representation with the same coefficients. Received January 2, 1995 / Revised version received April 9, 1997     

A refined Gallai-Edmonds structure theorem for weighted matching polynomials

In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this is related to a modification by Sylvester of the classical Sturm's theorem on the number of zeros of a real polynomial in an interval. In addition, we obtain some other results about zeros of matching polynomials.     

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations: Application to Orthogonal Polynomials

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite–Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite–Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.     

Pseudozero Set of Real Multivariate Polynomials

The pseudozero set of a system P of polynomials in n variables is the subset of C ⁿ consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable sense. This concept arises naturally in Scientific Computing where data often have a limited accuracy. When the polynomials of the system are polynomials with complex coefficients, the pseudozero set has already been studied. In this paper, we focus on the case where the polynomials of the system have real coefficients and such that all the polynomials in all the perturbed polynomial systems have real coefficients as well. We provide an explicit definition to compute this pseudozero set. At last, we analyze different methods to visualize this set.      

Asymptotics for Stieltjes polynomials,padé-type approximants,and Gauss-Kronrod quadrature

We study the asymptotic properties of Stieltjes polynomials outside the support of the measure as well as the asymptotic behaviour of their zeros. These properties are used to estimate the rate of convergence of sequences of rational functions, whose poles are partially fixed, which approximate Markovtype functions. An estimate for the speed of convergence of the Gauss-Kronrod quadrature formula in the case of analytic functions is also given.     

On center sets of ODEs determined by moments of their coefficients

The classical H. Poincaré Center-Focus problem asks about the characterization of planar polynomial vector fields such that all their integral trajectories are closed curves whose interiors contain a fixed point, a center. This problem can be reduced to a center problem for some ordinary differential equation whose coefficients are trigonometric polynomials depending polynomially on the coefficients of the field. In this paper we show that the set of centers in the Center-Focus problem can be determined as the set of zeros of some continuous functions from the moments of coefficients of this equation.     

Analytic and arithmetic properties of the $$(\Gamma ,\chi )$$ ( Γ , χ ) -automorphic reproducing kernel function and associated Hermite–Gauss series

We consider the reproducing kernel function of the theta Bargmann–Fock Hilbert space associated with given full-rank lattice and pseudo-character, and we deal with some of its analytical and arithmetical properties. Specially, the distribution and the discreteness of its zeros are examined. The analytic sets of zeros of the theta Bargmann–Fock space inside a given fundamental cell is characterized and shown to be finite and of cardinal less or equal to its dimension. Moreover, we obtain some remarkable lattice sums by evaluating the so-called complex Hermite–Gauss coefficients. Some of them generalize some of the arithmetic identities given by Perelomov in the framework of coherent states for the specific case of von Neumann lattice. Such complex Hermite–Gauss coefficients are nontrivial examples of the so-called lattice’s functions according the Serre terminology. The perfect use of the basic properties of the complex Hermite polynomials is crucial in this framework.

     

Polynomial operators for spectral approximation of piecewise analytic functions

We propose the construction of a mixing filter for the detection of analytic singularities and an auto-adaptive spectral approximation of piecewise analytic functions, given either spectral or pseudo-spectral data, without knowing the location of the singularities beforehand. We define a polynomial frame with the following properties. At each point on the interval, the behavior of the coefficients in our frame expansion reflects the regularity of the function at that point. The corresponding approximation operators yield an exponentially decreasing rate of approximation in the vicinity of points of analyticity and a near best approximation on the whole interval. Unlike previously known results on the construction of localized polynomial kernels, we suggest a very simple idea to obtain exponentially localized kernels based on a general system of orthogonal polynomials, for which the Cesàro means of some order are uniformly bounded. The boundedness of these means is known in a number of cases, where no special function properties are known.     

Lower bounds for the zeros of analytic functions

Summary In the present work the problem of finding lower bounds for the zeros of an analytic function is reduced by a Hilbert space technique to the well-known problem of finding upper bounds for the zeros of a polynomial. Several lower bounds for all the zeros of analytic functions are thus found, which are always better than the well-known Carmichael-Mason inequality. Several numerical examples are also given and a comparison of our bounds with well-known bounds in literature and/or the exact solution is made.     

Biorthogonal polynomials: Recent developments

An important application of biorthogonal polynomials is in the generation of polynomial transformations that map zeros in a predictable way. This requires the knowledge of the explicit form of the underlying biorthogonal polynomials.The most substantive set of parametrized Borel measures whose biorthogonal polynomials are known explicitly are theMöbius quotient functions (MQFs), whose moments are Möbius functions in the parameter. In this paper we describe recent work on the characterization of MQFs, following two distinct approaches. Firstly, by restricting the attention to specific families of Borel measures, of the kind that featured in [4], it is possible sometimes to identify all possible MQFs by identifying a functional relationship between weight functions for different values of the parameter. Secondly, provided that the coefficients in Möbius functions are smooth (in a well defined sense), it is possible to prove that the weight function obeys a differential relationship that, in specific cases, allows an explicit characterization of MQFs. In particular, if all such coefficients are polynomial, the MQFs form a subset of generalized hypergeometric functions.Dedicated to Syvert P. Nørsett on the occasion of his 50th birthdayThis paper has been written during the author's visit to California Institute of Technology, Pasadena.     

Quasisymmetric functions and Kazhdan-Lusztig polynomials

We associate a quasisymmetric function to any Bruhat interval in a general Coxeter group. This association can be seen to be a morphism of Hopf algebras to the subalgebra of all peak functions, leading to an extension of the cd-index of convex polytopes. We show how the Kazhdan-Lusztig polynomial of the Bruhat interval can be expressed in terms of this complete cd-index and otherwise explicit combinatorially defined polynomials. In particular, we obtain the simplest closed formula for the Kazhdan-Lusztig polynomials that holds in complete generality.