Here, we suggest a high-order optimal variant/modification of Schröder’s method for obtaining the multiple zeros of nonlinear uni-variate functions. Based on quadratically convergent Schröder’s method, we derive the new family of fourth -order multi-point methods having optimal convergence order. Additionally, we discuss the theoretical convergence order and the properties of the new scheme. The main finding of the present work is that one can develop several new and some classical existing methods by adjusting one of the parameters. Numerical results are given to illustrate the execution of our multi-point methods. We observed that our schemes are equally competent to other existing methods.

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.

The novelty of this article lies in the fact that we extend the use of a multistep method for developing a sequence whose limit solves a Banach space-valued equation. We suggest the error estimates, local convergence, and semi-local convergence, a radius of convergence, the uniqueness of the required solution that can be computed under $\omega$-continuity, and conditions on the first derivative, which is on the method. But, earlier studies used high-order derivatives, even though those derivatives do not appear in the body structure of the proposed method. In addition to this, they did not propose computable estimates and semi-local convergence. We checked the applicability of our study to three real-life problems for semi-local convergence and two problems chosen for local convergence. Based on the obtained results, we conclude that our approach improves its applicability and makes it suitable for challenges in applied science.

Non-linear systems of equations play a fundamental role in various engineering and data science models, where accurate solutions are essential for both theoretical research and practical applications. However, solving such systems is highly challenging due to their inherent non-linearity and computational complexity. This study proposes a novel hybrid iterative method with fourth-order convergence. The foundation of the proposed scheme combines the Walrus Optimization Algorithm and a fourth-order iterative technique. The objective of this hybrid approach is to enhance global search capability, reduce the likelihood of convergence to local optima, accelerate convergence, and improve solution accuracy in solving non-linear problems. The effectiveness of the proposed method is checked on standard benchmark problems and two real-world case studies, hydrocarbon combustion and electronic circuit design, and one non-linear boundary value problem. In addition, a comparative analysis is conducted with several well-established optimization algorithms, based on the optimal solution, average fitness value, and convergence rate. Furthermore, the proposed scheme effectively addresses key limitations of traditional iterative techniques, such as sensitivity to initial point selection, divergence issues, and premature convergence. These findings demonstrate that the proposed hybrid method is a robust and efficient approach for solving non-linear problems.

Multistep methods typically use Taylor series to attain their convergence order, which necessitates the existence of derivatives not naturally present in the iterative functions. Other issues are the absence of a priori error estimates, information about the radius of convergence or the uniqueness of the solution. These restrictions impose constraints on the use of such methods, especially since these methods may converge. Consequently, local convergence analysis emerges as a more effective approach, as it relies on criteria involving only the operators of the methods. This expands the applicability of such methods, including in non-Euclidean space scenarios. Furthermore, this work uses majorizing sequences to address the more challenging semi-local convergence analysis, which was not explored in earlier research. We adopted generalized continuity constraints to control the derivatives and obtain sharper error estimates. The sufficient convergence criteria are demonstrated through examples.

The conventional approach of the local convergence analysis of an iterative method on ${\mathbb{R}}^m$, with m a natural number, depends on Taylor series expansion. This technique often requires the calculation of high-order derivatives. However, those derivatives may not be part of the proposed method(s). In this way, the method(s) can face several limitations, particularly the use of higher-order derivatives and a lack of information about a priori computable error bounds on the solution distance or uniqueness. In this paper, we address these drawbacks by conducting the local convergence analysis within the broader framework of a Banach space. We have selected an important family of high convergence order methods to demonstrate our technique as an example. However, due to its generality, our technique can be used on any other iterative method using inverses of linear operators along the same line. Our analysis not only extends in ${\mathbb{R}}^m$ spaces but also provides convergence conditions based on the operators used in the method, which offer the applicability of the method in a broader area. Additionally, we introduce a novel semilocal convergence analysis not presented before in such studies. Both forms of convergence analysis depend on the concept of generalized continuity and provide a deeper understanding of convergence properties. Our methodology not only enhances the applicability of the suggested method(s) but also provides suitability for applied science problems. The computational results also support the theoretical aspects.