This document describes an iterative numerical method called the secant method. It shows 12 iterations of finding the root of a function, starting with an initial guess of 2 and refining the next guess based on the previous two function values until convergence is reached at the 10th iteration with a value of 0.56714329 and an error of 0.
This document describes an iterative numerical method called the secant method. It shows 12 iterations of finding the root of a function, starting with an initial guess of 2 and refining the next guess based on the previous two function values until convergence is reached at the 10th iteration with a value of 0.56714329 and an error of 0.
This document describes an iterative numerical method called the secant method. It shows 12 iterations of finding the root of a function, starting with an initial guess of 2 and refining the next guess based on the previous two function values until convergence is reached at the 10th iteration with a value of 0.56714329 and an error of 0.