View source for Root Finding in one Dimension

{{mathematics}}

{{TOCright}}

==Summary==
This course belongs to the track [[Numerical algorithms|Numerical Algorithms]] in the [[Scientific computing|Department of Scientific Computing]] in the [[School:Computer Science|School of Computer Science]].

In this course, students will learn how to solve problems of the type <math>f(x)=0\,\;</math> numerically. Convergence rates, termination criteria and implementation details are discussed.

==Introduction==
* ''Why do we want to solve <math>f(x)=0\,\;</math>?''
* ''Why do we want to solve it numerically?''
* ''Formal definition of the problem.''
* ''Maybe a bit of history?''

==Binomial Search==
* ''Derivation''
* ''The Algorithm''
* ''Convergence''

==Secant Method==
* ''Derivation''
* ''The Algorithm''
* ''Convergence''
* ''Iterative form''

==Iterative Methods==
* <math>x_{n+1} = F(x_n)\,\;</math>
* ''Convergence rates''

==Newton's Method==
* ''Derivation''
* ''The Algorithm''
* ''Convergence''

==Halley's Method==
* ''Derivation''
* ''The Algorithm''
* ''Convergence''
* ''Generalization''

[[Category:Scientific computing]]