bisection algorithm


Also found in: Wikipedia.

bisection algorithm

[′bī‚sek·shən ′al·gə‚rith·əm]
(mathematics)
A procedure for determining the root of a function to any desired accuracy by repeatedly dividing a test interval in half and then determining in which half the value of the function changes sign.
References in periodicals archive ?
10) requires one multiplication less for the semiseparable case, and this is why the bisection algorithm works 10% faster than for quasiseparable matrices.
The bisection algorithm of Gu [8] keeps only an upper bound on the distance to uncontrollability.