Evaluation of largest or smallest zero of a polynomial

The theory of an algorithm is presented for the evaluation of the largest or the smallest zero of an algebraic polynomial when no prior knowledge of an approximate location of the zero is available. The theory is developed from a partial-fraction expansion, and yields, as one special case, the classical Bernoulli scheme.