{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:26:48Z","timestamp":1760236008475,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004530","name":"Universiti Putra Malaysia","doi-asserted-by":"publisher","award":["GP-IPM\/2021\/9699800"],"award-info":[{"award-number":["GP-IPM\/2021\/9699800"]}],"id":[{"id":"10.13039\/501100004530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/sym13101971","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T22:07:04Z","timestamp":1634767624000},"page":"1971","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the Convergence of Interval Single-Step Method for Simultaneous Approximation of Polynomial Zeros"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7941-1878","authenticated-orcid":false,"given":"Nur Raidah","family":"Salim","sequence":"first","affiliation":[{"name":"Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1768-8668","authenticated-orcid":false,"given":"Chuei Yee","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"},{"name":"Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6954-8494","authenticated-orcid":false,"given":"Zahari","family":"Mahad","sequence":"additional","affiliation":[{"name":"Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}]},{"given":"Siti Hasana","family":"Sapar","sequence":"additional","affiliation":[{"name":"Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"},{"name":"Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}]}],"member":"1968","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1550040","DOI":"10.1142\/S021969131550040X","article-title":"A blind digital image watermarking method based on the dyadic wavelet packet transform and fast interval arithmetic techniques","volume":"13","author":"Ohura","year":"2015","journal-title":"Int. J. Wavelets Multiresolution Inf. Process."},{"key":"ref_2","first-page":"362","article-title":"Interval arithmetic with fixed rounding mode. Nonlinear Theory and Its Applications","volume":"7","author":"Rump","year":"2016","journal-title":"IEICE"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.compag.2017.12.024","article-title":"Automatic classification of plant electrophysiological responses to environmental stimuli using machine learning and interval arithmetic","volume":"145","author":"Pereira","year":"2018","journal-title":"Comput. Electron. Agric."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Orozco-Gutierrez, M.L. (2020). An Interval-Arithmetic-Based Approach to the Parametric Identification of the Single-Diode Model of Photovoltaic Generators. Energies, 13.","DOI":"10.3390\/en13040932"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"115478","DOI":"10.1016\/j.eswa.2021.115478","article-title":"Time-series interval prediction under uncertainty using modified double multiplicative neuron network","volume":"184","author":"Pan","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_6","first-page":"251","article-title":"Neuer Beweis des Satzes, dass jede ganze rationale Funktion einer Veranderlichen dargestellt werden kann als ein Product aus lineare Funktionen derselben Veranderlichen","volume":"3","author":"Weierstrass","year":"1967","journal-title":"Gesammelte Werke"},{"key":"ref_7","first-page":"669","article-title":"Semilocal Convergence of Chebyshev-like Root-finding Method for Simultaneous Approximation of Polynomial Zeros","volume":"236","author":"Proinov","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s13160-014-0138-4","article-title":"Convergence of The Two-point Weierstrass Root-finding Method","volume":"31","author":"Proinov","year":"2014","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"ref_9","first-page":"957","article-title":"On a Family of Weierstrass-type Root-finding Methods with Accelerated Convergence","volume":"273","author":"Proinov","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1515\/jnma-2015-0026","article-title":"On The Convergence of Halley\u2019s Method for Simultaneous Computation of Polynomial Zeros","volume":"23","author":"Proinov","year":"2015","journal-title":"J. Numer. Math."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1186\/s13660-015-0855-5","article-title":"On The Convergence of High-order Ehrlich-type Iterative Methods for Approximating All Zeros of A Polynomial Simultaneously","volume":"2015","author":"Proinov","year":"2015","journal-title":"J. Inequalities Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s10092-015-0155-y","article-title":"On The Local Convergence of Ehrlich Method for Numerical Computation of Polynomial Zeros","volume":"253","author":"Proinov","year":"2016","journal-title":"Calcolo"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.aml.2015.08.016","article-title":"Relationships Between Different Types of Initial Conditions for Simultaneous Root Finding Methods","volume":"52","author":"Proinov","year":"2016","journal-title":"Appl. Math. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.jco.2013.11.002","article-title":"A New Semilocal Convergence Theorem for the Weierstrass Method for Finding Zeros of A Polynomial Simultaneously","volume":"30","author":"Proinov","year":"2014","journal-title":"J. Complex."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.cam.2017.02.038","article-title":"A Convergence Analysis of A Fourth-order Method for Computing All Zeros of A Polynomial Simultaneously","volume":"321","author":"Cholakov","year":"2017","journal-title":"J. Comput. Appl. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.apnum.2016.10.013","article-title":"Convergence of Newton, Halley and Chebyshev Iterative Methods as Methods for Simultaneous Determination of Multiple Polynomial Zeros","volume":"112","author":"Kyncheva","year":"2017","journal-title":"J. Appl. Numer. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cam.2019.02.021","article-title":"Convergence Analysis of Sakurai\u2013Torii\u2013Sugiura Iterative Method for Simultaneous Approximation of Polynomial Zeros","volume":"357","author":"Proinov","year":"2019","journal-title":"J. Comput. Appl. Math."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01404681","article-title":"Circular Arithmetic and The Determination of Polynomial Zeros","volume":"18","author":"Gargantini","year":"1971","journal-title":"Numer. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0771-050X(82)90007-9","article-title":"On an iterative method for simultaneous inclusion of polynomial complex zeros","volume":"8","year":"1982","journal-title":"J. Comput. Appl. Math."},{"key":"ref_20","first-page":"191","article-title":"Interval Versions of Some Procedures for The Simultaneous Estimation of Complex Polynomial Zeros","volume":"28","author":"Monsi","year":"1988","journal-title":"Appl. Math. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0711023","article-title":"On the Convergence Speed of Some Algorithms for The Simultaneous Approximation of Polynomial Roots","volume":"11","author":"Alefeld","year":"1974","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Moore, R.E. (1979). Methods and Applications of Interval Analysis, SIAM. [1st ed.].","DOI":"10.1137\/1.9781611970906"},{"key":"ref_23","unstructured":"Alefeld, G., and Herzberger, J. (1983). Introduction to Interval Computations, Academic Press. [1st ed.]."},{"key":"ref_24","unstructured":"Salim, N.R. (2012). Convergence of Interval Symmetric Single-step Method for Simultaneous Inclusion of Real Polynomial Zeros. [Ph.D. Thesis, Universiti Putra Malaysia]."},{"key":"ref_25","first-page":"3731","article-title":"On The Convergence Rate of Symmetric Single-step Method ISS for Simultaneous Bounding Polynomial Zeros","volume":"5","author":"Salim","year":"2011","journal-title":"Appl. Math. Sci."},{"key":"ref_26","first-page":"020033","article-title":"The Performance of The Interval Midpoint Zoro Symmetric Single-step (IMZSS2-5D) Procedure to Converge Simultaneously to The Zeros","volume":"Volume 2013","author":"Zin","year":"2018","journal-title":"AIP Conference Proceedings, Proceeding of The International Conference on Mathematics, Engineering and Industrial Applications 2018 (ICoMEIA 2018), Kuala Lumpur, Malaysia, 24\u201326 July 2018"},{"key":"ref_27","unstructured":"Durand, E. (1960). Solutions num\u00e9Riques des \u00c9quations alg\u00e9Briques: Syst\u00e8mes de Plusieurs \u00c9quations, Masson."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02162564","article-title":"Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen [A complete procedure for calculating the zeros of polynomials]","volume":"8","author":"Kerner","year":"2015","journal-title":"Numer. Mathl Sci."},{"key":"ref_29","first-page":"3693","article-title":"On the interval zoro symmetric single-step procedure for simultaneous finding of real polynomial zeros","volume":"5","author":"Rusli","year":"2011","journal-title":"Appl. Math. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Chen, C.Y., Ghazali, A.H., and Leong, W.J. (2021). Scaled parallel iterative method for finding real roots of nonlinear equations. Optimization, 1\u201317.","DOI":"10.1080\/02331934.2021.1873985"},{"key":"ref_31","first-page":"122","article-title":"Numerical Solution of Nonlinear Problems: Studies in Numerical Analysis 2","volume":"2","author":"Ortega","year":"1970","journal-title":"Symp. Spons. Nav. Res."},{"key":"ref_32","unstructured":"Majid, Z.A., Salim, N.R., Laham, M.F., Gopal, K., Phang, P.S., and Mahad, Z. On The Performances of IMZSS2 Method for Bounding Polynomial Zeros Simultaneously. Proceedings of the 7th International Conference on Research and Education in Mathematics (ICREM7), Kuala Lumpur, Malaysia, 25\u201327 August 2015."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Csendes, T. (1999). INTLAB \u2014 INTerval LABoratory. Developments in Reliable Computing, Springer.","DOI":"10.1007\/978-94-017-1247-7"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/10\/1971\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:18:05Z","timestamp":1760167085000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/10\/1971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,19]]},"references-count":34,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,10]]}},"alternative-id":["sym13101971"],"URL":"https:\/\/doi.org\/10.3390\/sym13101971","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,10,19]]}}}