Root Finding in one Dimension

From Wikiversity

Jump to: navigation, search

This course is still very much in the rough!

Contents

[edit] Summary

This course belongs to the track Numerical Algorithms in the Department of Scientific Computing in the School of Computer Science.

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

[edit] Introduction

  • Why do we want to solve f(x)=0\,\;?
  • Why do we want to solve it numerically?
  • Formal definition of the problem.
  • Maybe a bit of history?

[edit] Binomial Search

  • Derivation
  • The Algorithm
  • Convergence

[edit] Secant Method

  • Derivation
  • The Algorithm
  • Convergence
  • Iterative form

[edit] Iterative Methods

  • x_{n+1} = F(x_n)\,\;
  • Convergence rates

[edit] Newton's Method

  • Derivation
  • The Algorithm
  • Convergence

[edit] Halley's Method

  • Derivation
  • The Algorithm
  • Convergence
  • Generalization
Retrieved from "http://en.wikiversity.org/wiki/Root_Finding_in_one_Dimension"
Personal tools