Unimodularity of zeros of self-inversive polynomials

We generalise a necessary and sufficient condition given by Cohn for all the zeros of a self-inversive polynomial to be on the unit circle. Our theorem implies some sufficient conditions found by Lakatos, Losonczi and Schinzel. We apply our result to the study of a polynomial family closely related to Ramanujan polynomials, recently introduced by Gun, Murty and Rath, and studied by Murty, Smyth and Wang as well as by Lalín and Rogers. We prove that all polynomials in this family have their zeros on the unit circle, a result conjectured by Lalín and Rogers on computational evidence.     

Self-Inversive Polynomials with All Zeros on the Unit Circle

Conditions are given in the coefficients of a self-inversive polynomial under which all its zeros are on the unit circle.To my friend, Jean-Louis Nicolas at the occasion of his sixtieth birthday2000 Mathematics Subject Classification: Primary—30C15     

Polynomials with all zeros on the unit circle

We give a new suffcient condition for all zeros of self-inversive polynomials to be on the unit circle, and find the location of zeros. This generalizes some recent results of Lakatos [7], Schinzel [17], Lakatos and Losonczi [9], [10]. By this suffcient condition the mentioned results can be treated in a unified way.     

An extended version of Schur-Cohn-Fujiwara theorem in stability theory

This paper is concerned with root localization of a complex polynomial with respect to the unit circle in the more general case. The classical Schur-Cohn-Fujiwara theorem converts the inertia problem of a polynomial to that of an appropriate Hermitian matrix under the condition that the associated Bezout matrix is nonsingular. To complete it, we discuss an extended version of the Schur-Cohn-Fujiwara theorem to the singular case of that Bezout matrix. Our method is mainly based on a perturbation technique for a Bezout matrix. As an application of these results and methods, we further obtain an explicit formula for the number of roots of a polynomial located on the upper half part of the unit circle as well.     

Root statistics of random polynomials with bounded Mahler measure

The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree N polynomial chosen uniformly from the set of polynomials of Mahler measure at most 1 yield a Pfaffian point process on the complex plane. When N is large, with probability tending to 1, the roots tend to the unit circle, and we investigate the asymptotics of the scaled kernel in a neighborhood of a point on the unit circle. When this point is away from the real axis (on which there is a positive probability of finding a root) the scaled process degenerates to a determinantal point process with the same local statistics (i.e.   scalar kernel) as the limiting process formed from the roots of complex polynomials chosen uniformly from the set of polynomials of Mahler measure at most 1. Three new matrix kernels appear in a neighborhood of ±1 which encode information about the correlations between real roots, between complex roots and between real and complex roots. Away from the unit circle, the kernels converge to new limiting kernels, which imply among other things that the expected number of roots in any open subset of C$\mathbb{C}$ disjoint from the unit circle converges to a positive number. We also give ensembles with identical statistics drawn from two-dimensional electrostatics with potential theoretic weights, and normal matrices chosen with regard to their topological entropy as actions on Euclidean space.     

稳定性判定与多项式求根算法

本文给出了一种判定多项式根是否全在单位圆内的简便方法．该方法可用于判定离散控制系统的稳定性和求多项式的全部根。     

Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

We present a general method for the exact computation of the number of zeros of a complex polynomial inside the unit disk, assuming that the polynomial does not vanish on the unit circle. We prove the existence of a polynomial sequence. This sequence involves a reduced number of arithmetic operations and the growth of intermediate coefficients remains controlled. We study the singular case where the constant term of a polynomial of this sequence vanishes.     

About measures and nodal systems for which the Hermite interpolants uniformly converge to continuous functions on the circle and interval

We obtain the Laurent polynomial of Hermite interpolation on the unit circle for nodal systems more general than those formed by the n-roots of complex numbers with modulus one. Under suitable assumptions for the nodal system, that is, when it is constituted by the zeros of para-orthogonal polynomials with respect to appropriate measures or when it satisfies certain properties, we prove the convergence of the polynomial of Hermite-Fejér interpolation for continuous functions. Moreover, we also study the general Hermite interpolation problem on the unit circle and we obtain a sufficient condition on the interpolation conditions for the derivatives, in order to have uniform convergence for continuous functions.Finally, we obtain some improvements on the Hermite interpolation problems on the interval and for the Hermite trigonometric interpolation.     

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circle on the complex plane. It turns out that this new setting allows for a phaseless recovery of a polynomial in a polynomial time.     

基于表面阻抗张量的界面滑移波动态失稳分析

基于Stroh公式和表面阻抗张量理论,提出了研究界面滑移波动态失稳问题的一种新的方法．该方法将表面阻抗张量概念推广到复波速域,并将摩擦接触界面上的边界条件以表面阻抗张量表示．最终将边值问题化归为求解一个复多项式在单位圆内的根．以弹性半空间与刚体平面相对稳态摩擦滑移为例进行了详细的分析,导出了一个4次复特征方程并讨论了方程在单位圆内解的特性,给出了滑移界面波失稳条件的显式解析表达式．     

On the refinement of Cauchy's theorem and Pellet's theorem

Using the relationship of a polynomial and its associated polynomial, we derived a necessary and sufficient condition for determining all roots of a given polynomial on the circumference of a circle defined by its associated polynomial. By employing the technology of analytic inequality and the theory of distribution of zeros of meromorphic function, we refine two classical results of Cauchy and Pellet about bounds of modules of polynomial zeros. Sufficient conditions are obtained for the polynomial whose Cauchy's bound and Pellet's bounds are strict bounds. The characteristics is given for the polynomial whose Cauchy's bound or Pellet's bounds can be achieved by the modules of zeros of the polynomial.     

On the Schur-Cohn problem

A new criterion (in terms of determinant inequalities) is obtained for all the roots of a real polynomial to lie inside the unit circle, i.e., a criterion of stability of periodic motions. In contrast to the Schur-Cohn criterion, the number of determinants used by us is by four times smaller.     

A problem of Boyd concerning geometric means of polynomials

In this paper we derive an equality which characterizes the distribution of the modulus of a polynomial on the unit circle. This inequality is used to prove a conjecture of Boyd concerning the geometric mean of the modulus of a polynomial of several variables averaged over the torus. References are cited which discuss the relationship of this conjecture to a classical question of Lehmer concerning the distribution of roots of polynomials.     

Polynomial wavelets on the unit circle

In this paper, we have considered polynomial wavelets on unit circle. The scaling functions are considered to be the fundamental polynomials of the Lagrange interpolants on the equally spaced nodes different from the n roots of unity, which satisfy certain interpolatory conditions.     

Spectral factorization of Laurent polynomials

We analyse the performance of five numerical methods for factoring a Laurent polynomial, which is positive on the unit circle, as the modulus squared of a real algebraic polynomial. It is found that there is a wide disparity between the methods, and all but one of the methods are significantly influenced by the variation in magnitude of the coefficients of the Laurent polynomial, by the closeness of the zeros of this polynomial to the unit circle, and by the spacing of these zeros. This revised version was published online in August 2006 with corrections to the Cover Date.     

The number of roots of a polynomial outside a circle

We obtain a new criterion in terms of determinant inequalities that all the roots of a real polynomial should lie inside the unit circle, i.e., a criterion for the stability of periodic motions. In comparison with the Shur-Kon criterion, the number of determinants is halved.The results of this paper were published without proof in [2].Translated from Matematicheskie Zametki, Vol. 13, No. 1, pp. 3–12, January, 1973.     

Discrete linearized least-squares rational approximation on the unit circle

We already generalized the Rutishauser—Gragg—Harrod—Reichel algorithm for discrete least-squares polynomial approximation on the real axis to the rational case. In this paper, a new method for discrete least-squares linearized rational approximation on the unit circle is presented. It generalizes the algorithms of Reichel—Ammar—Gragg for discrete least-squares polynomial approximation on the unit circle to the rationale case. The algorithm is fast in the sense that it requires order m computation time where m is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel. Examples illustrate the numerical behavior of the algorithm.     

On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes

Numerical Algorithms - We prove upper and lower bounds for the spectral condition number of rectangular Vandermonde matrices with nodes on the complex unit circle. The nodes are “off the...     

Asymptotics for polynomials orthogonal over the unit disk with respect to a positive polynomial weight

We derive asymptotics for polynomials orthogonal over the complex unit disk with respect to a weight of the form ²|h(z)|, with h(z) a polynomial without zeros in |z|<1. The behavior of the polynomials is established at every point of the complex plane. The proofs are based on adapting to the unit disk a technique of J. Szabados for the asymptotic analysis of polynomials orthogonal over the unit circle with respect to the same type of weight.     

On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors

We show two simple algorithms for isolation of the real and nearly real zeros of a univariate polynomial, as well as of those zeros that lie on or near a fixed circle on the complex plane. We also simplify slightly approximation of complex zeros of a polynomial with real coefficients.