How to count the number of zeros that a polynomial has on the unit circle?

DOI10.1016/J.CAM.2020.113169MaRDI QIDQ2222071zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 3 February 2021

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.04231

zbMATH Keywords

zerospolynomials

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Abstract: The classical problem of counting the number of real zeros of a real polynomial was solved a long time ago by Sturm. The analogous problem of counting the number of zeros that a polynomial has on the unit circle is, however, still an open problem. In this paper, we show that the second problem can be reduced to the first one through the use of a suitable pair of M"obius transformations - often called Cayley transformations - that have the property of mapping the unit circle onto the real line and vice versa. Although the method applies to arbitrary complex polynomials, we discuss in detail several classes of polynomials with symmetric zeros as, for instance, the cases of self-conjugate, self-adjoint, self-inversive, self-reciprocal and skew-reciprocal polynomials. Finally, an application of this method to Salem polynomials and to polynomials with small Mahler measure is also discussed.

Recommendations

• Counting Zeros of Real Polynomials within the Unit Disk
• scientific article; zbMATH DE number 2186398
• On the polynomials with all their zeros on the unit circle
• Polynomials with all zeros on the unit circle
• scientific article; zbMATH DE number 1918729

Cites work

• scientific article; zbMATH DE number 5812875 (Why is no real title available?)
• scientific article; zbMATH DE number 42630 (Why is no real title available?)
• scientific article; zbMATH DE number 1522868 (Why is no real title available?)
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• A graphical technique for nonlinear algebraic equations
• A modified Newton method for polynomials
• An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
• Collected works of Charles-François Sturm. Including lectures presented at the colloquium dedicated to Charles-François Sturm on the occasion of the 200th anniversary of his birth, Geneva, Switzerland, September 2003
• Computing Real Roots of Real Polynomials ... and now For Real!
• Computing real roots of real polynomials
• Efficient isolation of polynomial's real roots.
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Numerical computation of polynomial zeros by means of Aberth's method
• On the complex roots of algebraic equations
• On the number of roots of self-inversive polynomials on the complex unit circle
• On the various bisection methods derived from Vincent's theorem
• Polynomials with small Mahler measure
• Small Salem numbers
• The Fundamental Theorem of Algebra Made Effective: An Elementary Real-algebraic Proof via Sturm Chains
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

Cited in

(1)

• Orthogonal polynomials and Möbius transformations

Describes a project that uses

Uses Software

• ANewDsc
• na10
• ISOLATE

This page was built for publication: How to count the number of zeros that a polynomial has on the unit circle?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222071)