Authors: Marouane Rhafli
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.
Comments: 8 Pages.
Download: PDF
[v1] 2014-05-02 10:29:14
Unique-IP document downloads: 1087 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.