Research ArticleOpen AccessGoogle Scholar indexed
Estimated Bounds for Zeros of Polynomials from Traces of Graeffe Matrices
Département de Mathématiques et d’informatique, Université A. Moumouni de Niamey, Niamey, Niger
Département de Mathématiques et d’informatique, Université A. Moumouni de Niamey, Niamey, Niger
Institut de Recherche sur l’Enseignement des Mathématiques, Université A. Moumouni de Niamey, Niamey, Niger
- 1 Département de Mathématiques et d’informatique, Université A. Moumouni de Niamey, Niamey, Niger
- 2 Département de Mathématiques et d’informatique, Université A. Moumouni de Niamey, Niamey, Niger
- 3 Institut de Recherche sur l’Enseignement des Mathématiques, Université A. Moumouni de Niamey, Niamey, Niger
Advances in Linear Algebra & Matrix Theory·Volume 04 (2014)·Pages 210–215·Published 14 November 2014·DOI10.4236/alamt.2014.44019
Copy link · social · email
Abstract
In this paper, we combine Graeffe matrices with the classical numerical method of Dandelin-Graeffe to estimate bounds for the moduli of the zeros of polynomials. Furthermore, we give some examples showing significant gain for the convergence towards the polynomials dominant zeros moduli.
KeywordsGraeffe MatricesNumerical Approximation of EigenvaluesDandelin-Graeffe’s MethodBounds of Zeros of Polynomial
- Matthias, D. and Jurgen, K. (2007) On Bounds for the Zeros of Univariate Polynomials. Proceedings of World Academy of Science: Engineering & Technology, 20, 205.
- Parodi, M. (1959) La Localisation des valeurs caractéristiques des Matrices et ses Applications. Gauthier-Villars, Paris.
- Marden. M. (1949) The Geometry of the Zeros of a Polynomial in a Complex Variable. American Mathematical Society, New York. http://dx.doi.org/10.1090/surv/003
- Dehmer, M. and Tsoy, Y.R. (2012) The Quality of Zero Bounds for Complex Polynomials. PLoS ONE, 7, e39537. http://dx.doi.org/10.1371/journal.pone.0039537
- Linden, H. (1998) Bounds for the Zeros of Polynomials from Eigenvalues and Singular Values of Some Companion Matrices. Linear Algebra and Its Applications, 271, 41-82. http://dx.doi.org/10.1016/S0024-3795(97)00254-1
- Mignotte, M. (1992) Mathematics for Computer Algebra. Springer Verlag, New York. http://dx.doi.org/10.1007/978-1-4613-9171-5
- Mignotte, M. and Stefanescu, D. (2003) Linear Recurrent Sequences and Polynomial Roots. Journal of Symbolic Computation, 35, 637-649. http://dx.doi.org/10.1016/S0747-7171(03)00030-0
- Kallol, P. and Santanu, B. (2012) On Numerical Radius of a Matrix and Estimation of Bounds for Zeros of a Polynomial. International Journal of Mathematics and Mathematical Sciences, 2012, Article ID: 129132.
- Diouf, I. (2007) Méthode de Dandelin-Graeffe et Méthode de Baker. Thèses de Doctorat, Université Louis Pasteur de Strasbourg, Strasbourg.
- Jacobson, N. (1985) Basic Algebra I. Fremann, New York.