A family of iteration formulas for the determination of the zeros of a polynomial. | [Pakistan Journal of Scientific and Industrial Research • 2004]

Author(s):

1. Stephen Ehidiamhen Uwamusi: Department of Mathematics, Faculty of Science, University of Benin, Edo State Nigeria

Abstract:

A class of globally monotonically convergent iterative methods for the determination of zeros of a polynomial is presented. The proposed method uses the well-known Newton’s second order method as a basic ingredient to generate this class of methods following the approach of Petkovic and Trickovie as supported by Cauchy Schwartz inequality from which come in hand three methods of fourth order. The obtained methods can be used to provide tight inclusion conditioning bounds separating the sought zeros. This may always provide good numerical approximations within the theoretical conditioning bounds. It is found that one of the fourth order methods so obtained competes most favourably with any known methods for finding zeros of a polynomial.

Page(s): 9-12

DOI: DOI not available

Published: Journal: Pakistan Journal of Scientific and Industrial Research, Volume: 47, Issue: 1, Year: 2004

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views