====== Differences ====== This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
gibson:teaching:fall-2016:math753:bisection [2016/10/06 09:15] gibson |
gibson:teaching:fall-2016:math753:bisection [2016/10/06 09:17] (current) gibson |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Math 753/853 Bisection ====== | ====== Math 753/853 Bisection ====== | ||
- | A few online resources for the bisection method. | + | The bisection method is an algorithm for finding roots of a nonlinear equation $f(x) = 0$, where $f$ is continuous and $x$ is one-dimensional. Here are a few excellent online resources for the bisection method. |
* [[https://en.wikipedia.org/wiki/Bisection_method|Bisection method]], Wikipedia. Good explanation, provides pseudo-code, some great concrete examples, and error analysis. | * [[https://en.wikipedia.org/wiki/Bisection_method|Bisection method]], Wikipedia. Good explanation, provides pseudo-code, some great concrete examples, and error analysis. | ||
* [[http://mathworld.wolfram.com/Bisection.html|Bisection]] Wolfram Alpha. Terse, gives error analysis. | * [[http://mathworld.wolfram.com/Bisection.html|Bisection]] Wolfram Alpha. Terse, gives error analysis. | ||
* [[http://www.sosmath.com/calculus/limcon/limcon07/limcon07.html| Bisection method]], sosmath.com. This one has a nice animation. | * [[http://www.sosmath.com/calculus/limcon/limcon07/limcon07.html| Bisection method]], sosmath.com. This one has a nice animation. |