{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:04:23Z","timestamp":1648681463465},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:00:00Z","timestamp":1122854400000},"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":[[2005,8]]},"DOI":"10.1007\/s11075-004-8199-0","type":"journal-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T14:41:59Z","timestamp":1112798519000},"page":"415-435","source":"Crossref","is-referenced-by-count":9,"title":["A higher order family for the simultaneous inclusion of multiple zeros of polynomials"],"prefix":"10.1007","volume":"39","author":[{"given":"Miodrag S.","family":"Petkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an M.","family":"Milo\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8199_CR1","volume-title":"Introduction to Interval Computation","author":"G. Alefeld","year":"1983","unstructured":"G. Alefeld and J. Herzberger, Introduction to Interval Computation (Academic Press, New York, 1983)."},{"key":"8199_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1019199917103","volume":"23","author":"D.A. Bini","year":"2000","unstructured":"D.A. Bini and G. Fiorentino, Design, analysis and implementation of a multiprecision polynomial rootfinder, Numer. Algorithms 23 (2000) 127\u2013173.","journal-title":"Numer. Algorithms"},{"key":"8199_CR3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/0168-9274(94)90008-6","volume":"13","author":"C. Carstensen","year":"1994","unstructured":"C. Carstensen and M.S. Petkovi\u0107, An improvement of Gargantini\u2019s simultaneous inclusion method for polynomial roots by Schroeder\u2019s correction, Appl. Numer. Math. 13 (1994) 453\u2013468.","journal-title":"Appl. Numer. Math."},{"key":"8199_CR4","unstructured":"T.J. Dekker, Newton\u2013Laguerre iteration, in: Programmation en Math\u00e9matiques Num\u00e9riques, Colloquium International du CNRS (Besan\u00e7on, 1968) pp. 189\u2013200."},{"key":"8199_CR5","first-page":"195","volume-title":"Proc. of III Manitoba Conf. on Numer. Math., Winnipeg 1973","author":"P. Gargantini","year":"1974","unstructured":"P. Gargantini, Parallel algorithms for the determination of polynomial zeros, in: Proc. of III Manitoba Conf. on Numer. Math., Winnipeg 1973, eds. R. Thomas and H.C. Williams (Utilitas Mathematica Publ., Winnipeg, 1974) pp. 195\u2013211."},{"key":"8199_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01395948","volume":"26","author":"I. Gargantini","year":"1976","unstructured":"I. Gargantini, Parallel Laguerre iterations: The complex case, Numer. Math. 26 (1976) 317\u2013323.","journal-title":"Numer. Math."},{"key":"8199_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0715032","volume":"15","author":"I. Gargantini","year":"1978","unstructured":"I. Gargantini, Further application of circular arithmetic: Schr\u00f6der-like algorithms with error bound for finding zeros of polynomials, SIAM J. Numer. Anal. 15 (1978) 497\u2013510.","journal-title":"SIAM J. Numer. Anal."},{"key":"8199_CR8","volume-title":"Applied and Computational Complex Analysis, Vol. I","author":"P. Henrici","year":"1974","unstructured":"P. Henrici, Applied and Computational Complex Analysis, Vol. I (Wiley, New York, 1974)."},{"key":"8199_CR9","unstructured":"\u00d0.D. Herceg, Computer implementation and interpretation of iterative methods for solving equations, Master theses, University of Novi Sad, Novi Sad (1997)."},{"key":"8199_CR10","series-title":"Mathematical Research","first-page":"120","volume-title":"Numerical Methods and Error Bounds","author":"J. Herzberger","year":"1996","unstructured":"J. Herzberger and L. Metzner, On the Q-order and R-order of convergence for coupled sequences arising in iterative numerical processes, in: Numerical Methods and Error Bounds, eds. G. Alefeld and J. Herzberger, Mathematical Research, Vol. 89 (Akademie Verlag, Berlin, 1996) pp. 120\u2013131."},{"key":"8199_CR11","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1006\/jsco.1997.0160","volume":"24","author":"V. Hribernig","year":"1997","unstructured":"V. Hribernig and H.J. Stetter, Detection and validation of clusters of polynomial zeros, J. Symbolic Comput. 24 (1997) 667\u2013681.","journal-title":"J. Symbolic Comput."},{"key":"8199_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02240070","volume":"36","author":"I.O. Iokimidis","year":"1986","unstructured":"I.O. Iokimidis and E.G. Anastasselou, On the simultaneous determination of zeros of analytic or sectionally analytic functions, Computing 36 (1986) 239\u2013246.","journal-title":"Computing"},{"key":"8199_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02242141","volume":"30","author":"R.F. King","year":"1983","unstructured":"R.F. King, Improving the Van de Vel root-finding method, Computing 30 (1983) 373\u2013378.","journal-title":"Computing"},{"key":"8199_CR14","unstructured":"P. Kravanja, On computing zeros of analytic functions and related problems in structured numerical linear algebra, Ph.D. thesis, Katholieke Universiteit Leuven, Lueven (1999)."},{"key":"8199_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s006070050017","volume":"62","author":"P. Kravanja","year":"1999","unstructured":"P. Kravanja, A modification of Newton\u2019s method for analytic mappings having multiple zeros, Computing 62 (1999) 129\u2013145.","journal-title":"Computing"},{"key":"8199_CR16","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1023\/A:1022387106878","volume":"39","author":"P. Kravanja","year":"1999","unstructured":"P. Kravanja, T. Sakurai and M. van Barel, On locating clusters of zeros of analytic functions, BIT 39 (1999) 646\u2013682.","journal-title":"BIT"},{"key":"8199_CR17","series-title":"AMS Mathematical Surveys","volume-title":"Geometry of Polynomials","author":"M. Marden","year":"1996","unstructured":"M. Marden, Geometry of Polynomials, AMS Mathematical Surveys, Vol. 3 (Amer. Math. Soc., Providence, RI, 1996)."},{"key":"8199_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/zamm.19880680629","volume":"68","author":"A. Neumaier","year":"1988","unstructured":"A. Neumaier, An existence test for root clusters and multiple roots, Z. Angew. Math. Mech. 68 (1988) 256\u2013257.","journal-title":"Z. Angew. Math. Mech."},{"key":"8199_CR19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-0427(03)00380-7","volume":"156","author":"A. Neumaier","year":"2003","unstructured":"A. Neumaier, Enclosing clusters of zeros of polynomials, J. Comput. Appl. Math. 156 (2003) 389\u2013401.","journal-title":"J. Comput. Appl. Math."},{"key":"8199_CR20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF03170428","volume":"20","author":"X.M. Niu","year":"2003","unstructured":"X.M. Niu and T. Sakurai, A method for finding the zeros of polynomials using a companion matrix, Japan J. Industr. Appl. Math. 20 (2003) 239\u2013256.","journal-title":"Japan J. Industr. Appl. Math."},{"key":"8199_CR21","unstructured":"X.M. Niu, T. Sakurai and H. Sugiura, On bounding clusters of zeros of analytic functions, Preprint (2003)."},{"key":"8199_CR22","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970)."},{"key":"8199_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0898-1221(96)00080-6","volume":"31","author":"V.Y. Pan","year":"1996","unstructured":"V.Y. Pan, Optimal and nearly optimal algorithms for approximating polynomial zeros, Comput. Math. Appl. 31 (1996) 97\u2013138.","journal-title":"Comput. Math. Appl."},{"key":"8199_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0083599","volume-title":"Iterative Methods for Simultaneous Inclusion of Polynomial Zeros","author":"M.S. Petkovi\u0107","year":"1989","unstructured":"M.S. Petkovi\u0107, Iterative Methods for Simultaneous Inclusion of Polynomial Zeros (Springer-Verlag, Berlin, 1989)."},{"key":"8199_CR25","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0726043","volume":"26","author":"M.S. Petkovi\u0107","year":"1989","unstructured":"M.S. Petkovi\u0107, On Halley-like algorithms for the simultaneous approximation of polynomial complex zeros, SIAM J. Numer. Math. 26 (1989) 740\u2013763.","journal-title":"SIAM J. Numer. Math."},{"key":"8199_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s006070050014","volume":"62","author":"M.S. Petkovi\u0107","year":"1999","unstructured":"M.S. Petkovi\u0107, Halley-like method with corrections for the inclusion of polynomial zeros, Computing 62 (1999) 69\u201388.","journal-title":"Computing"},{"key":"8199_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0898-1221(93)90143-J","volume":"25","author":"M.S. Petkovi\u0107","year":"1993","unstructured":"M.S. Petkovi\u0107 and C. Carstensen, On some improved inclusion methods for polynomial roots with Weierstrass\u2019 correction, Comput. Math. Appl. 25 (1993) 59\u201367.","journal-title":"Comput. Math. Appl."},{"key":"8199_CR28","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s002110050097","volume":"69","author":"M.S. Petkovi\u0107","year":"1995","unstructured":"M.S. Petkovi\u0107, C. Carstensen and M. Trajkovi\u0107, Weierstrass\u2019 formula and zero-finding methods, Numer. Math. 69 (1995) 353\u2013372.","journal-title":"Numer. Math."},{"key":"8199_CR29","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/B:REOM.0000047094.39609.f6","volume":"10","author":"M.S. Petkovi\u0107","year":"2004","unstructured":"M.S. Petkovi\u0107 and D. Milo\u0161evi\u0107, Ostrowski-like method with corrections for the inclusion of polynomial zeros, Reliable Computing 10 (2004) 437\u2013467.","journal-title":"Reliable Computing"},{"key":"8199_CR30","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/0898-1221(89)90041-2","volume":"17","author":"M.S. Petkovi\u0107","year":"1989","unstructured":"M.S. Petkovi\u0107 and L.D. Petkovi\u0107, On a computational test for the existence of polynomial zero, Comput. Math. Appl. 17 (1989) 1109\u20131114.","journal-title":"Comput. Math. Appl."},{"key":"8199_CR31","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.apnum.2004.01.004","volume":"50","author":"M.S. Petkovi\u0107","year":"2004","unstructured":"M.S. Petkovi\u0107, T. Sakurai and L. Ran\u010di\u0107, Family of simultaneous methods of Hansen\u2013Patrick\u2019s type, Appl. Numer. Math. 50 (2004) 489\u2013510.","journal-title":"Appl. Numer. Math."},{"key":"8199_CR32","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0377-0427(03)00381-9","volume":"156","author":"S.M. Rump","year":"2003","unstructured":"S.M. Rump, Ten methods to bound multiple roots of polynomials, J. Comput. Appl. Math. 156 (2003) 403\u2013432.","journal-title":"J. Comput. Appl. Math."},{"key":"8199_CR33","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02237952","volume":"26","author":"J.W. Schmidt","year":"1981","unstructured":"J.W. Schmidt, On the R-order of coupled sequences, Computing 26 (1981) 333\u2013342.","journal-title":"Computing"},{"key":"8199_CR34","first-page":"70","volume":"4","author":"X. Wang","year":"1984","unstructured":"X. Wang and S. Zheng, A family of parallel and interval iterations for finding simultaneously all roots of a polynomial with rapid convergence (I), J. Comput. Math. 4 (1984) 70\u201376.","journal-title":"J. Comput. Math."},{"key":"8199_CR35","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1006\/jcom.2000.0555","volume":"16","author":"J.C. Yakoubsohn","year":"2000","unstructured":"J.C. Yakoubsohn, Finding a cluster of zeros of univariate polynomials, J. Complexity 16 (2000) 603\u2013638.","journal-title":"J. Complexity"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-004-8199-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-004-8199-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-004-8199-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:06Z","timestamp":1559365686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-004-8199-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["8199"],"URL":"https:\/\/doi.org\/10.1007\/s11075-004-8199-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}