Abstract
In this paper a new cubic order root finding method is introduced. The algorithm can be used to find a simple root in an interval I of f(x)=0 where the function is convex. The method is a hybrid procedure that combines Newton's quadratic root finding method with a superlinear method. The new procedure requires only one first derivative evaluation per application of the method Newton's cubic root finding method is also described for comparison purposes. It requires the evaluation of the function and its first and second derivatives at each iteration. Another cubic method that combines a Steffensen-type method with the secant method will be discussed as well along with a modified version of this procedure. A table of numerical results is presented to compare the methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
