{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:58:49Z","timestamp":1726041529893},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268305"},{"type":"electronic","value":"9783030268312"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26831-2_29","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:07:07Z","timestamp":1565809627000},"page":"451-457","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Zaderman","sequence":"first","affiliation":[]},{"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"29_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":"29_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."},{"key":"29_CR3","volume-title":"Applied and Computational Complex Analysis. vol. 1, Power Series, Integration, Conformal Mapping, Location of Zeros","author":"P Henrici","year":"1974","unstructured":"Henrici, P.: Applied and Computational Complex Analysis. vol. 1, Power Series, Integration, Conformal Mapping, Location of Zeros. John Wiley, New York (1974)"},{"key":"29_CR4","unstructured":"Henrici, P., Gargantini, I.: Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial. In: Constructive Aspects of the Fundamental Theorem of Algebra, pp. 77\u2013113. Wiley-Interscience New York (1969)"},{"issue":"6","key":"29_CR5","first-page":"464","volume":"66","author":"AS Householder","year":"1959","unstructured":"Householder, A.S.: Dandelin, Loba\u010devskii, or Graeffe? Am. Math. Mon. 66(6), 464\u2013466 (1959)","journal-title":"Am. Math. Mon."},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-96418-8_28","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"R Imbach","year":"2018","unstructured":"Imbach, R., Pan, V.Y., Yap, C.: Implementation of a near-optimal complex root clustering algorithm. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 235\u2013244. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-96418-8_28"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jcom.1999.0532","volume":"16","author":"VY Pan","year":"2000","unstructured":"Pan, V.Y.: Approximating complex polynomial zeros: modified weyl\u2019s quadtree construction and improved newton\u2019s iteration. J. Complex. 16(1), 213\u2013264 (2000)","journal-title":"J. Complex."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","volume":"3","author":"J Renegar","year":"1987","unstructured":"Renegar, J.: On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complex. 3(2), 90\u2013113 (1987)","journal-title":"J. Complex."},{"key":"29_CR9","volume-title":"The fundamental theorem of algebra in terms of computational complexity","author":"A Sch\u00f6nhage","year":"1982","unstructured":"Sch\u00f6nhage, A.: The fundamental theorem of algebra in terms of computational complexity. Manuscript. Univ. of T\u00fcbingen, Germany (1982)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01188076","volume":"20","author":"H Weyl","year":"1924","unstructured":"Weyl, H.: Randbemerkungen zu hauptproblem der mathematik. Mathematische Zeitschrift 20, 131\u2013150 (1924)","journal-title":"Mathematische Zeitschrift"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.jco.2012.02.001","volume":"28","author":"JLG Zapata","year":"2012","unstructured":"Zapata, J.L.G., Mart\u00edn, J.C.D.: A geometric algorithm for winding number computation with complexity analysis. J. Complex. 28(3), 320\u2013345 (2012)","journal-title":"J. Complex."},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.camwa.2013.11.013","volume":"67","author":"JLG Zapata","year":"2014","unstructured":"Zapata, J.L.G., Mart\u00edn, J.C.D.: Finding the number of roots of a polynomial in a plane region using the winding number. Comput. Math. Appl. 67(3), 555\u2013568 (2014)","journal-title":"Comput. Math. Appl."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26831-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:09:08Z","timestamp":1565809748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26831-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268305","9783030268312"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26831-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc.cs.uni-bonn.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}