The Newton-Raphson method is an iterative numerical method for finding successively better approximations to the roots (or zeroes) of a real-valued function. It is based on approximating the function by its tangent line at a given point. The convergence of the Newton-Raphson method is quadratic, meaning that the number of correct decimal places roughly doubles with each iteration, provided the initial guess is sufficiently close to the root. However, it requires the derivative of the function to be calculated, and it might fail if $f'(x_n) = 0$ at any iteration.