Some Real-Life Applications of a Newly Designed Algorithm for Nonlinear Equations and Its Dynamics via Computer Tools

In this article, we design a novel fourth-order and derivative free root-finding algorithm. We construct this algorithm by applying the finite difference scheme on the well-known Ostrowski’s method. The convergence analysis shows that the newly designed algorithm possesses fourth-order convergence. To demonstrate the applicability of the designed algorithm, we consider five real-life engineering problems in the form of nonlinear scalar functions and then solve them via computer tools. The numerical results show that the new algorithm outperforms the other fourth-order comparable algorithms in the literature in terms of performance, applicability, and efficiency. Finally, we present the dynamics of the designed algorithm via computer tools by examining certain complex polynomials that depict the convergence and other graphical features of the designed algorithm.

On the Ostrowski Method for Solving Equations

In this paper, we revisited the Ostrowski's method for solving Banach space valued equations. We developed a technique to determine a subset of the original convergence domain and using this new Lipschitz constants derived. These constants are at least as tight as the earlier ones leading to a finer convergence analysis in both the semi-local and the local convergence case. These techniques are very general, so they can be used to extend the applicability of other methods without additional hypotheses. Numerical experiments complete this study.

An Optimal Derivative-Free Ostrowski’s Scheme for Multiple Roots of Nonlinear Equations

Finding higher-order optimal derivative-free methods for multiple roots (m≥2) of nonlinear expressions is one of the most fascinating and difficult problems in the area of numerical analysis and Computational mathematics. In this study, we introduce a new fourth order optimal family of Ostrowski’s method without derivatives for multiple roots of nonlinear equations. Initially the convergence analysis is performed for particular values of multiple roots—afterwards it concludes in general form. Moreover, the applicability and comparison demonstrated on three real life problems (e.g., Continuous stirred tank reactor (CSTR), Plank’s radiation and Van der Waals equation of state) and two standard academic examples that contain the clustering of roots and higher-order multiplicity (m=100) problems, with existing methods. Finally, we observe from the computational results that our methods consume the lowest CPU timing as compared to the existing ones. This illustrates the theoretical outcomes to a great extent of this study.

A 4th-Order Optimal Extension of Ostrowski’s Method for Multiple Zeros of Univariate Nonlinear Functions

We present a new optimal class of Ostrowski’s method for obtaining multiple zeros of univariate nonlinear functions. Several researchers tried to construct an optimal family of Ostrowski’s method for multiple zeros, but they did not have success in this direction. The new strategy adopts a weight function approach. The design structure of new families of Ostrowski’s technique is simpler than the existing classical families of the same order for multiple zeros. The classical Ostrowski’s method of fourth-order can obtain a particular form for the simple root. Their efficiency is checked on a good number of relevant numerical examples. These results demonstrate the performance of our methods. We find that the new methods are just as competent as other existing robust techniques available in the literature.

Geometric Construction of Eighth-Order Optimal Families of Ostrowski’s Method

Based on well-known fourth-order Ostrowski’s method, we proposed many new interesting optimal families of eighth-order multipoint methods without memory for obtaining simple roots. Its geometric construction consists in approximatingfn′atznin such a way that its average with the known tangent slopesfn′atxnandynis the same as the known weighted average of secant slopes and then we apply weight function approach. The adaptation of this strategy increases the convergence order of Ostrowski's method from four to eight and its efficiency index from 1.587 to 1.682. Finally, a number of numerical examples are also proposed to illustrate their accuracy by comparing them with the new existing optimal eighth-order methods available in the literature. It is found that they are very useful in high precision computations. Further, it is also noted that larger basins of attraction belong to our methods although the other methods are slow and have darker basins while some of the methods are too sensitive upon the choice of the initial value.

A New Optimal Eighth-Order Ostrowski-Type Family of Iterative Methods for Solving Nonlinear Equations

Based on Ostrowski's method, a new family of eighth-order iterative methods for solving nonlinear equations by using weight function methods is presented. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore, this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on n evaluations could achieve optimal convergence order 2n−1. Thus, we provide a new class which agrees with the conjecture of Kung-Traub for n=4. Numerical comparisons are made to show the performance of the presented methods.

New Highly Efficient Families of Higher-Order Methods for Simple Roots, Permittingf′(xn)=0

Construction of higher-order optimal and globally convergent methods for computing simple roots of nonlinear equations is an earliest and challenging problem in numerical analysis. Therefore, the aim of this paper is to present optimal and globally convergent families of King's method and Ostrowski's method having biquadratic and eight-order convergence, respectively, permittingf′(x)=0in the vicinity of the required root. Fourth-order King's family and Ostrowski's method can be seen as special cases of our proposed scheme. All the methods considered here are found to be more effective to the similar robust methods available in the literature. In their dynamical study, it has been observed that the proposed methods have equal or better stability and robustness as compared to the other methods.