{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:52:59Z","timestamp":1720399979715},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,5]],"date-time":"2011-03-05T00:00:00Z","timestamp":1299283200000},"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":[[2011,10]]},"DOI":"10.1007\/s11075-011-9452-y","type":"journal-article","created":{"date-parts":[[2011,3,5]],"date-time":"2011-03-05T23:30:22Z","timestamp":1299367822000},"page":"179-201","source":"Crossref","is-referenced-by-count":4,"title":["New higher-order methods for the simultaneous inclusion of polynomial zeros"],"prefix":"10.1007","volume":"58","author":[{"given":"Miodrag S.","family":"Petkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mimica R.","family":"Milo\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an M.","family":"Milo\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,5]]},"reference":[{"key":"9452_CR1","volume-title":"Introduction to Interval Computations","author":"G Alefeld","year":"1983","unstructured":"Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic, New York (1983)"},{"key":"9452_CR2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0710031","volume":"10","author":"RP Brent","year":"1973","unstructured":"Brent, R.P.: Some efficient algorithms for solving systems of nonlinear equations. SIAM J. Numer. Anal. 10, 327\u2013344 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"9452_CR3","first-page":"151","volume-title":"Analytic Computational Complexity","author":"RP Brent","year":"1975","unstructured":"Brent, R.P.: Multi-precision zero-finding methods and the complexity of elementary function evaluation. In: Traub, J.F. (ed.) Analytic Computational Complexity, pp. 151\u2013176. Academic, New York (1975) (Reprinted with minor corrections in 1999)"},{"key":"9452_CR4","volume-title":"Modern Computer Arithmetic","author":"R Brent","year":"2011","unstructured":"Brent, R., Zimmermann, P.: Modern Computer Arithmetic. Cambridge University Press, Cambridge (2011)"},{"key":"9452_CR5","first-page":"809","volume":"71","author":"C Carstensen","year":"1991","unstructured":"Carstensen, C.: Anwendungen von Begleitmatrizen. Z. Angew. Math. Mech. 71, 809\u2013812 (1991)","journal-title":"Z. Angew. Math. Mech."},{"key":"9452_CR6","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/0168-9274(94)90008-6","volume":"13","author":"C Carstensen","year":"1994","unstructured":"Carstensen, C., Petkovi\u0107, M.S.: An improvement of Gargantini\u2019s simultaneous inclusion method for polynomial roots by Schroeder\u2019s correction. Appl. Numer. Math. 13, 453\u2013468 (1994)","journal-title":"Appl. Numer. Math."},{"key":"9452_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1206040.1206041","volume":"33","author":"L Fousse","year":"2007","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33, 1\u201315 (2007)","journal-title":"ACM Trans. Math. Softw."},{"key":"9452_CR8","unstructured":"Fujimoto, J., Ishikawa, T., Perret-Gallix, D.: High Precision Numerical Computations. Technical report, ACCP-N-1 (2005)"},{"key":"9452_CR9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0715032","volume":"15","author":"I Gargantini","year":"1978","unstructured":"Gargantini, I.: Further application of circular arithmetic: Schr\u00f6der-like algorithms with error bound for finding zeros of polynomials. SIAM J. Numer. Anal. 15, 497\u2013510 (1978)","journal-title":"SIAM J. Numer. Anal."},{"key":"9452_CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01404681","volume":"18","author":"I Gargantini","year":"1972","unstructured":"Gargantini, I., Henrici, P.: Circular arithmetic and the determination of polynomial zeros. Numer. Math. 18, 305\u2013320 (1972)","journal-title":"Numer. Math."},{"key":"9452_CR11","unstructured":"Granlund, T.: GNU MP; The GNU Multiple Precision Arithmetic Library, Edition 5.0.0 (2010)"},{"key":"9452_CR12","unstructured":"Herceg, $\\mbox{\\raise0.3ex\\hbox{-}\\kern-0.4em D}$ .D.: Computer Implemention and Interpretation of Iterative Methods for Solving Equations. Master thesis, University of Novi Sad, Novi Sad (1997)"},{"key":"9452_CR13","first-page":"120","volume-title":"Numerical Methods and Error Bounds Mathematical Research, vol. 89","author":"J Herzberger","year":"1996","unstructured":"Herzberger, J., Metzner, L.: On the Q-order and R-order of convergence for coupled sequences arising in iterative numerical processes. In: Alefeld, G., Herzberger, J. (eds.) Numerical Methods and Error Bounds Mathematical Research, vol. 89, pp. 120\u2013131. Akademie, Berlin (1996)","edition":"89"},{"key":"9452_CR14","unstructured":"Kravanja, P.: On Computing Zeros of Analytic Functions and Related Problems in Structured Numerical Linear Algebra. Ph.D. thesis, Katholieke Universiteit Leuven, Lueven (1999)"},{"key":"9452_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s006070050017","volume":"62","author":"P Kravanja","year":"1999","unstructured":"Kravanja, P.: A modification of Newton\u2019s method for analytic mappings having multiple zeros. Comput. 62, 129\u2013145 (1999)","journal-title":"Comput."},{"key":"9452_CR16","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1016\/j.amc.2009.06.065","volume":"215","author":"S Li","year":"2009","unstructured":"Li, S., Liao, X., Cheng, L.: A new fourth-order iterative method for finding multiple roots of nonlinear equations. Appl. Math. Comput. 215, 1288\u20131292 (2009)","journal-title":"Appl. Math. Comput."},{"key":"9452_CR17","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":"9452_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/zamm.19880680629","volume":"68","author":"A Neumaier","year":"1988","unstructured":"Neumaier, A.: An existence test for root clusters and multiple roots. Z. Angew. Math. Mech. 68, 256\u2013257 (1988)","journal-title":"Z. Angew. Math. Mech."},{"key":"9452_CR19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF03170428","volume":"20","author":"XM Niu","year":"2003","unstructured":"Niu, X.M., Sakurai, T.: A method for finding the zeros of polynomials using a companion matrix. Jpn. J. Ind. Appl. Math. 20, 239-256 (2003)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"9452_CR20","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheiboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York (1970)"},{"key":"9452_CR21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02243437","volume":"27","author":"MS Petkovi\u0107","year":"1981","unstructured":"Petkovi\u0107, M.S.: On a generalization of the root iterations for polynomial complex zeros in circular interval arithmetic. Computing 27, 37\u201355 (1981)","journal-title":"Computing"},{"key":"9452_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0083599","volume-title":"Iterative Methods for Simultaneous Inclusion of Polynomial Zeros","author":"MS Petkovi\u0107","year":"1989","unstructured":"Petkovi\u0107, M.S.: Iterative Methods for Simultaneous Inclusion of Polynomial Zeros. Springer, Berlin (1989)"},{"key":"9452_CR23","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0726043","volume":"26","author":"MS Petkovi\u0107","year":"1989","unstructured":"Petkovi\u0107, M.S.: On the Halley-like algorithms for the simultaneous approximation of polynomial complex zeros. SIAM J. Numer. Anal. 26, 740\u2013763 (1989)","journal-title":"SIAM J. Numer. Anal."},{"key":"9452_CR24","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/j.cam.2009.09.016","volume":"233","author":"MS Petkovi\u0107","year":"2009","unstructured":"Petkovi\u0107, M.S.: The self-validated method for polynomial zeros of high efficiency. J. Comput. Appl. Math. 233, 1175\u20131186 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9452_CR25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0898-1221(93)90143-J","volume":"25","author":"MS Petkovi\u0107","year":"1993","unstructured":"Petkovi\u0107, M.S., Carstensen, C.: On some improved inclusion methods for polynomial roots with Weierstrass\u2019 correction. Comput. Math. Appl. 25, 59\u201367 (1993)","journal-title":"Comput. Math. Appl."},{"key":"9452_CR26","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s002110050097","volume":"69","author":"MS Petkovi\u0107","year":"1995","unstructured":"Petkovi\u0107, M.S., Carstensen, C., Trajkovi\u0107, M.: Weierstrass\u2019 formula and zero-finding methods. Numer. Math. 69, 353\u2013372 (1995)","journal-title":"Numer. Math."},{"key":"9452_CR27","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.amc.2004.10.047","volume":"169","author":"MS Petkovi\u0107","year":"2005","unstructured":"Petkovi\u0107, M.S., Milo\u0161evi\u0107, D.: Improved Halley-like methods for the inclusion of polynomial zeros. Appl. Math. Comput. 169, 417\u2013436 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9452_CR28","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1080\/00207160600727310","volume":"83","author":"MS Petkovi\u0107","year":"2006","unstructured":"Petkovi\u0107, M.S., Milo\u0161evi\u0107, D.M.: On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros. Int. J. Comput. Math. 83, 299\u2013317 (2006)","journal-title":"Int. J. Comput. Math."},{"key":"9452_CR29","volume-title":"Complex Interval Arithmetic and its Applications","author":"MS Petkovi\u0107","year":"1998","unstructured":"Petkovi\u0107, M.S., Petkovi\u0107, L.D.: Complex Interval Arithmetic and its Applications. Wiley, Berlin (1998)"},{"key":"9452_CR30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplication grosser Zahlen. Computing 7, 281\u2013292 (1971)","journal-title":"Computing"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9452-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9452-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:16Z","timestamp":1559365696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9452-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,5]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9452"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9452-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,5]]}}}