Bilinear interpolation

Use the bisection method to find real roots

1 | ```
bisection(f, a, b, tol = 0.001, m = 100)
``` |

`f` |
function to locate a root for |

`a` |
the a bound of the search region |

`b` |
the b bound of the search region |

`tol` |
the error tolerance |

`m` |
the maximum number of iterations |

The bisection method functions by repeatedly halving the interval
between `a`

and `b`

and will return when the
interval between them is less than `tol`

, the error tolerance.
However, this implementation also stops if after `m`

iterations.

the real root found

Other optimz: `goldsect`

,
`gradient`

, `hillclimbing`

,
`newton`

, `sa`

,
`secant`

1 2 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.