{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:50Z","timestamp":1760061710873},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_51","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"434-444","source":"Crossref","is-referenced-by-count":9,"title":["Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests"],"prefix":"10.1007","author":[{"given":"Chee","family":"Yap","sequence":"first","affiliation":[]},{"given":"Michael","family":"Sagraloff","sequence":"additional","affiliation":[]},{"given":"Vikram","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"51_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s11786-011-0069-2","volume":"4","author":"P. Batra","year":"2010","unstructured":"Batra, P.: Globally convergent, iterative path-following for algebraic equations. Math. in Computer Sci.\u00a04(4), 507\u2013537 (2010); Special Issue","journal-title":"Math. in Computer Sci."},{"key":"51_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)"},{"issue":"4","key":"51_CR3","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V. Brattka","year":"1998","unstructured":"Brattka, V., Hertling, P.: Feasible real random access machines. J. of Complexity\u00a014(4), 490\u2013526 (1998)","journal-title":"J. of Complexity"},{"issue":"2","key":"51_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-0427(01)00371-5","volume":"138","author":"M. Dellnitz","year":"2002","unstructured":"Dellnitz, M., Sch\u00fctze, O., Zheng, Q.: Locating all the zeros of an analytic function in one complex variable. J. Comput. Appl. Math.\u00a0138(2), 325\u2013333 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"51_CR5","first-page":"246","volume-title":"In Proc. 7th Asian Symp. on Computer Math. (ASCM)","author":"Z. Du","year":"2005","unstructured":"Du, Z., Yap, C.: Absolute approximation of the general hypergeometric functions. In: In Proc. 7th Asian Symp. on Computer Math (ASCM), December 8-10, pp. 246\u2013249. KIAS, Seoul (2005)"},{"key":"51_CR6","volume-title":"Algorithms and Theory of Computation Handbook","author":"I.Z. Emiris","year":"2012","unstructured":"Emiris, I.Z., Pan, V.Y., Tsigaridas, E.P.: Algebraic and numerical algorithms. In: Atallah, M.J., Blanton, M. (eds.) Algorithms and Theory of Computation Handbook, 3rd edn., vol.\u00a01, ch.\u00a017. CRC Press Inc., Boca Raton (2012)","edition":"3"},{"issue":"3","key":"51_CR7","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. Comp. Math.\u00a05(3), 257\u2013311 (2005)","journal-title":"Found. Comp. Math."},{"key":"51_CR8","volume-title":"CGAL Arrangements and Their Applications","author":"D. Halperin","year":"2012","unstructured":"Halperin, D., Fogel, E., Wein, R.: CGAL Arrangements and Their Applications. Springer, Berlin (2012)"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, L.A., Ogihara, M.: The Complexity Theory Companion. Springer (2002)","DOI":"10.1007\/978-3-662-04880-1"},{"issue":"1","key":"51_CR10","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cam.2008.10.014","volume":"228","author":"T. Johnson","year":"2009","unstructured":"Johnson, T., Tucker, W.: Enclosing all zeros of an analytic function - a rigorous approach. J. Comput. Appl. Math.\u00a0228(1), 418\u2013423 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"51_CR11","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Basel (1991)"},{"key":"51_CR12","volume-title":"The Geometry of Zeros of a Polynomial in a Complex Variable","author":"M. Marden","year":"1949","unstructured":"Marden, M.: The Geometry of Zeros of a Polynomial in a Complex Variable. Math. Surveys. American Math. Soc., New York (1949)"},{"issue":"2","key":"51_CR13","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.\u00a0199(2), 263\u2013270 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"51_CR14","first-page":"245","volume-title":"Proc. Symp. on Geometry Processing","author":"S. Plantinga","year":"2004","unstructured":"Plantinga, S., Vegter, G.: Isotopic approximation of implicit curves and surfaces. In: Proc. Symp. on Geometry Processing, pp. 245\u2013254. ACM Press, New York (2004)"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Rahman, Q.I., Schmeisser, G.: Analytic Theory of Polynomials. OUP (2002)","DOI":"10.1093\/oso\/9780198534938.001.0001"},{"key":"51_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0377-0427(03)00381-9","volume":"156","author":"S.M. Rump","year":"2003","unstructured":"Rump, S.M.: Ten methods to bound multiple roots of polynomials. J. Computational and Applied Mathematics\u00a0156, 403\u2013432 (2003)","journal-title":"J. Computational and Applied Mathematics"},{"key":"51_CR18","first-page":"353","volume-title":"36th ISSAC","author":"M. Sagraloff","year":"2011","unstructured":"Sagraloff, M., Yap, C.K.: A simple but exact and efficient algorithm for complex root isolation. In: 36th ISSAC, June 8-11, pp. 353\u2013360. San Jose, California (2011)"},{"key":"51_CR19","unstructured":"Traub, J., Wasilkowski, G., Wo\u017aniakowski, H.: Information-Based Complexity. Academic Press, Inc. (1988)"},{"key":"51_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"},{"issue":"5","key":"51_CR21","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.jco.2005.06.007","volume":"21","author":"J.-C. Yakoubsohn","year":"2005","unstructured":"Yakoubsohn, J.-C.: Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions. J. of Complexity\u00a021(5), 652\u2013690 (2005)","journal-title":"J. of Complexity"},{"key":"51_CR22","first-page":"2","volume-title":"IEEE 9th Int. Symp. of Voronoi Diagrams in Sci. and Eng. (ISVD)","author":"C. Yap","year":"2012","unstructured":"Yap, C., Sharma, V., Lien, J.-M.: Towards Exact Numerical Voronoi diagrams. In: IEEE 9th Int. Symp. of Voronoi Diagrams in Sci. and Eng (ISVD), June 27-29, pp. 2\u201316. Rutgers U, NJ (2012); Invited Talk"},{"key":"51_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-85521-7_12","volume-title":"Reliable Implementation of Real Number Algorithms: Theory and Practice","author":"C.K. Yap","year":"2008","unstructured":"Yap, C.K.: Theory of real computation according to EGC. In: Hertling, P., Hoffmann, C.M., Luther, W., Revol, N. (eds.) Real Number Algorithms. LNCS, vol.\u00a05045, pp. 193\u2013237. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T15:40:36Z","timestamp":1715442036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}