prove that the order of convergence of the secant method is approximately 1.618 and asymptotic error constant is $$K= C^{\frac{1}{\alpha}}=(\frac{F"(P_n)}{2F'(P)})^{\alpha -1}$$.
The proof is as follows:- *The secant method is the root finding scheme based on the recurrence relation
$P_{n+1} = P_n - F(P_n) \frac{P_n - P_(n-1)}{F(P_n)- F(P_(n-1))}$
Now subtracting P from both sides
$P_{n+1} - P = P_n - P- F(P_n) \frac{P_n - P_(n-1)}{F(P_n)- F(P_(n-1))}$
and performing remaining steps
that are identical to derive the error evolution equation for false position the end result is
$P_{n+1} - P \approx (P_n -P)(P_{n-1} -P) \frac{F"(P)}{2F'(P)+F"(P)(P_n +P_{n-1}-2P)}$
I need those "steps identical to derive error evolution equation for the method of false position".
Textbook: Brain Bradie - A friendly introduction to numerical analysis.
Thanks in advance.
*