computer science

Wilf's global bisection algorithm

Wilf's global bisection algorithm is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Wilf's global bisection algorithm rather than just read about it. In short: 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.

Key takeaways

Wilf's global bisection algorithm belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Wilf's global bisection algorithm to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Wilf's global bisection algorithm from memory before moving on to harder problems.

Reference excerpt

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. For each quarter, the image of the boundary is a curve in the complex plane. The argument principle is then applied to this path to find its winding number about the origin. Given that the polynomial is analytic within each of these quarters, a nonzero winding number N (always an integer) identifies N zeros of the polynomial inside the quarter in question, each zero counted as many times as its multiplicity. Analogously with the bisection method, the algorithm is then applied recursively to any quarter whose boundary has nonzero winding number to further refine the estimates of the zeros. The recursion is repeated until the zero-containing rectangles are either small enough that their centres give sufficiently accurate zero estimates or until, owing to precision loss, it is not possible to continue.

See also Lehmer–Schur algorithm – similar method which uses circles instead of rectangles

References Herbert S. Wilf (July 1978), "A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane", Journal of the ACM, 25 (3): 415–420, doi:10.1145/322077.322084 Glenn R. Luecke; James D. Francis (July 1990), "Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials", Journal of Computational Mathematics, 8 (3): 202–211, JSTOR 43692481

Worked examples

Example 1 — a first encounter with Wilf's global bisection algorithm

Start with the simplest possible case. Write down what Wilf's global bisection algorithm claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Wilf's global bisection algorithm before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Wilf's global bisection algorithm ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Wilf's global bisection algorithm

In research: Wilf's global bisection algorithm appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Wilf's global bisection algorithm in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Wilf's global bisection algorithm is common in secondary-school and first-year university syllabi. It links to neighbouring topics Root-finding algorithms, so understanding it makes those chapters shorter.
In everyday life: Look for Wilf's global bisection algorithm outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Wilf's global bisection algorithm in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Wilf's global bisection algorithm means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Wilf's global bisection algorithm out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Wilf's global bisection algorithm in simple terms?

Why does Wilf's global bisection algorithm matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Wilf's global bisection algorithm?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Wilf's global bisection algorithm.