Search Results (27)

This study introduces a novel, iterative algorithm that achieves fourth-order convergence for solving nonlinear equations. Satisfying the Kung–Traub conjecture, the proposed technique achieves an optimal order of four with an efficiency index $\left(I\right)$ of $1.587$, requiring three function evaluations. An analysis of convergence is presented to show the optimal fourth-order convergence. To verify the theoretical results, in-depth numerical comparisons are presented for both real and complex domains. The proposed algorithm is specifically examined on a variety of polynomial functions, and it is shown by the efficient and accurate results that it outperforms many existing algorithms in terms of speed and accuracy. The study not only explores the proposed method’s convergence properties, computational efficiency, and stability but also introduces a novel perspective by considering the count of black points as an indicator of a method’s divergence. By analyzing the mean number of iterations necessary for methods to converge within a cycle and measuring CPU time in seconds, this research provides a holistic assessment of both the efficiency and speed of iterative methods. Notably, the analysis of basins of attraction illustrates that our proposed method has larger sets of initial points that yield convergence. Full article

In this manuscript, we introduce a novel parametric family of multistep iterative methods designed to solve nonlinear equations. This family is derived from a damped Newton’s scheme but includes an additional Newton step with a weight function and a “frozen” derivative, that is, the same derivative than in the previous step. Initially, we develop a quad-parametric class with a first-order convergence rate. Subsequently, by restricting one of its parameters, we accelerate the convergence to achieve a third-order uni-parametric family. We thoroughly investigate the convergence properties of this final class of iterative methods, assess its stability through dynamical tools, and evaluate its performance on a set of test problems. We conclude that there exists one optimal fourth-order member of this class, in the sense of Kung–Traub’s conjecture. Our analysis includes stability surfaces and dynamical planes, revealing the intricate nature of this family. Notably, our exploration of stability surfaces enables the identification of specific family members suitable for scalar functions with a challenging convergence behavior, as they may exhibit periodical orbits and fixed points with attracting behavior in their corresponding dynamical planes. Furthermore, our dynamical study finds members of the family of iterative methods with exceptional stability. This property allows us to converge to the solution of practical problem-solving applications even from initial estimations very far from the solution. We confirm our findings with various numerical tests, demonstrating the efficiency and reliability of the presented family of iterative methods. Full article

This paper introduces an iterative method with a remarkable level of accuracy, namely fourth-order convergence. The method is specifically tailored to meet the optimality condition under the Kung–Traub conjecture by linear combination. This method, with an efficiency index of approximately $1.5874$, employs a blend of localized and semi-localized analysis to improve both efficiency and convergence. This study aims to investigate semi-local convergence, dynamical analysis to assess stability and convergence rate, and the use of the proposed solver for systems of nonlinear equations. The results underscore the potential of the proposed method for several applications in polynomiography and other areas of mathematical research. The improved performance of the proposed optimal method is demonstrated with mathematical models taken from many domains, such as physics, mechanics, chemistry, and combustion, to name a few. Full article

In this paper, we have constructed new families of derivative-free three- and four-parametric methods with and without memory for finding the roots of nonlinear equations. Error analysis verifies that the without-memory methods are optimal as per Kung–Traub’s conjecture, with orders of convergence of 4 and 8, respectively. To further enhance their convergence capabilities, the with-memory methods incorporate accelerating parameters, elevating their convergence orders to 7.5311 and 15.5156, respectively, without introducing extra function evaluations. As such, they exhibit exceptional efficiency indices of 1.9601 and 1.9847, respectively, nearing the maximum efficiency index of 2. The convergence domains are also analysed using the basins of attraction, which exhibit symmetrical patterns and shed light on the fascinating interplay between symmetry, dynamic behaviour, the number of diverging points, and efficient root-finding methods for nonlinear equations. Numerical experiments and comparison with existing methods are carried out on some nonlinear functions, including real-world chemical engineering problems, to demonstrate the effectiveness of the new proposed methods and confirm the theoretical results. Notably, our numerical experiments reveal that the proposed methods outperform their existing counterparts, offering superior precision in computation. Full article

In this paper, we construct variants of Bawazir’s iterative methods for solving nonlinear equations having simple roots. The proposed methods are two-step and three-step methods, with and without memory. The Newton method, weight function and divided differences are used to develop the optimal fourth- and eighth-order without-memory methods while the methods with memory are derivative-free and use two accelerating parameters to increase the order of convergence without any additional function evaluations. The methods without memory satisfy the Kung–Traub conjecture. The convergence properties of the proposed methods are thoroughly investigated using the main theorems that demonstrate the convergence order. We demonstrate the convergence speed of the introduced methods as compared with existing methods by applying the methods to various nonlinear functions and engineering problems. Numerical comparisons specify that the proposed methods are efficient and give tough competition to some well known existing methods. Full article

In this paper, an optimal higher-order iterative technique to approximate the multiple roots of a nonlinear equation has been presented. The proposed technique has special properties: a two-point method that does not involve any derivatives, has an optimal convergence of fourth-order, is cost-effective, is more stable, and has better numerical results. In addition to this, we adopt the weight function approach at both substeps (which provide us with a more general form of two-point methods). Firstly, the convergence order is studied for multiplicity $m=2,3$ by Taylor’s series expansion and then general convergence for $m\ge 4$ is proved. We have demonstrated the applicability of our methods to six numerical problems. Out of them: the first one is the well-known Van der Waals ideal gas problem, the second one is used to study the blood rheology model, the third one is chosen from the linear algebra (namely, eigenvalue), and the remaining three are academic problems. We concluded on the basis of obtained CPU timing, computational order of convergence, and absolute errors between two consecutive iterations for which our methods illustrate better results as compared to earlier studies. Full article

We suggest a new and cost-effective iterative scheme for nonlinear equations. The main features of the presented scheme are that it does not involve any derivative in the structure, achieves an optimal convergence of fourth-order factors, has more flexibility for obtaining new members, and is two-point, cost-effective, more stable and yields better numerical results. The derivation of our scheme is based on the weight function technique. The convergence order is studied in three main theorems. We have demonstrated the applicability of our methods on four numerical problems. Out of them, two are real-life cases, while the third one is a root clustering problem and the fourth one is an academic problem. The obtained numerical results illustrate preferable outcomes as compared to the existing ones in terms of absolute residual errors, CPU timing, approximated zeros and absolute error difference between two consecutive iterations. Full article

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots $(m\ge 2)$. In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods. Full article

In this manuscript, we introduce the higher-order optimal derivative-free family of Chebyshev–Halley’s iterative technique to solve the nonlinear equation having the multiple roots. The designed scheme makes use of the weight function and one parameter $\alpha$ to achieve the fourth-order of convergence. Initially, the convergence analysis is performed for particular values of multiple roots. Afterward, it concludes in general. Moreover, the effectiveness of the presented methods are certified on some applications of nonlinear equations and compared with the earlier derivative and derivative-free schemes. The obtained results depict better performance than the existing methods. Full article

In this paper, we have obtained three optimal order Newton’s like methods of order four, eight, and sixteen for solving nonlinear algebraic equations. The convergence analysis of all the optimal order methods is discussed separately. We have discussed the corresponding conjugacy maps for quadratic polynomials and also obtained the extraneous fixed points. We have considered several test functions to examine the convergence order and to explain the dynamics of our proposed methods. Theoretical results, numerical results, and fractal patterns are in support of the efficiency of the optimal order methods. Full article

In this study, we construct the one parameter optimal derivative-free iterative family to find the multiple roots of an algebraic nonlinear function. Many researchers developed the higher order iterative techniques by the use of the new function evaluation or the first-order or second-order derivative of functions to evaluate the multiple roots of a nonlinear equation. However, the evaluation of the derivative at each iteration is a cumbersome task. With this motivation, we design the second-order family without the utilization of the derivative of a function and without the evaluation of the new function. The proposed family is optimal as it satisfies the convergence order of Kung and Traub’s conjecture. Here, we use one parameter a for the construction of the scheme, and for $a=1$, the modified Traub method is its a special case. The order of convergence is analyzed by Taylor’s series expansion. Further, the efficiency of the suggested family is explored with some numerical tests. The obtained results are found to be more efficient than earlier schemes. Moreover, the basin of attraction of the proposed and earlier schemes is also analyzed. Full article

In the study of dynamics of physical systems an important role is played by symmetry principles. As an example in classical physics, symmetry plays a role in quantum physics, turbulence and similar theoretical models. We end up having to deal with an equation whose solution we desire to be in a closed form. But obtaining a solution in such form is achieved only in special cases. Hence, we resort to iterative schemes. There is where the novelty of our study lies, as well as our motivation for writing it. We have a very limited literature with eighth-order convergent iteration functions that can handle multiple zeros $m\ge 1$. Therefore, we suggest an eighth-order scheme for multiple zeros having optimal convergence along with fast convergence and uncomplicated structure. We develop an extensive convergence study in the main theorem that illustrates eighth-order convergence of our scheme. Finally, the applicability and comparison was illustrated on real life problems, e.g., Van der Waal’s equation of state, Chemical reactor with fractional conversion, continuous stirred reactor and multi-factor problems, etc., with existing schemes. These examples further show the superiority of our schemes over the earlier ones. Full article

There is no doubt that there is plethora of optimal fourth-order iterative approaches available to estimate the simple zeros of nonlinear functions. We can extend these method/methods for multiple zeros but the main issue is to preserve the same convergence order. Therefore, numerous optimal and non-optimal modifications have been introduced in the literature to preserve the order of convergence. Such count of methods that can estimate the multiple zeros are limited in the scientific literature. With this point, a new optimal fourth-order scheme is presented for multiple zeros with known multiplicity. The proposed scheme is based on the weight function strategy involving functions in ratio. Moreover, the scheme is optimal as it satisfies the hypothesis of Kung–Traub conjecture. An exhaustive study of the convergence is shown to determine the fourth order of the methods under certain conditions. To demonstrate the validity and appropriateness for the proposed family, several numerical experiments have been performed. The numerical comparison highlights the effectiveness of scheme in terms of accuracy, stability, and CPU time. Full article

Based on the Steffensen-type method, we develop fourth-, eighth-, and sixteenth-order algorithms for solving one-variable equations. The new methods are fourth-, eighth-, and sixteenth-order converging and require at each iteration three, four, and five function evaluations, respectively. Therefore, all these algorithms are optimal in the sense of Kung–Traub conjecture; the new schemes have an efficiency index of 1.587, 1.682, and 1.741, respectively. We have given convergence analyses of the proposed methods and also given comparisons with already established known schemes having the same convergence order, demonstrating the efficiency of the present techniques numerically. We also studied basins of attraction to demonstrate their dynamical behavior in the complex plane. Full article

This manuscript contains the development of a one-point family of iterative functions. The family has optimal convergence of a second-order according to the Kung-Traub conjecture. This family is used to approximate the multiple zeros of nonlinear equations, and is based on the procedure of weight functions. The convergence behavior is discussed by showing some essential conditions of the weight function. The well-known modified Newton method is a member of the proposed family for particular choices of the weight function. The dynamical nature of different members is presented by using a technique called the “basin of attraction”. Several practical problems are given to compare different methods of the presented family. Full article