Abstract
A family of multi-point iterative methods for solving nonlinear equations were described in Cordero and Torregrosa (2008) [4], and a general error analysis was given, always for a simple root. Here we study the order of convergence of such methods when we have multiple roots. We prove that the order of convergence goes down to 1 but, when the multiplicity n is known, it may be raised to 2 by using different types of correction. For n unknown, we show that some methods of this family converge faster than the classical Newton’s method. In addition, we provide various numerical tests which confirm or improve on theoretical results and allow us to compare some methods of the aforementioned family.
Sign-in/Register to access full text options 
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.
