Improving the Convergence of Interval Single-Step Method for Simultaneous Approximation of Polynomial Zeros
Open Access
Abstract
This paper describes the extended method of solving real polynomial zeros problems using the single-step method, namely, the interval trio midpoint symmetric single-step (ITMSS) method, which updates the midpoint at each forward-backward-forward step. The proposed algorithm will constantly update the value of the midpoint of each interval of the previous roots before entering the preceding steps; hence, it always generate intervals that decrease toward the polynomial zeros. Theoretically, the proposed method possesses a superior rate of convergence at 16, while the existing methods are known to have, at most, 9. To validate its efficiency, we perform numerical experiments on 52 polynomials, and the results are presented, using performance profiles. The numerical results indicate that the proposed method surpasses the other three methods by fine-tuning the midpoint, which reduces the final interval width upon convergence with fewer iterations.Keywords
Funding Information
- Universiti Putra Malaysia (GP-IPM/2021/9699800)
This publication has 24 references indexed in Scilit:
- On the local convergence of Ehrlich method for numerical computation of polynomial zerosCalcolo, 2015
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zerosApplied Mathematics and Computation, 2014
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneouslyJournal of Complexity, 2014
- Convergence of the two-point Weierstrass root-finding methodJapan Journal of Industrial and Applied Mathematics, 2014
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zerosApplied Mathematics and Computation, 1988
- On an iterative method for simultaneous inclusion of polynomial complex zerosJournal of Computational and Applied Mathematics, 1982
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial RootsSIAM Journal on Numerical Analysis, 1974
- Circular arithmetic and the determination of polynomial zerosNumerische Mathematik, 1971
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von PolynomenNumerische Mathematik, 1966