Abstract
Recently, self-accelerating technique has been widely used to improve the convergence order of iterative methods for simple roots. However, it has not been applied in those for multiple ones, yet. In this paper, for the first time, this technique is used to construct higher-order multiple root finding iterations with memory. It is shown that the R-order of the considering iterations are improved from 2 to 1+2≈2.4142, 4 to 5+2≈4.2361 and (5+17)/2≈4.5616, respectively. Comparison of the methods with and without self-accelerating parameters is given on numerical tests, which supports our theoretical analysis very well.
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.
