Higher-order root-finding algorithms and their basins of attraction

14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we proposed and analyzed three new root-finding algorithms for solving nonlinear equations in one variable. We derive these algorithms with the help of variational iteration technique. We discuss the convergence criteria of these newly developed algorithms. The dominance of the proposed algorithms is illustrated by solving several test examples and comparing them with other well-known existing iterative methods in the literature. In the end, we present the basins of attraction using some complex polynomials of different degrees to observe the fractal behavior and dynamical aspects of the proposed algorithms.

Cite

CITATION STYLE

APA

Naseem, A., Rehman, M. A., & Abdeljawad, T. (2020). Higher-order root-finding algorithms and their basins of attraction. Journal of Mathematics, 2020. https://doi.org/10.1155/2020/5070363

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free