Linked from

The 20 pages that link to Bisection method, each with the reason it gives.

• Intermediate value theoremRelated: The theorem guarantees a root remains bracketed after every halving step.

• Binary searchRelated: It applies the same interval-halving logic to locate a zero of a function.

• Polynomial equationRelated: It provides reliable numerical solutions when a continuous polynomial changes sign across an interval.

• Monotonic functionRelated: Monotonicity can ensure a bracket contains at most one root.

• Root-finding algorithmRelated: It guarantees convergence for a continuous function on a sign-changing interval.

• Monotone sequenceRelated: Its interval endpoints form monotone sequences converging to a root.

• Zero of a functionRelated: It encloses a zero reliably when continuity and a sign change are known.

• Descartes' rule of signsRelated: A sign change establishes an interval containing a root, which can then be approximated by bisection.

• Monotone convergence theoremRelated: The method generates nested intervals whose endpoints form bounded monotone sequences.

• Cube rootRelated: It finds a cube root reliably when values can be bracketed on either side.

• Bolzano's theoremRelated: The theorem guarantees that every interval retained by bisection still contains a root.

• Budan's theoremRelated: A Budan bound can assess whether subdivided intervals may contain polynomial roots.

• Square root of 2Related: It can approximate the positive solution of x² − 2 = 0 with guaranteed bounds.