A Variant of Chebyshev’s Method with 3αth-Order of Convergence by Using Fractional Derivatives

In this manuscript, we propose several iterative methods for solving nonlinear equations whose common origin is the classical Chebyshev’s method, using fractional derivatives in their iterative expressions. Due to the symmetric duality of left and right derivatives, we work with right-hand side Caputo and Riemann–Liouville fractional derivatives. To increase as much as possible the order of convergence of the iterative scheme, some improvements are made, resulting in one of them being of 3 α -th order. Some numerical examples are provided, along with an study of the dependence on initial estimations on several test problems. This results in a robust performance for values of α close to one and almost any initial estimation.

On a Reduced Cost Higher Order Traub-Steffensen-Like Method for Nonlinear Systems

We propose a derivative-free iterative method with fifth order of convergence for solving systems of nonlinear equations. The scheme is composed of three steps, of which the first two steps are that of third order Traub-Steffensen-type method and the last is derivative-free modification of Chebyshev’s method. Computational efficiency is examined and comparison between the efficiencies of presented technique with existing techniques is performed. It is proved that, in general, the new method is more efficient. Numerical problems, including those resulting from practical problems viz. integral equations and boundary value problems, are considered to compare the performance of the proposed method with existing methods. Calculation of computational order of convergence shows that the order of convergence of the new method is preserved in all the numerical examples, which is not so in the case of some of the existing higher order methods. Moreover, the numerical results, including the CPU-time consumed in the execution of program, confirm the accurate and efficient behavior of the new technique.

Comparison of Halley-Chebyshev Method with Several Nonlinear equation Solving Methods Methods

In this paper, we present one of the most important numerical analysis problems that we find in the roots of the nonlinear equation. In numerical analysis and numerical computing, there are many methods that we can approximate the roots of this equation. We present here several different methods, such as Halley's method, Chebyshev's method, Newton's method, and other new methods presented in papers and journals, and compare them. In the end, we get a good and attractive result.