On modified interval symmetric single-step procedure ISS2-5D for the simultaneous inclusion of polynomial zeros

Abstract

In this paper, we present a new modified interval symmetric single-step procedure ISS2-5D which is the extension from the previous procedure ISS2. The algorithm of ISS2-5D includes the introduction of reusable correctors ( 1,..., ) ( ) i n k δ i = for k ≥ 0 . The procedure is tested on five test polynomials and the results are obtained using MATLAB 2007 software in association with IntLab V5.5 toolbox to record the CPU times and the number of iterations.

Soft Rough q-Rung Orthopair m-Polar Fuzzy Sets and q-Rung Orthopair m-Polar Fuzzy Soft Rough Sets and Their Applications

“…the proposed approaches yield consistent results. In future, we shall extend the proposed methods to a variety of other environments such as the T-spherical power Muirhead operators [62], multi-objective programming [64], neurogenetics [65] and polynomial zeros [66][67][68].…”

On convergence of the interval zoro symmetric single step procedure for polynomial zeros

“…Steps (1a) -(1e) were developed by Jamaludin et.al [5], where the rate of convergence was at least six.…”

“…Iterative procedures for simultaneous inclusion of simple polynomial zeros were discussed by Monsi and Wolfe [1], Jamaludin et al [2][3][4][5][6], Monsi et al [7,8], Sham et al [9][10][11] and Bakar et al [12]. Our interest lies in the procedure proposed by Jamaludin et al [2] as in Section 2, which was shown to be convergent numerically in terms of shorter CPU times and lesser number of iterations using five test polynomials with ( ) 10 10 k w   as the stopping criterion.…”

On modified symmetric single-step procedure for estimating polynomial zeros simultaneously

“…al [3,4,5] and Jamaluddin et. al [6,7,8,9,10]. The effectiveness of an algorithm is analyzed using the R-order of convergence of the algorithm which is discussed in detail in Ortega and Rheinboldt [11].…”