Citation: Dehmer M, Tsoy YR (2014) Numerical Evaluation and Comparison of Kalantari's Zero Bounds for Complex Polynomials. PLoS ONE 9(10): e110540. https://doi.org/10.1371/journal.pone.0110540
Editor: Frank Emmert-Streib, Queen's University Belfast, United Kingdom
Received: July 17, 2014; Accepted: September 20, 2014; Published: October 28, 2014
Copyright: © 2014 Dehmer, Tsoy. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: The authors confirm that all data underlying the findings are fully available without restriction. All relevant data are within the paper.
Funding: The authors have no funding or support to report.
Competing interests: The authors confirm that co-author Matthias Dehmer is a PLOS ONE Editorial Board member. This does not alter the authors' adherence to PLOS ONE Editorial policies and criteria.
The problem of calculating the zeros of polynomials has been at the core of various algorithmic problems in engineering, computer science, mathematics, and mathematical chemistry –. One the one hand, determining all zeros of a complex polynomial explicitly has been crucial for practical problems [6–7]. One the other hand, estimations (bounds) for the moduli of real and complex zeros have been important for many reasons. For example, sharp zero bounds can serve as starting values for numerical procedures to calculate the zeros explicitly as already mentioned above. Also, zero bounds have been proven useful when estimating eigenvalues of matrices , .
We emphasize that numerous papers and books have been contributed dealing with the problem of locating the zeros of complex polynomials, see, e.g., –, , . Many papers thereof discuss the problem of determining disks in the complex plane where all zeros of a complex polynomial are situated. In view of the vast amount of existing zero bounds, their optimality has only been little investigated. In fact, many of the bounds which have been used extensively in practice do not give the precise annulus containing all zeros of a given polynomial. Also, sharpness results do not exist for all bounds which are practically to use.
In this paper, we deal with the problem of evaluating the quality of zero bounds numerically. A successor of this paper is . In , we have put the emphasis on evaluating the quality of known bounds such as the ones due to Joyal, Mohammad, Kojima and Kalantari, see –. Another paper dealing with evaluating the quality of zero bounds numerically is due to McNamee and Olhovsky  who also evaluated classical and Kalantari's bounds on a set of polynomials with random real or complex roots. More precisely, they implemented 45 zero bounds for estimating the zeros with maximal modulus. These bounds have been evaluated on 1200 polynomials with random real or complex roots .
The main contribution of this paper is as follows: We focus on evaluating zero bounds developed by Kalantari  and Dehmer ,  solely. In , it was claimed that some of the Kalantari's bounds are optimal on the mentioned set of polynomials. We show that some of the proposed bounds outperform Kalantari's bounds on special classes of polynomials. That proves it can be worthwhile to consider special classes of polynomials and special bounds which have been developed to operate on these classes. Examples for such bounds can be found in . Also, we derive some analytical conditions to compare bounds due to Dehmer and Kalantari by means of inequalities, see, section ‘Numerical Results and Interpretation’.
In the following, we state the zero bounds for locating the zeros of complex polynomials as theorems we will explore in this paper. The numerical results will be presented in the section ‘Results’.
Kalantari and Dehmer Bounds
Theorem 1 (Kalantari ). Let and let be the positive root of the polynomial(1)
Theorem 2 (Kalantari ). Let and let be the positive root of the polynomial
Theorem 3 (Dehmer ). Let
The next theorem gives a bound for polynomials with restrictions on the coefficients. Dehmer  has shown that such bounds can be more precise and often lead to better results when locating the zeros of polynomials. See also Table 3.
Theorem 4 (Dehmer ). Let(6)
Theorem 5 (Dehmer ). Let
Theorem 6 (Dehmer ). Let and let
In , the following upper bound for these lacunary polynomials (see Theorem 6) has been stated without proof. Next, we here prove this result by assuming that the coefficients are positive and real-valued.
Proof. Since we infer by using the Descartes' rule of signs  that has either 2 or no positive zeros. We see that and . If , it follows that must have two positive zeros. The largest one is denoted as and we obtain . In order to get an estimation for , we consider(13)
If we can prove that the positive zero of does not fall outside the interval , we obtain Inequality 12. For this, we must prove that is strictly monotonically increasing in a certain interval.
But by performing elementary calculations we find that this inequality is valid for .
Data: Classes of Complex Polynomials
As in , we define the classes of polynomials used in this study as follows. Note that the abbreviation ‘GD’ in the below stated definitions stands for Gaussian Distribution.
In order to perform a statistical analysis, we have generated 1000 complex polynomials for each of the Definitions 1–6 and . For each polynomial , different bounds have been computed according to the Theorems 1–6. The following entity has been calculated:(39)where - bound value due to Theorem i, - maximal modulus among the roots for the polynomial . This entity reflects tightness of the bound, and its properties are:
- If , then the bound of Theorem i1 is tighter than the bound of Theorem i2.
To compare different bounds averaged values of were calculated for a fixed (Tables 1–6). The figures 1–3 illustrate the averaged bounds with 95% confidence intervals (dashed lines). The confidence intervals have been obtained by using two-sided t-test for 999 degrees of freedom:
The pairwise comparison of the averaged values has been performed by using paired t-test. As a result we see that in the majority of cases, the values of for the Theorems 1–6 are statistically different.
Numerical Results and Interpretation
We restrict our analysis to evaluate the performance of the bounds due to Kalantari and Dehmer only, see, section ‘Methods’. In order to do so, we employ the classes of polynomials represented by Definitions 1–6.
We start by interpreting the Tables 1–5 and see that Kalantari's bound given by Theorem 1 is often worse than the zero bounds due to Dehmer, except the bound given by Theorem 4. Lets consider the polynomials of Definition 1 as this class is quite general. Except Theorem 4, the mean ratios of the bounds due to Dehmer are smaller than the ones by using Kalantari's bound given by Theorem 1. In particular this holds for Theorem 3 as well. Also, we observe that Theorem 2 due to Kalantari is optimal for n>4 when using the Definitions 1–3; by using the Definitions 4–5, we obtain the optimality for n>3. We emphasize that the results for Definition 6 (lacunary polynomials) will be discussed separately. In summary, this does not mean that no special polynomials exist whose evaluation may give the opposite result.
The analytical comparison of the bounds has been intricate. That means it might be difficult to compare bounds which rely on different concepts (e.g., explicit vs. implicit bounds, see ). Zero bounds are explicit if their values represent functions of the polynomial coefficients . In contrast, a zero bound is called implicit if the value of the bound is a positive zero of a concomitant polynomial . For instance, Theorem 1 and Theorem 3 are explicit but the Theorems 4–6 are implicit.
In case of using the explicit zero bounds Theorem 1 and Theorem 3, it is straightforward to derive an analytical expression (condition) to compare the bounds by means of inequalities. If we start with the inequality (i.e., we assume that Theorem 1 is better than Theorem 3),(40)we derive
Otherwise, we yield(43)with . These inequalities can be used to compare Theorem 1 and Theorem 3 by means of inequalities assuming that Theorem 1 is worse than Theorem 3. Such a condition seems to be useful as we see by Tables 1–5 that the mean ratios of Theorem 3 are less than the ones by using Theorem 1.
The results of the evaluation for lacunary polynomials (see Definition 6) can be seen in Table 6. Dehmer's bounds given by Theorem 5 and Theorem 6 which have been designed for lacunary polynomials outperform both Kalantari bounds. For example, if we evaluate Theorem 1 and Theorem 2 for the polynomials of Definition 6), we obtain(49)and
According to Theorem 7, an upper bound for is if . Note that this bound does not depend on . If , we infer . We observe that we always obtain if or . When considering Theorem 2, we always get if or . Even if , but the degree of the polynomials tends to be very large, the bounds of Theorem 1 and Theorem 2 tend to 2 and 1.618034, respectively. In summary, we see that the bound for lacunary polynomials due to Dehmer (see Theorem 6) gives often tighter bounds; in particular when a1<1. Similar arguments can be applied when considering Theorem 6.
Summary and Conclusion
In this paper, we explored the performance of zero bounds due to Kalantari and Dehmer. In earlier contributions, it has been claimed  that Kalantari's bounds are often better than classical zero bounds. A similar study has been performed by Dehmer and Tsoy  who evaluated classical and more recent zero bounds for complex and real polynomials as well.
The main result of this paper is that some of the bounds due to Dehmer outperform the bounds due to Kalantari for special classes of polynomials. In particular when using lacunary polynomials (i.e., many coefficients equal zero) Dehmer's bounds showed excellent performance. We have underpinned our discussion to interpret the numerical results by analytical results. In particular, we have proved an upper bound for lacunary polynomials (see Theorem 7) and obtained conditions for some special cases to check whether one bound is better (or worse) than another by means of inequalities.
Another interesting line of research is to study the zeros of graph polynomials. Some recent related work dealing with applications on graph polynomials are –. In these contributions, graph polynomials have been used to encode special graphs, e.g., chemical graphs and also exhaustively generated networks. Consequently their zeros could be studied in terms of investigating structural properties of networks, see . Zero bounds may play an important role to estimate the moduli of the underlying polynomials efficiently and to use these quantities for discriminating networks or to explore structural properties such as branching , , .
- 1. Dehmer M (2006) On the location of zeros of complex polynomials. Journal of Inequalities in Pure and Applied Mathematics, Vol 7 (1)..
- 2. Heitzinger W, Troch WI, Valentin G (1985) Praxis nichtlinearer Gleichungen. Carl Hanser Verlag. München, Wien, Germany, Austria.
- 3. Mignotte M, Stefanescu D (1999) Polynomials: An Algorithmic Approach. Discrete Mathematics and Theoretical Computer Science. Springer. Singapore.
- 4. Prasolov VV (2004) Polynomials. Springer.
- 5. Rahman QI, Schmeisser G (2002) Analytic Theory of Polynomials. Critical Points, Zeros and Extremal Properties. Clarendon Press. Oxford, UK.
- 6. Householder AS (1970) The Numerical Treatment of a single Nonlinear Equation. McGraw-Hill. New York, NY, USA.
- 7. Obreschkoff N (1963) Verteilung und Berechnung der Nullstellen reeller Polynome. Hochschulbücher für Mathematik, Vol. 55 . VEB Deutscher Verlag der Wissenschaften. Berlin, Germany.
- 8. Cvetković DM, Doob M, Sachs H (1980) Spectra of Graphs. Theory and Application. Deutscher Verlag der Wissenschaften. Berlin, Germany.
- 9. Sagan H (1989) Boundary and Eigenvalue Problems in Mathematical Physics. Dover Publications
- 10. Marden M (1966) Geometry of polynomials. Mathematical Surveys of the American Mathematical Society, Vol. 3 . Rhode Island, USA.
- 11. Mohammad QG (1965) On the zeros of polynomials. American Mathematical Monthly 72: 35–38.
- 12. Dehmer M, Tsoy YR (2012) The quality of zero bounds for complex polynomials. PLoS ONE 7: e39537.
- 13. Joyal A, Labelle G, Rahman QI (1967) On the location of polynomials. Canadian Mathematical Bulletin 10: 53–63.
- 14. Kuniyeda M (1916) Note on the roots of algebraic equations. Tôhoku Math J 8: 167–173.
- 15. Kojima J (1914) On a theorem of Hadamard and its applications. Tôhoku Mathematical Journal 5: 54–60.
- 16. Kalantari B (2005) An infinite family of bounds on zeros of analytic functions and relationship to smale's bound. Mathematics of Computation 74: 841–852.
- 17. McNamee JM, Olhovsky M (2005) A comparison of a priori bounds on (real or complex) roots of polynomials. In: Proceedings of 17th IMACS World Congress, Paris, France.
- 18. Dehmer M, Mowshowitz A (2011) Bounds on the moduli of polynomial zeros. Applied Mathematics and Computation 218: 4128–4137.
- 19. Chou CP, Witek HA (2014) Zzdecomposer: A graphical toolkit for analyzing the zhang-zhang polynomials of benzenoid structures. MATCH Communications in Mathematical and in Computer Chemistry 71: 741–764.
- 20. Dehmer M, Shi Y, Emmert-Streib F (2014) Structural differentiation of graphs using hosoya-based indices. PLoS ONE 9: e102459.
- 21. Lou Z, Huang Q, Yiu D (2014) On the characteristic polynomial and the spectrum of a hexagonal system. MATCH Communications in Mathematical and in Computer Chemistry 72: 153–164.
- 22. Dehmer M, Ilić A (2012) Location of zeros of wiener and distance polynomials. PLoS ONE 7: e28328.
- 23. Bonchev D (1995) Topological order in molecules 1. Molecular branching revisited. Journal of Molecular Structure: THEOCHEM 336: 137–156.
- 24. Schutte M, Dehmer M (2013) Large-scale analysis of structural branching measures. Journal of Mathematical Chemistry 52: 805–819.