Root finding

Concepts

• Intermediate value theorem from Calculus 20 exercisesIf f is continuous on [a,b] and N lies between f(a) and f(b), there is some c∈(a,b) with f(c)=N.
• Bisection method 10 exercisesThe bisection method is an iterative algorithm that approximates a root of a continuous function f(x) on an interval [a, b] with…
• Fixed-point iteration 10 exercisesIterative method that approximates a solution of the equation x = g(x) by generating the sequence x_n+1 = g(x_n) from an initial…
• Secant method 10 exercisesThe secant method is an iterative procedure for approximating roots of a function f(x)=0 using two previous approximations, witho…
• Convergent sequence from Real analysis 10 exercisesA sequence (a_n) converges to a number L if, for every tolerance ε>0, there is an index N from which all terms are within distanc…