A Quasi-shrinking rectangle algorithm for complex zeros of a function

Presented here is a quasi-shrinking rectangle algorithm that computes a complex zero of a polynomial or transcendental function. This method has been implemented using several quasi-random number sequences and the results of several test examples are presented. The performance of this algorithm is based on a ranked comparison of relative error and time complexity versus several pseudo-random number sequences.