Bisection method
The method of finding a root in mathematics, based on repeated division of a segment in half and the subsequent selection of a subinterval in which the root is thought to be located.
In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values, then selecting the subinterval in which the function changes sign, which therefore must contain a root.
Nº Q866300 ★★★
Rare · History
Bisection method
The method of finding a root in mathematics, based on repeated division of a segment in half and the subsequent selection of a subinterval in which the root is thought to be located.
In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values, then selecting the subinterval in which the function changes sign, which therefore must contain a root.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values, then selecting the subinterval in which the function changes sign, which therefore must contain a root. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods. The method is also called the interval halving method, the binary search method, or the dichotomy method. For polynomials, more elaborate methods exist for testing the existence of a root in an interval (Descartes' rule of signs, Sturm's theorem, Budan's theorem). They allow extending the bisection method into efficient algorithms for finding all real roots of a polynomial; see Real-root isolation.
Text: Wikipédia, CC BY-SA 4.0. · Image: Bisection_method.svg: Tokuchan derivative work: Tokuchan (ta... (CC BY-SA 3.0) ·
Related cards
-
B
Brent's method
Root-finding algorithm
Nº Q905988 ★
Not listed
-
Angle bisector theorem
Two segments that divide a triangle
Nº Q925854 ★★
Not listed
-
Newton's method
Algorithm for finding a zero of a function
Nº Q374195 ★★★
Not listed
-
Method of complements
Method of subtraction
Nº Q4741052 ★
Not listed
-
Midpoint theorem (triangle)
Geometric theorem involving midpoints on a triangle
Nº Q3527240 ★
Not listed
-
D
Digital root
Repeated digital sum
Nº Q2532474 ★★
Not listed