Root Finding in one Dimension

From Wikiversity
Jump to navigation Jump to search
Nuvola apps edu mathematics-p.svg Subject classification: this is a mathematics resource.

Summary[edit | edit source]

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 numerically. Convergence rates, termination criteria and implementation details are discussed.

Introduction[edit | edit source]

  • Why do we want to solve ?
  • Why do we want to solve it numerically?
  • Formal definition of the problem.
  • Maybe a bit of history?

Binomial Search[edit | edit source]

  • Derivation
  • The Algorithm
  • Convergence

Secant Method[edit | edit source]

  • Derivation
  • The Algorithm
  • Convergence
  • Iterative form

Iterative Methods[edit | edit source]

  • Convergence rates

Newton's Method[edit | edit source]

  • Derivation
  • The Algorithm
  • Convergence

Halley's Method[edit | edit source]

  • Derivation
  • The Algorithm
  • Convergence
  • Generalization