{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:15Z","timestamp":1740123675741,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T00:00:00Z","timestamp":1544572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11075-018-0641-9","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T03:29:22Z","timestamp":1544585362000},"page":"1065-1084","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An effective implementation of a modified Laguerre method for the roots of a polynomial"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8708-4336","authenticated-orcid":false,"given":"Thomas R.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,12]]},"reference":[{"issue":"122","key":"641_CR1","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. Comput. 27(122), 339\u2013344 (1973)","journal-title":"Math. Comput."},{"issue":"15","key":"641_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"AM Andrew","year":"1979","unstructured":"Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Info. Proc. Lett. 9(15), 216\u2013219 (1979)","journal-title":"Info. Proc. Lett."},{"issue":"3","key":"641_CR3","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/140983434","volume":"36","author":"JL Aurentz","year":"2015","unstructured":"Aurentz, J.L., Mach, T., Vandebril, R., Watkins, D.S.: Fast and backward stable computation of roots of polynomials. SIAM J. Matrix Anal. Appl. 36(3), 942\u2013973 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"641_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02207694","volume":"13","author":"DA Bini","year":"1996","unstructured":"Bini, D.A.: Numerical computation of polynomial zeros by means of Aberth\u2019s method. Numer. Algor. 13, 179\u2013200 (1996)","journal-title":"Numer. Algor."},{"key":"641_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1019199917103","volume":"23","author":"DA Bini","year":"2000","unstructured":"Bini, D.A., Fiorentino, G.: Design, analysis, and implementation of a multiprecision polynomial root finder. Numer. Algor. 23, 127\u2013173 (2000)","journal-title":"Numer. Algor."},{"key":"641_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.cam.2013.04.037","volume":"272","author":"DA Bini","year":"2014","unstructured":"Bini, D.A., Robol, L.: Solving secular and polynomial equations: a multiprecision algorithm. J. Comput. Appl. Math. 272, 276\u2013292 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"641_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/BF01385904","volume":"5","author":"W B\u00f6rsch-Supan","year":"1963","unstructured":"B\u00f6rsch-Supan, W.: A posteriori error bounds for the zeros of polynomials. Numer. Math. 5, 380\u2013398 (1963)","journal-title":"Numer. Math."},{"key":"641_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719673","volume-title":"Lectures on Finite Precision Computations. Software, Environments and Tools","author":"F Chaitin-Chatelin","year":"1996","unstructured":"Chaitin-Chatelin, F., Frayss\u00e9, V.: Lectures on Finite Precision Computations. Software, Environments and Tools. SIAM, Philadelphia (1996)"},{"key":"641_CR9","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, S., Gu, M., Xia, J., Zhu, J.: A fast QR algorithm for companion matrices. In: Recent Advances in Matrix and Operator Theory, pp. 111\u2013143. Basel, Birkh\u00e4user (2008)","DOI":"10.1007\/978-3-7643-8539-2_7"},{"key":"641_CR10","doi-asserted-by":"crossref","unstructured":"Chen, T.C.: Improving Laguerre\u2019s method to cope with symmetry pitfalls in polynomial root-finding. In: Proceedings of the Eigth International Colloquium on Differential Equations, pp. 105\u2013110. VSP, Utrecht (1998)","DOI":"10.1515\/9783112313923-017"},{"issue":"2","key":"641_CR11","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(2), 107\u2013108 (1967)","journal-title":"Commun. ACM"},{"issue":"6","key":"641_CR12","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0718069","volume":"18","author":"LV Foster","year":"1981","unstructured":"Foster, L.V.: Generalizations of Laguerre\u2019s method: higher order methods. SIAM J. Numer. Anal. 18(6), 1004\u20131018 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"641_CR13","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1137\/0915064","volume":"15","author":"S Goedecker","year":"1994","unstructured":"Goedecker, S.: Remarks on algorithms to find roots of polynomials. SIAM J. Sci. Comput. 15(5), 1059\u20131063 (1994)","journal-title":"SIAM J. Sci. Comput."},{"key":"641_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Comput. Surv. 23, 5\u201348 (1991)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"641_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1093\/comjnl\/15.3.268","volume":"15","author":"J Grad","year":"1972","unstructured":"Grad, J., Zakraj\u0161ek, E.: LR algorithm with Laguerre shift for symmetric tridiagonal matrices. Comput. J. 15(3), 268\u2013270 (1972)","journal-title":"Comput. J."},{"key":"641_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01396176","volume":"27","author":"E Hansen","year":"1977","unstructured":"Hansen, E., Patrick, M.: A family of root finding methods. Numer. Math. 27, 257\u2013269 (1977)","journal-title":"Numer. Math."},{"issue":"4","key":"641_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01933450","volume":"17","author":"E Hansen","year":"1977","unstructured":"Hansen, E., Patrick, M., Rusnak, J.: Some modifications of Laguerre\u2019s method. BIT 17(4), 409\u2013417 (1977)","journal-title":"BIT"},{"key":"641_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (2002)"},{"issue":"1","key":"641_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/355626.355632","volume":"1","author":"MA Jenkins","year":"1975","unstructured":"Jenkins, M.A., Traub, J.F.: Principles for testing polynomial zerofinding programs. ACM Trans. Math. Softw. 1(1), 26\u201334 (1975)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"641_CR20","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/0704042","volume":"4","author":"W. Kahan","year":"1967","unstructured":"Kahan, W.: Laguerre\u2019s method and a circle which contains at least one zero of a polynomial. SIAM J. Numer. Anal, 4(3) (1967)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"641_CR21","volume-title":"Oeuvres de Laguerre","author":"EN Laguerre","year":"1898","unstructured":"Laguerre, E.N.: Oeuvres de Laguerre. Gauthier-Villars and Fils, Paris (1898)"},{"key":"641_CR22","volume-title":"Lambda-Matrices and Vibrating Systems International Series of Monographs on Pure and Applied Mathematics, vol. 94","author":"P Lancaster","year":"1966","unstructured":"Lancaster, P.: Lambda-Matrices and Vibrating Systems International Series of Monographs on Pure and Applied Mathematics, vol. 94. Pergamon, Oxford (1966)"},{"issue":"3","key":"641_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0893-9659(90)90140-7","volume":"3","author":"CT Lenard","year":"1990","unstructured":"Lenard, C.T.: Laguerre\u2019s iteration and the method of traces for eigenproblems. Appl. Math. Lett. 3(3), 73\u201374 (1990)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"641_CR24","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BF01937332","volume":"23","author":"MR Leuze","year":"1983","unstructured":"Leuze, M.R.: A hybrid Laguerre method. BIT 23(1), 132\u2013138 (1983)","journal-title":"BIT"},{"key":"641_CR25","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01600333","volume":"5","author":"VH Maehly","year":"1954","unstructured":"Maehly, V.H.: Zur iterativen aufl\u00f6sung algebraisher gleichungen. Z. Angew. Math. Phys. 5, 260\u2013263 (1954)","journal-title":"Z. Angew. Math. Phys."},{"key":"641_CR26","volume-title":"Iterative Methods for Roots of Polynomials.","author":"W Mekwi","year":"2001","unstructured":"Mekwi, W.: Iterative Methods for Roots of Polynomials. Master\u2019s thesis, University of Oxford, Oxford (2001)"},{"key":"641_CR27","unstructured":"MPFUN: Multiprecision Software, http:\/\/www.netlib.org\/mpfun . Accessed 18 June 2018 (2005)"},{"key":"641_CR28","unstructured":"NAG: Nag Library, Mark 26, https:\/\/www.nag.com\/numeric\/fl\/nagdoc_latest\/html\/c02\/c02aff.html . Accessed 27 May 2018 (2017)"},{"issue":"2","key":"641_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/S0036144595288554","volume":"39","author":"VY Pan","year":"1997","unstructured":"Pan, V.Y.: Solving a polynomial equation: some history and recent progress. SIAM Rev. 39(2), 187\u2013220 (1997)","journal-title":"SIAM Rev."},{"issue":"87","key":"641_CR30","first-page":"464","volume":"18","author":"B Parlett","year":"1964","unstructured":"Parlett, B.: Laguerre\u2019s method applied to the matrix eigenvalue problem. Math. Comput. 18(87), 464\u2013485 (1964)","journal-title":"Math. Comput."},{"issue":"2","key":"641_CR31","first-page":"393","volume":"5","author":"AE Pellet","year":"1881","unstructured":"Pellet, A.E.: Sur un mode de s\u00e9paration des racines des \u00e9quations et la formule de lagrange. Bull. Sci. Math. 5(2), 393\u2013395 (1881)","journal-title":"Bull. Sci. Math."},{"key":"641_CR32","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.camwa.2004.01.010","volume":"48","author":"MS Petkovi\u0107","year":"2004","unstructured":"Petkovi\u0107, M.S., Ili\u0107, S., Ran\u010di\u0107, L.: The convergence of a family of parallel zero-finding methods. Comput. Math. Appl. 48, 455\u2013467 (2004)","journal-title":"Comput. Math. Appl."},{"issue":"10","key":"641_CR33","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0898-1221(97)00206-X","volume":"34","author":"MS Petkovi\u0107","year":"1997","unstructured":"Petkovi\u0107, M.S., Ili\u0107, S., Tri\u010dkovi\u0107, S.: A family of simultaneous zero finding methods. Comput. Math. Appl. 34(10), 49\u201359 (1997)","journal-title":"Comput. Math. Appl."},{"key":"641_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-7091-6217-0_15","volume-title":"Topics in Numerical Analysis","author":"M. S. Petkovi\u0107","year":"2001","unstructured":"Petkovi\u0107, M.S., Petkovi\u0107, L., \u017eivkovi\u0107, D.: Laguerre-like methods for the simultaneous approximation of polynomial zeros. In: Topics in Numerical Analysis, pp. 189\u2013209. Springer, Vienna (2001)"},{"key":"641_CR35","volume-title":"Numerical Recipes: The Art of Scientific Computing","author":"WH Press","year":"2007","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes: The Art of Scientific Computing, 3rd edn. Cambridge University Press, New York (2007)","edition":"3rd edn."},{"issue":"1","key":"641_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/0020739740050112","volume":"5","author":"KA Redish","year":"1974","unstructured":"Redish, K.A.: On Laguerre\u2019s method. Int. J. Math. Educ. Sci. Tech. 5(1), 91\u2013102 (1974)","journal-title":"Int. J. Math. Educ. Sci. Tech."},{"key":"641_CR37","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/MSP.2003.1253552","volume":"20","author":"GA Sitton","year":"2003","unstructured":"Sitton, G.A., Burrus, C.S., Fox, J.W., Treitel, S.: Factoring very-high-degree polynomials. IEEE Sig. Proc. Mag. 20, 27\u201342 (2003)","journal-title":"IEEE Sig. Proc. Mag."},{"key":"641_CR38","unstructured":"Smith, B.T.: A Zero Finding Algorithm using Laguerre\u2019s Method. Master\u2019s thesis, University of Toronto, Toronto (1967)"},{"key":"641_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/1967743","volume":"26","author":"JL Walsh","year":"1924","unstructured":"Walsh, J.L.: On Pellet\u2019s theorem concerning the roots of a polynomial. Ann. Math. 26, 59\u201364 (1924)","journal-title":"Ann. Math."},{"key":"641_CR40","unstructured":"Wilkinson, J.H.: Rounding Errors in Algebraic Processes. Prentice-Hall Inc (1963)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0641-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0641-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0641-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T10:24:39Z","timestamp":1605608679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0641-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0641-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2018,12,12]]},"assertion":[{"value":"7 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}