{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:20Z","timestamp":1740099140720,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319964171"},{"type":"electronic","value":"9783319964188"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96418-8_28","type":"book-chapter","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T06:57:13Z","timestamp":1531465033000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Implementation of a Near-Optimal Complex Root Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Imbach","sequence":"first","affiliation":[]},{"given":"Victor Y.","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,14]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp. 71\u201378. ACM (2016)","DOI":"10.1145\/2930889.2930939"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2017.03.009","volume":"86","author":"R Becker","year":"2018","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration. J. Symb. Comput. 86, 51\u201396 (2018)","journal-title":"J. Symb. Comput."},{"issue":"2\u20133","key":"28_CR3","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 rootfinder. Numer. Algorithms 23(2\u20133), 127\u2013173 (2000)","journal-title":"Numer. Algorithms"},{"key":"28_CR4","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."},{"issue":"1\u20132","key":"28_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(00)00231-6","volume":"109","author":"H Br\u00f6nnimann","year":"2001","unstructured":"Br\u00f6nnimann, H., Burnikel, C., Pion, S.: Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Appl. Math. 109(1\u20132), 25\u201347 (2001)","journal-title":"Discrete Appl. Math."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Pan, V.Y., Tsigaridas, E.P.: Algebraic algorithms. In: Computing Handbook, Third Edition: Computer Science and Software Engineering, pp. 10:1\u201310:30. Chapman and Hall\/CRC (2014)","DOI":"10.1201\/b16812-13"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1006\/jsco.2002.0526","volume":"33","author":"S Fortune","year":"2002","unstructured":"Fortune, S.: An iterated eigenvalue algorithm for approximating roots of univariate polynomials. J. Symb. Comput. 33(5), 627\u2013646 (2002)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10208-004-0144-z","volume":"5","author":"M Giusti","year":"2005","unstructured":"Giusti, M., Lecerf, G., Salvy, B., Yakoubsohn, J.-C.: On location and approximation of clusters of zeros of analytic functions. Found. Comput. Math. 5(3), 257\u2013311 (2005)","journal-title":"Found. Comput. Math."},{"key":"28_CR9","unstructured":"Gourdon, X.: Combinatoire, Algorithmique et G\u00e9om\u00e9trie des Polynomes. Ph.D. thesis, \u00c9cole Polytechnique (1996)"},{"issue":"6","key":"28_CR10","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1006\/jsco.1997.0160","volume":"24","author":"V Hribernig","year":"1997","unstructured":"Hribernig, V., Stetter, H.J.: Detection and validation of clusters of polynomial zeros. J. Symb. Comput. 24(6), 667\u2013681 (1997)","journal-title":"J. Symb. Comput."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Kobel, A., Rouillier, F., Sagraloff, M.: Computing real roots of real polynomials... and now for real! In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp. 303\u2013310. ACM (2016)","DOI":"10.1145\/2930889.2930937"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cam.2005.08.038","volume":"199","author":"X-M Niu","year":"2007","unstructured":"Niu, X.-M., Sakurai, T., Sugiura, H.: A verified method for bounding clusters of zeros of analytic functions. J. Comput. Appl. Math. 199(2), 263\u2013270 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1006\/jsco.2002.0531","volume":"33","author":"VY Pan","year":"2002","unstructured":"Pan, V.Y.: Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding. J. Symb. Comput. 33(5), 701\u2013733 (2002)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cam.2003.08.015","volume":"162","author":"F Rouillier","year":"2004","unstructured":"Rouillier, F., Zimmermann, P.: Efficient isolation of polynomial\u2019s real roots. J. Comput. Appl. Math. 162(1), 33\u201350 (2004)","journal-title":"J. Comput. Appl. Math."},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jsc.2015.03.004","volume":"73","author":"M Sagraloff","year":"2016","unstructured":"Sagraloff, M., Mehlhorn, K.: Computing real roots of real polynomials. J. Symb. Comput. 73, 46\u201386 (2016)","journal-title":"J. Symb. Comput."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-39053-1_51","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"C Yap","year":"2013","unstructured":"Yap, C., Sagraloff, M., Sharma, V.: Analytic root clustering: a complete algorithm using soft zero tests. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 434\u2013444. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_51"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96418-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T15:35:53Z","timestamp":1571585753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96418-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319964171","9783319964188"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96418-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}