Abstract
In this paper we show a strategy to devise third order iterative methods based on classic second order ones such as Steffensen’s and Kurchatov’s. These methods do not require the evaluation of derivatives, as opposed to Newton or other well known third order methods such as Halley or Chebyshev. Some theoretical results on convergence will be stated, and illustrated through examples. These methods are useful when the functions are not regular or the evaluation of their derivatives is costly. Furthermore, special features as stability, laterality (asymmetry) and other properties can be addressed by choosing adequate nodes in the design of 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.
