{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T01:36:30Z","timestamp":1749173790306,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:00:00Z","timestamp":1715126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:00:00Z","timestamp":1715126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The aim of this paper is the study of the robustness of classical methods defined for finding multiple roots with single multiplicity <jats:italic>m<\/jats:italic> when they are used for approximating different roots of a function having different multiplicities. To do so, we first study the dynamical behaviour of such methods when they are applied for approximating multiple roots with different multiplicities of a polynomial. Secondly, based on the obtained dynamical results, we analyse numerically their behaviour and convergence when we carry out the approximation in the case of functions that combine polynomial, exponential and logarithmic functions.<\/jats:p>","DOI":"10.1007\/s40314-024-02746-y","type":"journal-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T14:02:26Z","timestamp":1715176946000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamical and numerical analysis of classical multiple roots finding methods applied for different multiplicities"],"prefix":"10.1007","volume":"43","author":[{"given":"Beatriz","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva G.","family":"Villalba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8422-4738","authenticated-orcid":false,"given":"Pura","family":"Vindel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,8]]},"reference":[{"key":"2746_CR1","series-title":"SEMA SIMAI Springer series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-39228-8","volume-title":"Advances in iterative methods for nonlinear equations","author":"S Amat","year":"2016","unstructured":"Amat S, Busquier S (2016) Advances in iterative methods for nonlinear equations, vol 10. SEMA SIMAI Springer series. Springer, Cham"},{"key":"2746_CR2","series-title":"Graduate texts in mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4422-6","volume-title":"Iteration of rational functions","author":"AF Beardon","year":"1991","unstructured":"Beardon AF (1991) Iteration of rational functions. Graduate texts in mathematics. Springer, New York"},{"key":"2746_CR3","doi-asserted-by":"crossref","unstructured":"Behl R, Cordero A, Torregrosa JR (2022) A new higher-order optimal derivative-free scheme for multiple roots. J Comput Appl Math 404, Paper No. 113773, 14 pp","DOI":"10.1016\/j.cam.2021.113773"},{"key":"2746_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02238803","volume":"45","author":"VF Candela","year":"1990","unstructured":"Candela VF, Marquina A (1990) Recurrence relations for rational cubic methods II: the Chebyshev method. Computing 45:355\u2013367","journal-title":"Computing"},{"key":"2746_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.amc.2015.04.092","volume":"264","author":"V Candela","year":"2015","unstructured":"Candela V, Peris R (2015) The rate of multiplicity of the roots of non linear equations and its application to iterative methods. Appl Math Comput 264:417\u2013430","journal-title":"Appl Math Comput"},{"key":"2746_CR6","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 JR (2007) Variants of Newton\u2019s method using fifth-order quadrature formulas. Appl Math Comput 190:686\u2013698","journal-title":"Appl Math Comput"},{"key":"2746_CR7","doi-asserted-by":"publisher","first-page":"2570","DOI":"10.3390\/math9202570","volume":"9","author":"A Cordero","year":"2021","unstructured":"Cordero A, Neta B, Torregrosa JR (2021) Memorizing Schr\u00f6der\u2019s method as an efficient strategy for estimating roots of unknown multiplicity. Mathematics 9:2570. https:\/\/doi.org\/10.3390\/math9202570","journal-title":"Mathematics"},{"key":"2746_CR8","doi-asserted-by":"publisher","unstructured":"Cordero A, Garrido N, Triguero-Navarro P, Torregrosa JR (2022) Modifying Kurchatov\u2019s method to find multiple roots of nonlinear equations. Authorea Preprints. https:\/\/doi.org\/10.22541\/au.166633038.86432258\/v1","DOI":"10.22541\/au.166633038.86432258\/v1"},{"key":"2746_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/fractalfract5010025","volume":"5","author":"V Galilea","year":"2021","unstructured":"Galilea V, Guti\u00e9rrez JM (2021) A characterization of the dynamics of Schr\u00f6der\u2019s method for polynomials with two roots. Fractal Fract 5:25","journal-title":"Fractal Fract"},{"key":"2746_CR10","first-page":"136","volume":"18","author":"E Halley","year":"1694","unstructured":"Halley E (1694) A new, exact and easy method of finding the roots of equations generally and that without any previous reduction. Philos Trans R Soc Lond 18:136\u2013148","journal-title":"Philos Trans R Soc Lond"},{"key":"2746_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01396176","volume":"27","author":"E Hansen","year":"1977","unstructured":"Hansen E, Patrick M (1977) A family of root finding methods. Numer Math 27:257\u2013269","journal-title":"Numer Math"},{"key":"2746_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.2307\/2002129","volume":"12","author":"DJ Hofsommer","year":"1958","unstructured":"Hofsommer DJ (1958) Note on the computation of the zeros of functions satisfying a second order differential equation. Math Table Other Aids Comput 12:58\u201360","journal-title":"Math Table Other Aids Comput"},{"key":"2746_CR13","series-title":"Annals of mathematics studies","volume-title":"Dynamics in one complex variable","author":"J Milnor","year":"2006","unstructured":"Milnor J (2006) Dynamics in one complex variable, vol 160. Annals of mathematics studies. Princeton University Press, Princeton"},{"issue":"1","key":"2746_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.amc.2008.01.031","volume":"202","author":"B Neta","year":"2008","unstructured":"Neta B (2008) New third order nonlinear solvers for multiple roots. Appl Math Comput 202(1):162\u2013170","journal-title":"Appl Math Comput"},{"key":"2746_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.cam.2016.06.008","volume":"308","author":"I Petkovic","year":"2016","unstructured":"Petkovic I, Neta B (2016) On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity. J Comput Appl Math 308:215\u2013230","journal-title":"J Comput Appl Math"},{"key":"2746_CR16","volume-title":"Multipoint methods for solving nonlinear equations","author":"M Petkovic","year":"2013","unstructured":"Petkovic M, Neta B, Petkovic L, D\u017eunic L (2013) Multipoint methods for solving nonlinear equations. Academic Press, Oxford"},{"key":"2746_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/00207168008803193","volume":"8","author":"DB Popovski","year":"1980","unstructured":"Popovski DB (1980) A family of one point iteration formulae for finding roots. Int J Comput Math 8:85\u201388","journal-title":"Int J Comput Math"},{"key":"2746_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01444024","volume":"2","author":"E Schr\u00f6der","year":"1870","unstructured":"Schr\u00f6der E (1870) Ueber unendlich viele Algorithmen zur Aufl\u00f6sung der Gleichungen. Math Ann 2:317\u2013365","journal-title":"Math Ann"},{"key":"2746_CR19","volume-title":"Iterative methods for the solution of equations","author":"JF Traub","year":"1964","unstructured":"Traub JF (1964) Iterative methods for the solution of equations. Prentice-Hall, Englewood Cliffs"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02746-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02746-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02746-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T02:07:26Z","timestamp":1718071646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02746-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2746"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02746-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,5,8]]},"assertion":[{"value":"27 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"230"}}