A Class of Algorithms for Zeros of Polynomials

Authors

  • Stephen Ehidiamhen Uwamusi Department of Mathematics, Faculty of Science, University of Benin, Edo State, Nigeria

Keywords:

: polynomial zeros, Jarratt’s asymptotic error constant, Taylor series, Laguerre iterative method, Givens orthogonal matrix transformation

Abstract

A class of polytype algorithms for the determination of zeros of polynomial equation of single variable was constructed from Jarratt’s asymptotic error constant using the well-known Chevbyshev’s comparison series. The method was synthesized from the Taylor series iterative method. The climax of the findings was that the proposed formula can effectively model the determination of zeros of polynomial equations of the type often encountered in the Givens orthogonal matrix transformation process

Downloads

Published

2005-06-27

How to Cite

Uwamusi, S. E. (2005). A Class of Algorithms for Zeros of Polynomials. Biological Sciences - PJSIR, 48(3), 149–153. Retrieved from https://v2.pjsir.org/index.php/biological-sciences/article/view/1365

Issue

Vol. 48 No. 3 (2005): Pakistan Journal of Scientific and Industrial Research

Section

Articles