Bisection method

From Calculus
Revision as of 00:15, 24 April 2014 by Vipul (talk | contribs) (Created page with "{{root-finding algorithm}} ==Definition== The '''bisection method''', also called the '''interval halving method''', '''binary search method''', and '''dichotomy method''',...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This article is about a root-finding algorithm. See all root-finding algorithms

Definition

The bisection method, also called the interval halving method, binary search method, and dichotomy method, is a root-finding algorithm.