Prove that rate of convergence of newton raphson method is quadratic.
Answers
Answered by
0
Answer:
4
I've googled this and I've seen different types of proofs but they all use notations that I don't understand.
But first of all, I need to understand what quadratic convergence means, I read that it has to do with the speed of an algorithm. Is this correct?
Ok, so I know that this is the Newton-Raphson method:
xn+1=xn−f(xn)f′(xn)
How do I prove that it converges?
Thanks.
Similar questions