{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T07:52:45Z","timestamp":1722844365774},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,26]],"date-time":"2009-09-26T00:00:00Z","timestamp":1253923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s11075-009-9332-x","type":"journal-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T13:31:13Z","timestamp":1253885473000},"page":"219-243","source":"Crossref","is-referenced-by-count":9,"title":["A study of accelerated Newton methods for multiple polynomial roots"],"prefix":"10.1007","volume":"54","author":[{"given":"Aur\u00e9l","family":"Gal\u00e1ntai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba J.","family":"Heged\u0171s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,26]]},"reference":[{"key":"9332_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1090\/qam\/31326","volume":"7","author":"E Bodewig","year":"1949","unstructured":"Bodewig, E.: On types of convergence and behavior of approximations in the neighborhood of a multiple root of an equation. Q. Appl. Math. 7, 325\u2013333 (1949)","journal-title":"Q. Appl. Math."},{"key":"9332_CR2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01931230","volume":"19","author":"M Channabasappa","year":"1979","unstructured":"Channabasappa, M.: A note on the computation of multiple zeros of polynomial by Newton\u2019s method. BIT 19, 134\u2013135 (1979)","journal-title":"BIT"},{"key":"9332_CR3","unstructured":"Crouse, J.E., Putt, C.W.: Roots of Polynomials by Ratio of Successive Derivatives. Technical Report, NASA TN D-6793, NASA, Washington (1972)"},{"key":"9332_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61347-0","volume-title":"Sequence Transformations","author":"J-P Delahaye","year":"1988","unstructured":"Delahaye, J.-P.: Sequence Transformations. Springer, New York (1988)"},{"key":"9332_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01399090","volume":"27","author":"E Hansen","year":"1976","unstructured":"Hansen, E., Patrick, M.: Estimating the multiplicity of a root. Numer. Math. 27, 121\u2013131 (1976)","journal-title":"Numer. Math."},{"key":"9332_CR6","volume-title":"Elements of Numerical Analysis","author":"P Henrici","year":"1964","unstructured":"Henrici, P.: Elements of Numerical Analysis. Wiley, New York (1964)"},{"key":"9332_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01385780","volume":"59","author":"MA Hern\u00e1ndez Ver\u00f3n","year":"1991","unstructured":"Hern\u00e1ndez Ver\u00f3n, M.A.: A note on Halley\u2019s method. Numer. Math. 59, 273\u2013276 (1991)","journal-title":"Numer. Math."},{"issue":"1","key":"9332_CR8","first-page":"159","volume":"22","author":"MA Hern\u00e1ndez Ver\u00f3n","year":"1992","unstructured":"Hern\u00e1ndez Ver\u00f3n, M.A.: Newton-Raphson\u2019s method and convexity. Univ. u Novom Sadu, Zb. Rad. Prirod. Mat. Fak., Ser. Mat. 22(1), 159\u2013166 (1992)","journal-title":"Univ. u Novom Sadu, Zb. Rad. Prirod. Mat. Fak., Ser. Mat."},{"key":"9332_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0096-3003(98)10047-4","volume":"103","author":"MA Hern\u00e1ndez","year":"1999","unstructured":"Hern\u00e1ndez M.A., Salanova, M.A.: Indices of convexity and concavity. Application to Halley method. Appl. Math. Comput. 103, 27\u201349 (1999)","journal-title":"Application to Halley method. Appl. Math. Comput."},{"key":"9332_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/232826.232830","volume":"22","author":"TE Hull","year":"1996","unstructured":"Hull, T.E., Mathon, R.: The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence. ACM Trans. Math. Softw. 22, 261\u2013280 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"9332_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0377-0427(94)00086-G","volume":"60","author":"M Igarashi","year":"1995","unstructured":"Igarashi, M., Ypma, T.: Relationships between order and efficiency of a class of methods for multiple zero of polynomials. J. Comput. Appl. Math. 60, 101\u2013113 (1995)","journal-title":"J. Comput. Appl. Math."},{"key":"9332_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0377-0427(97)00077-0","volume":"82","author":"M Igarashi","year":"1997","unstructured":"Igarashi, M., Ypma, T.: Empirical versus asymptotic rate of convergence of a class of methods for solving polynomial equations. J. Comput. Appl. Math. 82, 229\u2013237 (1997)","journal-title":"J. Comput. Appl. Math."},{"key":"9332_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/355626.355632","volume":"1","author":"M Jenkins","year":"1975","unstructured":"Jenkins, M., Traub, J.: Principles for testing polynomial zerofinding programs. ACM Trans. Math. Softw. 1, 26\u201334 (1975)","journal-title":"ACM Trans. Math. Softw."},{"key":"9332_CR14","unstructured":"Kahan, W.: Lecture notes on real root-finding. http:\/\/www.cs.berkeley.edu\/~wkahan\/Math128\/RealRoots.pdf (2004)"},{"key":"9332_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02242141","volume":"30","author":"R King","year":"1983","unstructured":"King, R.: Improving the Van de Vel Root-Finding method. Computing 30, 373\u2013378 (1983)","journal-title":"Computing"},{"key":"9332_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s006070050017","volume":"62","author":"P Kravanja","year":"1999","unstructured":"Kravanja, P., Haegemans, A.: A modification of Newton\u2019s method for analytic mappings having multiple zeros. Computing 62, 129\u2013145 (1999)","journal-title":"Computing"},{"key":"9332_CR17","volume-title":"Computer Based Numerical Algorithms","author":"EV Krishnamurty","year":"1976","unstructured":"Krishnamurty, E.V., Sen, S.K.: Computer Based Numerical Algorithms. Affiliated East-West Press Pvt. Ltd., New Delhi (1976)"},{"key":"9332_CR18","doi-asserted-by":"crossref","unstructured":"Lang, M., Frenzel, B.C.: A New and Efficient Program for Finding All Polynomial Roots. Technical Report #9308, Rice University, Houston (1994)","DOI":"10.21236\/ADA631175"},{"key":"9332_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01933524","volume":"13","author":"K Madsen","year":"1973","unstructured":"Madsen, K.: A root-finding algorithm based on Newton\u2019s method. BIT 13, 71\u201375 (1973)","journal-title":"BIT"},{"key":"9332_CR20","unstructured":"Madsen, K., Reid, J.K.: FORTRAN Subroutines for Finding Polynomial Zeros. Technical Report A.E.R.E. R.7986, Computer Science and System Division, A.E.R.E. Harwell, Oxfordshire (1975)"},{"key":"9332_CR21","first-page":"9","volume":"10","author":"JH Mathews","year":"1989","unstructured":"Mathews, J.H.: An improved Newton\u2019s method. AMATYC Rev. 10, 9\u201314 (1989)","journal-title":"AMATYC Rev."},{"key":"9332_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/290590.290592","volume":"33","author":"J McNamee","year":"1998","unstructured":"McNamee, J.: A comparison of methods for accelerating convergence of Newton\u2019s method for multiple polynomial roots. ACM SIGNUM Newsl. 33, 17\u201322 (1998)","journal-title":"ACM SIGNUM Newsl."},{"key":"9332_CR23","volume-title":"Numerical Methods for Roots of Polynomials, Part I","author":"JM McNamee","year":"2007","unstructured":"McNamee, J.M. : Numerical Methods for Roots of Polynomials, Part I. Elsevier, Amsterdam (2007)"},{"key":"9332_CR24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0377-0427(98)00131-9","volume":"98","author":"N Osada","year":"1998","unstructured":"Osada, N.: Improving the order of convergence of iteration functions. J. Comput. Appl. Math. 98, 311\u2013315 (1998)","journal-title":"J. Comput. Appl. Math."},{"key":"9332_CR25","volume-title":"Solution of Equations and Systems of Equations","author":"A Ostrowski","year":"1960","unstructured":"Ostrowski, A.: Solution of Equations and Systems of Equations. Academic, London (1960)"},{"key":"9332_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02165226","volume":"9","author":"L Rall","year":"1966","unstructured":"Rall, L.: Convergence of the Newton process to multiple solutions. Numer. Math. 9, 23\u201337 (1966)","journal-title":"Numer. Math."},{"issue":"1992","key":"9332_CR27","doi-asserted-by":"crossref","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). English translation by G.W. Stewart: On Infinitely Many Algorithms for Solving Equations. Technical Report TR-92-121, University of Maryland, Department of Computer Science (1992)","journal-title":"Math. Ann."},{"key":"9332_CR28","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/TASSP.1982.1163975","volume":"30","author":"K Steiglitz","year":"1982","unstructured":"Steiglitz, K., Dickinson, B.: Phase unwrapping by factorization. IEEE Trans. Acoust. Speech Signal Process. 30, 984\u2013991 (1982)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"9332_CR29","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/BF01933649","volume":"20","author":"G Stewart","year":"1980","unstructured":"Stewart, G.: The behavior of a multiplicity independent root-finding scheme in the presence of error. BIT 20, 526\u2013528 (1980)","journal-title":"BIT"},{"key":"9332_CR30","volume-title":"Iterative Methods for the Solution of Equations","author":"J Traub","year":"1964","unstructured":"Traub, J.: Iterative Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs (1964)"},{"key":"9332_CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02242315","volume":"14","author":"H Vel Van de","year":"1974","unstructured":"Van de Vel, H.: A method for computing a root of a single nonlinear equation, including its multiplicity. Computing 14, 167\u2013171 (1974)","journal-title":"Computing"},{"key":"9332_CR32","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/1025077","volume":"25","author":"T Ypma","year":"1983","unstructured":"Ypma, T.: Finding a multiple zero by transformations and Newton-like methods. SIAM Rev. 25, 365\u2013378 (1983)","journal-title":"SIAM Rev."},{"key":"9332_CR33","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1090\/S0025-5718-04-01692-8","volume":"74","author":"Z Zeng","year":"2004","unstructured":"Zeng, Z.: Computing multiple roots of inexact polynomials. Math. Comput. 74, 869\u2013903 (2004)","journal-title":"Math. Comput."},{"key":"9332_CR34","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/992200.992209","volume":"30","author":"Z Zeng","year":"2004","unstructured":"Zeng, Z.: Algorithm 835: MULTROOT\u2014a Matlab package for computing polynomial roots and multiplicities. ACM Trans. Math. Softw. 30, 218\u2013236 (2004)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9332-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-009-9332-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9332-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:14Z","timestamp":1559365694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-009-9332-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,26]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9332"],"URL":"https:\/\/doi.org\/10.1007\/s11075-009-9332-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,26]]}}}