Combination methods for numerical inclusion of the zeros of a polynomial

Abstract

In the numerical inclusion and isolation of the zeros of a polynomial in an interval on the plane, hybrid combination methods have been found quite useful for their virtue of easy construction and reduced computational cost with respect to interval arithmetic operations, while still providing restrictive inclusion for the respective zeros simultaneously. In what now follows, consider a collection of combination methods arising from efficient enhancement of a class of basic simultaneous numerical inclusion methods under two different updating procedures of the generated iterates. The accuracy of the methods will be illustrated by insightful numerical experiments.



Journal of the Nigerian Association of Mathematical Physics Vol. 8 2004: pp. 105-120