Bisection algorithm | Article about bisection algorithm by The Free Dictionary
bisection algorithm[′bī‚sek·shən ′al·gə‚rith·əm]
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
Again, the solution to the problem (17a)-(17c) can be obtained by using a standard bisection algorithm
k)]; here, one step of a bisection algorithm
is used; if [sup.
For d = 2, the bisection algorithm
from  is used.
Use bisection algorithm
to determine corrected maximal [[?
10) requires one multiplication less for the semiseparable case, and this is why the bisection algorithm
works 10% faster than for quasiseparable matrices.
gt; 0, respectively is the key problem of the bisection algorithm
The bisection algorithm
of Gu  keeps only an upper bound on the distance to uncontrollability.
This paper systematically compares such generalized bisection algorithms
to themselves, to continuation methods, and to hybrid steepest descent/quasi-Newton methods.
- Biruni, Al-
- Birze, Miervaldis
- Birzhevye Vedomosti
- Birznieks-Upitis, Ernests
- Biscayne Bay
- Biscayne National Park
- Bischoff, Elmer
- Bischoff, Theodor Ludwig
- Biscoe, John
- biscuit cutter
- biscuit root
- bisection algorithm
- biserial correlation coefficient
- Bishara al- Khuri
- Bishop Auckland
- Bishop of Digne
- Bishop, Errett
- Bishop, Isabel
- Bishop, Isabella Lucy
- Bishop, John Michael
- Bishop, John Peale
- Bishop, Sir Henry Rowley
- Bishop, the
- Bishop, William