Design and analysis of a faster King-Werner-type derivative free method

We introduce a new faster King-Werner-type derivative-free method for solving nonlinear equations. The local as well as semi-local convergence analysis is presented under weak center Lipschitz and Lipschitz conditions. The convergence order as well as the convergence radii are also provided. The radii are compared to the corresponding ones from similar methods. Numerical examples further validate the theoretical results.

AN ITERATIVE, BRACKETING & DERIVATIVE-FREE METHOD FOR NUMERICAL SOLUTION OF NON-LINEAR EQUATIONS USING STIRLING INTERPOLATION TECHNIQUE

In this article, an iterative, bracketing and derivative-free method have been proposed with the second-order of convergence for the solution of non-linear equations. The proposed method derives from the Stirling interpolation technique, Stirling interpolation technique is the process of using points with known values or sample points to estimate values at unknown points or polynomials. All types of problems (taken from literature) have been tested by the proposed method and compared with existing methods (regula falsi method, secant method and newton raphson method) and it’s noted that the proposed method is more rapidly converges as compared to all other existing methods. All problems were solved by using MATLAB Version: 8.3.0.532 (R2014a) on my personal computer with specification Intel(R) Core (TM) i3-4010U CPU @ 1.70GHz with RAM 4.00GB and Operating System: Microsoft Windows 10 Enterprise Version 10.0, 64-Bit Server, x64-based processor.

An efficient class of fourth-order derivative-free method for multiple-roots

Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.

A NEW SECOND ORDER DERIVATIVE FREE METHOD FOR NUMERICAL SOLUTION OF NON-LINEAR ALGEBRAIC AND TRANSCENDENTAL EQUATIONS USING INTERPOLATION TECHNIQUE

Its most important task in numerical analysis to find roots of nonlinear equations, several methods already exist in literature to find roots but in this paper, we introduce a unique idea by using the interpolation technique. The proposed method derived from the newton backward interpolation technique and the convergence of the proposed method is quadratic, all types of problems (taken from literature) have been solved by this method and compared their results with another existing method (bisection method (BM), regula falsi method (RFM), secant method (SM) and newton raphson method (NRM)) it’s observed that the proposed method have fast convergence. MATLAB/C++ software is used to solve problems by different methods.

A New Derivative-Free Method to Solve Nonlinear Equations

A new high-order derivative-free method for the solution of a nonlinear equation is developed. The novelty is the use of Traub’s method as a first step. The order is proven and demonstrated. It is also shown that the method has much fewer divergent points and runs faster than an optimal eighth-order derivative-free method.