Root-finding via repeated interval halving on a sign change, exploiting the intermediate value theorem. Linear convergence (one bit per iteration); unconditionally robust.
Root-finding via repeated interval halving on a sign change, exploiting the intermediate value theorem. Linear convergence (one bit per iteration); unconditionally robust.