We start our overview of Numerical Analysis topics with root-finding in one variable, namely finding the roots of a given function \(f(x)\text{.}\) We first discuss how the accuracy of a numerical computation evaluating a root of \(f(x)\) using floating-point numbers is affected by \(f(x)\)'s conditioning (Section 3.1) and then we present three of the simplest and most important root-finding methods: the bisection method (Section 3.2), the Newton method (Section 3.4) and the secant method (Section 3.5). Since the last two methods are iterative, we also briefly introduce the concept of Functions Iterations (Section 3.3).
