Module 10 Summary
Thomas J. Kennedy
Contents:
1 Objectives
Having completed this module students are now prepared to:
- Discuss the requirements for each of the Bisection method, False Position (Regula False) method, Secant method, and Newton’s method.
- Manipulate provided pseudocode and refine it into a form suitable for implementation in a selected language (e.g., C, C++, Python 3, or Rust).
- Identify the considerations inherent in converting pseudocode (theory) into usable code (application)–with particular emphasis on the impact of finite precition.
2 Questions to Consider
- Why can pseudocode not be immediately translated into a language such as C++, Java, Python or Rust?
- What are invariants?
- Why do multiple non-linear solvers exist?
- Under what conditions does each method find a solution (i.e., zero)?
- Under what conditions does each method not find a solution (i.e., zero)?