Marouane's Method - An Improvement to the Secant Method

Matlab code for the Marouane's method, which a modified secant method which uses secant lines from 2 circles in each iteration

This study presents an improvement to the secant method by reconstruction,in numerical analysis,the secant method is a root finding algorithm that uses a succession of roots of secant lines to better approximate a root of function F.secant method which its convergence is superlinear is used in combination with bissection and inverse quadratic interpolation in Bren't and Zhang' method wich are one of the most powerful root finding algorithms.the new method presented in this study presents so much advantages in root finding algorithms for non-linear equations,compared to the secant method,this new method uses secant lines from 2 circles in each iteration,it the requires only one initial guess and its convergence is quadratic,this new method could replace the secant method in Brent's and Zhang's method to make the algorithm more quick and more efficient,some experimental tests presented in this study compares the performances of this new method to the secant method.