Wilf's global bisection algorithm

Wilf's global bisection algorithm is a root-finding algorithm extending the idea of enclosing roots, as in the one-dimensional bisection method, to find the roots of a polynomial inside any rectangular region in the complex plane. The rectangle in question is quadrisected into four congruent quarter rectangles.