{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:48:36Z","timestamp":1774046916095,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T00:00:00Z","timestamp":1704499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T00:00:00Z","timestamp":1704499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11075-023-01734-3","type":"journal-article","created":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T08:02:25Z","timestamp":1704528145000},"page":"945-958","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Families of high-order simultaneous methods with several corrections"],"prefix":"10.1007","volume":"97","author":[{"given":"Stoil I.","family":"Ivanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"1734_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1098\/rstl.1694.0029","volume":"18","author":"E Halley","year":"1694","unstructured":"Halley, E.: A new, exact, and easy method of finding the roots of any equations generally, and that without any previous reduction. Philos. Trans. Roy. Soc. 18, 136\u2013148 (1694)","journal-title":"Philos. Trans. Roy. Soc."},{"key":"1734_CR2","unstructured":"Chebyshev, P.L.: Complete Works of P.L. Chebishev, pp. 7\u201325. USSR Academy of Sciences, Moscow (1973). http:\/\/books.e-heritage.ru\/book\/10079542"},{"key":"1734_CR3","unstructured":"Weierstrass, K.: Neuer Beweis des Satzes, dass jede ganze rationale Function einer Ver\u00e4nderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Ver\u00e4nderlichen. Sitzungsber. K\u00f6nigl. Preuss. Akad. Wiss. Berlinn II, 1085\u20131101 (1891). https:\/\/biodiversitylibrary.org\/page\/29263197"},{"key":"1734_CR4","first-page":"625","volume-title":"Handbook of numerical analysis","author":"B Sendov","year":"1994","unstructured":"Sendov, B., Andreev, A., Kjurkchiev, N.: Numerical solution of polynomial equations. In: Ciarlet, P., Lions, J. (eds.) Handbook of numerical analysis, vol. III, pp. 625\u2013778. Elsevier, Amsterdam (1994)"},{"key":"1734_CR5","unstructured":"Kyurkchiev, N.V.: Initial approximations and root finding methods. Mathematical Research, vol. 104. Wiley, Berlin (1998)"},{"key":"1734_CR6","doi-asserted-by":"crossref","unstructured":"Petkovi\u0107, M.: Point estimation of root finding methods. Lecture Notes in Mathematics, vol. 1933. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-77851-6"},{"issue":"5","key":"1734_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0041-5553(64)90148-X","volume":"4","author":"K Dochev","year":"1964","unstructured":"Dochev, K., Byrnev, P.: Certain modifications of Newton\u2019s method for the approximate solution of algebraic equations. USSR Comput. Math. Math. Phys. 4(5), 174\u2013182 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90148-X","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"2","key":"1734_CR8","first-page":"1","volume":"4","author":"K Tanabe","year":"1983","unstructured":"Tanabe, K.: Behavior of the sequences around multiple zeros generated by some simultaneous methods for solving algebraic equations. Tech. Rep. Inf. Process Numer. Anal. 4(2), 1\u20136 (1983). ((in Japanese))","journal-title":"Tech. Rep. Inf. Process Numer. Anal."},{"key":"1734_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/363067.363115","volume":"10","author":"LW Ehrlich","year":"1967","unstructured":"Ehrlich, L.W.: A modified Newton method for polynomials. Commun. ACM 10, 107\u2013108 (1967). https:\/\/doi.org\/10.1145\/363067.363115","journal-title":"Commun. ACM"},{"key":"1734_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02163336","volume":"14","author":"W B\u00f6rsch-Supan","year":"1970","unstructured":"B\u00f6rsch-Supan, W.: Residuenabsch\u00e4tzung f\u00fcr Polynom-Nullstellen mittels Lagrange Interpolation. Numer. Math. 14, 287\u2013296 (1970)","journal-title":"Numer. Math."},{"key":"1734_CR11","first-page":"257","volume":"9","author":"RM Sekuloski","year":"1972","unstructured":"Sekuloski, R.M.: Generalization of Pre\u0161ic\u2019s iterative method for factorization of a polynomial. Mat Vesnik 9, 257\u2013264 (1972)","journal-title":"Mat Vesnik"},{"key":"1734_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1017\/S0305004100054098","volume":"82","author":"MR Farmer","year":"1977","unstructured":"Farmer, M.R., Loizou, G.: An algorithm for the total, partial, factorization of a polynomial. Math. Proc. Cambridge Philos. Soc. 82, 427\u2013437 (1977). https:\/\/doi.org\/10.1017\/S0305004100054098","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"1734_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0898-1221(80)90035-8","volume":"6","author":"I Gargantini","year":"1980","unstructured":"Gargantini, I.: Parallel square-root iterations for multiple roots. Comput. Math. Appl. 6, 279\u2013288 (1980). https:\/\/doi.org\/10.1016\/0898-1221(80)90035-8","journal-title":"Comput. Math. Appl."},{"key":"1734_CR14","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/0898-1221(86)90020-9","volume":"12","author":"M Petkovi\u0107","year":"1986","unstructured":"Petkovi\u0107, M., Milovanovi\u0107, G.V., Stefanovi\u0107, L.V.: Some higher-order methods for the simultaneous approximation of multiple polynomial zeros. Comput. Math. Appl. 12, 951\u2013962 (1986). https:\/\/doi.org\/10.1016\/0898-1221(86)90020-9","journal-title":"Comput. Math. Appl."},{"issue":"9","key":"1734_CR15","first-page":"29","volume":"43","author":"NV Kjurkchiev","year":"1990","unstructured":"Kjurkchiev, N.V., Andreev, A.: On Halley-like algorithms with high order of convergence for simultaneous approximation of multiple roots of polynomials. Compt. rend. Acad. bulg. Sci. 43(9), 29\u201332 (1990)","journal-title":"Compt. rend. Acad. bulg. Sci."},{"key":"1734_CR16","first-page":"31","volume":"54","author":"A Iliev","year":"2001","unstructured":"Iliev, A., Iliev, I.: On a generalization of Weierstrass-Dochev method for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system. Compt. rend. Acad. bulg. Sci. 54, 31\u201336 (2001)","journal-title":"Compt. rend. Acad. bulg. Sci."},{"issue":"7","key":"1734_CR17","first-page":"907","volume":"67","author":"PD Proinov","year":"2014","unstructured":"Proinov, P.D., Cholakov, S.I.: Convergence of Chebyshev-like method for simultaneous approximation of multiple polynomial zeros. Compt. rend. Acad. bulg. Sci. 67(7), 907\u2013918 (2014)","journal-title":"Compt. rend. Acad. bulg. Sci."},{"key":"1734_CR18","doi-asserted-by":"publisher","first-page":"115428","DOI":"10.1016\/j.cam.2023.115428","volume":"436","author":"PD Proinov","year":"2024","unstructured":"Proinov, P.D., Ivanov, S.I.: A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence. J. Comput. Appl. Math. 436, 115428\u201316 (2024). https:\/\/doi.org\/10.1016\/j.cam.2023.115428","journal-title":"J. Comput. Appl. Math."},{"key":"1734_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0771-050X(77)90006-7","volume":"3","author":"AWM Nourein","year":"1977","unstructured":"Nourein, A.W.M.: An improvement on Noureins method for the simultaneous determination of the zeros of a polynomial (an algorithm). J. Comput. Appl. Math. 3, 109\u2013110 (1977). https:\/\/doi.org\/10.1016\/0771-050X(77)90006-7","journal-title":"J. Comput. Appl. Math."},{"key":"1734_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/00207167708803141","volume":"6","author":"AWM Nourein","year":"1977","unstructured":"Nourein, A.W.M.: An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial. Int. J. Comput. Math. 6, 241\u2013252 (1977). https:\/\/doi.org\/10.1080\/00207167708803141","journal-title":"Int. J. Comput. Math."},{"key":"1734_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0377-0427(86)90235-9","volume":"15","author":"MS Petkovi\u0107","year":"1986","unstructured":"Petkovi\u0107, M.S., Stefanovi\u0107, L.V.: On some improvements of square root iteration for polynomial complex zeros. J. Comput. Appl. Math. 15, 13\u201325 (1986). https:\/\/doi.org\/10.1016\/0377-0427(86)90235-9","journal-title":"J. Comput. Appl. Math."},{"key":"1734_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03167406","volume":"15","author":"MS Petkovi\u0107","year":"1998","unstructured":"Petkovi\u0107, M.S., Tri\u010dkovi\u0107, S., Herceg, D.: On Euler-like methods for the simultaneous approximation of polynomial zeros. Japan J. Indust. Appl. Math. 15, 295\u2013315 (1998). https:\/\/doi.org\/10.1007\/BF03167406","journal-title":"Japan J. Indust. Appl. Math."},{"key":"1734_CR23","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.aml.2017.05.013","volume":"74","author":"LD Petkovi\u0107","year":"2017","unstructured":"Petkovi\u0107, L.D., Petkovi\u0107, M.S.: On a high-order one-parameter family for the simultaneous determination of polynomial roots. Appl. Math. Let. 74, 94\u2013101 (2017). https:\/\/doi.org\/10.1016\/j.aml.2017.05.013","journal-title":"Appl. Math. Let."},{"key":"1734_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02253746","volume":"38","author":"D Wang","year":"1987","unstructured":"Wang, D., Wu, Y.: Some modifications of the parallel Halley iteration method and their convergence. Computing 38, 75\u201387 (1987). https:\/\/doi.org\/10.1007\/BF02253746","journal-title":"Computing"},{"issue":"16","key":"1734_CR25","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.3390\/math9161855","volume":"9","author":"PD Proinov","year":"2021","unstructured":"Proinov, P.D., Vasileva, M.T.: A new family of high-order Ehrlich-type iterative methods. Mathematics 9(16), 1855\u201325 (2021). https:\/\/doi.org\/10.3390\/math9161855","journal-title":"Mathematics"},{"key":"1734_CR26","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1016\/j.camwa.2010.01.048","volume":"59","author":"MS Petkovi\u0107","year":"2010","unstructured":"Petkovi\u0107, M.S., Petkovi\u0107, L.D., D\u017euni\u0107, J.: Accelerating generators of iterative methods for finding multiple roots of nonlinear equations. Comput. Math. Appl. 59, 2784\u20132793 (2010). https:\/\/doi.org\/10.1016\/j.camwa.2010.01.048","journal-title":"Comput. Math. Appl."},{"issue":"4","key":"1734_CR27","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10092-017-0225-4","volume":"54","author":"VK Kyncheva","year":"2017","unstructured":"Kyncheva, V.K., Yotov, V.V., Ivanov, S.I.: On the convergence of Schr\u00f6der\u2019s method for the simultaneous computation of polynomial zeros of unknown multiplicity. Calcolo 54(4), 1199\u20131212 (2017). https:\/\/doi.org\/10.1007\/s10092-017-0225-4","journal-title":"Calcolo"},{"key":"1734_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01444024","volume":"2","author":"E Schr\u00f6der","year":"1870","unstructured":"Schr\u00f6der, E.: \u00dcber unendlich viele Algorithmen zur Aufl\u00f6sung der Gleichungen. Math. Ann. 2, 317\u2013365 (1870). https:\/\/doi.org\/10.1007\/BF01444024","journal-title":"Math. Ann."},{"key":"1734_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.3390\/math10010135","volume":"10","author":"SI Ivanov","year":"2022","unstructured":"Ivanov, S.I.: Unified convergence analysis of Chebyshev-Halley methods for multiple polynomial zeros. Mathematics 10, 135\u201312 (2022). https:\/\/doi.org\/10.3390\/math10010135","journal-title":"Mathematics"},{"key":"1734_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.apnum.2016.10.013","volume":"112","author":"VK Kyncheva","year":"2017","unstructured":"Kyncheva, V.K., Yotov, V.V., Ivanov, S.I.: Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros. Appl. Numer. Math. 112, 146\u2013154 (2017). https:\/\/doi.org\/10.1016\/j.apnum.2016.10.013","journal-title":"Appl. Numer. Math."},{"key":"1734_CR31","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.3390\/sym12091408","volume":"12","author":"PI Marcheva","year":"2020","unstructured":"Marcheva, P.I., Ivanov, S.I.: Convergence analysis of a modified Weierstrass method for the simultaneous determination of polynomial zeros. Symmetry 12, 1408\u201319 (2020). https:\/\/doi.org\/10.3390\/sym12091408","journal-title":"Symmetry"},{"key":"1734_CR32","doi-asserted-by":"crossref","unstructured":"Nedzhibov, G.H.: Convergence of the modified inverse Weierstrass method for simultaneous approximation of polynomial zeros. Commun. Numer. Anal., 74\u201380 (2016)","DOI":"10.5899\/2016\/cna-00261"},{"key":"1734_CR33","doi-asserted-by":"publisher","unstructured":"Proinov, P.D.: Two classes of iteration functions and $$Q$$-convergence of two iterative methods for polynomial zeros. Symmetry 13(3), 371\u201329 (2021). https:\/\/doi.org\/10.3390\/sym13030371","DOI":"10.3390\/sym13030371"},{"key":"1734_CR34","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-0427(91)90184-L","volume":"38","author":"T Sakurai","year":"1991","unstructured":"Sakurai, T., Torii, T., Sugiura, H.: A high-order iterative formula for simultaneous determination of zeros of a polynomial. J. Comput. Appl. Math. 38, 387\u2013397 (1991). https:\/\/doi.org\/10.1016\/0377-0427(91)90184-L","journal-title":"J. Comput. Appl. Math."},{"key":"1734_CR35","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cam.2019.02.021","volume":"357","author":"PD Proinov","year":"2019","unstructured":"Proinov, P.D., Ivanov, S.I.: Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros. J. Comput. Appl. Math. 357, 56\u201370 (2019). https:\/\/doi.org\/10.1016\/j.cam.2019.02.021","journal-title":"J. Comput. Appl. Math."},{"key":"1734_CR36","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","volume":"27","author":"O Aberth","year":"1973","unstructured":"Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comp. 27, 339\u2013344 (1973). https:\/\/doi.org\/10.1090\/S0025-5718-1973-0329236-7","journal-title":"Math. Comp."},{"key":"1734_CR37","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.amc.2007.01.062","volume":"190","author":"A Cordero","year":"2007","unstructured":"Cordero, A., Torregrosa, J.R.: Variants of Newton\u2019s method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686\u2013698 (2007). https:\/\/doi.org\/10.1016\/j.amc.2007.01.062","journal-title":"Appl. Math. Comput."},{"key":"1734_CR38","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0893-9659(00)00100-2","volume":"13","author":"S Weerakoon","year":"2000","unstructured":"Weerakoon, S., Fernando, T.G.I.: A variant of Newton\u2019s method with accelerated third-order convergence. Appl. Math. Lett. 13, 87\u201393 (2000). https:\/\/doi.org\/10.1016\/S0893-9659(00)00100-2","journal-title":"Appl. Math. Lett."},{"key":"1734_CR39","doi-asserted-by":"publisher","unstructured":"Grau-S\u00e1nchez, M., Noguera, M., Guti\u00e9rrez, J.M.: On some computational orders of convergence. Appl. Math. Lett. 23, 472\u2013478 (2010). https:\/\/doi.org\/10.1016\/j.aml.2009.12.006","DOI":"10.1016\/j.aml.2009.12.006"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01734-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01734-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01734-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:21:58Z","timestamp":1725873718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01734-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,6]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1734"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01734-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,6]]},"assertion":[{"value":"25 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}