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 ?

Again, the solution to the problem (17a)-(17c) can be obtained by using a standard bisection algorithm.

Optimization for Relay-Assisted Broadband Power Line Communication Systems with QoS Requirements Under Time-varying Channel Conditions

k)]; here, one step of a bisection algorithm is used; if [sup.

Comparison of the Characteristics of Solid Type and Annular Type Nuclear Fuels Using Thermoelastic-Plastic-Creep FEM

For d = 2, the bisection algorithm from [2] is used.

Quasi-optimal convergence rates for adaptive boundary element methods with data approximation. Part II: hyper-singular integral equation

Use bisection algorithm to determine corrected maximal [[?

Optimal design of a delayed feedback

10) requires one multiplication less for the semiseparable case, and this is why the bisection algorithm works 10% faster than for quasiseparable matrices.

The fast bisection eigenvalue method for Hermitian order one quasiseparable matrices and computations of norms

gt; 0, respectively is the key problem of the bisection algorithm.

Joint beamforming and power allocation for multiple primary users and secondary users in cognitive MIMO systems via game theory

The bisection algorithm of Gu [8] keeps only an upper bound on the distance to uncontrollability.

On computing stabilizability radii of linear time-invariant continuous systems

This paper systematically compares such generalized bisection algorithms to themselves, to continuation methods, and to hybrid steepest descent/quasi-Newton methods.