We use submultiplicative companion matrix norms to provide new bounds for roots for a given polynomial P(X) over the field C[X]. From a n×n Fiedler companion matrix C, sparse companion matrices and triangular Hessenberg matrices are introduced. Then, we identify a special triangular Hessenberg matrix Lr, supposed to provide a good estimation of the roots. By application of Gershgorin’s theorems to this special matrix in case of submultiplicative matrix norms, some estimations of bounds for roots are made. The obtained bounds have been compared to known ones from the literature precisely Cauchy’s bounds, Montel’s bounds and Carmichel-Mason’s bounds. According to the starting formel of Lr, we see that the more we have coefficients closed to zero with a norm less than 1, the more the Sparse method is useful.
References
[1]
Meulen, K.N.V. and Vanderwoerd, T. (2018) Bounds on Polynomial Roots Using Intercyclic Companion Matrices. Linear Algebra and Its Applications, 539, 94-116. https://doi.org/10.1016/j.laa.2017.11.002
[2]
Eastman, B., Kim, I.J., Shader, B.L. and Meulen, K.N.V. (2014) Companion Matrices Patterns. Linear Algebra and Its Applications, 463, 255-272. https://doi.org/10.1016/j.laa.2014.09.010
[3]
Dehmer, M. and Tsoy, Y.R. (2012) The Quality of Zero Bounds for Complex Polynomials. PLoS ONE, 7, e39537. https://doi.org/10.1371/journal.pone.0039537
[4]
Fiedler, M. (2003) A Note on Companion Matrices. Linear Algebra and Its Applications, 372, 325-331. https://doi.org/10.1016/S0024-3795(03)00548-2
[5]
Mignotte, M. (1992) Mathematics for Computer Algebra. Springer Verlag, New York. https://doi.org/10.1007/978-1-4613-9171-5
[6]
Melman, A. (2012) Modified Gershgorin Disks for Companion Matrices. Society for Industrial and Applied Mathematics, 54, 355-373. https://doi.org/10.1137/100797667
[7]
De Terán, F., Dopico, F.M. and Pérez, J. (2014) New Bounds for Roots of Polynomials Based on Fiedler Companion Matrices. Linear Algebra and Its Applications, 451, 197-230. https://doi.org/10.1016/j.laa.2014.03.013
