Simultaneous Root Approximation: A High-Convergence Iterative Approach
Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

This paper introduces a novel and innovative iterative methodology that not only transforms arbitrary iterative schemes into an efficient framework but also redefines the process of simultaneous root approximation for polynomials and nonlinear equations. The proposed methods are distinguished by their exceptional convergence orders, achieving up to p+2 for polynomial equations and 2p for nonlinear equations, where p is the order of the base iterative scheme. In contrast to existing techniques, these methods incorporate advanced correction mechanisms, such as an arithmetic mean blending Newton's and Ehrlich-Aberth methods, to enhance stability and convergence performance. Comprehensive numerical experiments validate the robustness and efficiency of our approaches, with clear advantages in terms of convergence speed, computational cost, and error minimization. Moreover, we present a detailed analysis of convergence behavior, supported by graphical illustrations of residual errors, shedding new light on the dynamics of iterative methods. These findings not only establish the superiority of the proposed schemes but also open new avenues for applying iterative techniques to complex mathematical and engineering problems.

키워드

iterative methodorder of convergencesimultaneous rootsNEWTONS METHOD
제목
Simultaneous Root Approximation: A High-Convergence Iterative Approach
저자
Bhalla, SoniaPanwar, MonikaBehl, RamandeepChun, Changbum
DOI
10.1002/mma.10782
발행일
2025-05
유형
Article; Early Access
저널명
Mathematical Methods in the Applied Sciences
48
8
페이지
9098 ~ 9107