{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:55:22Z","timestamp":1743123322926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030816971"},{"type":"electronic","value":"9783030816988"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81698-8_13","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T16:03:19Z","timestamp":1626710599000},"page":"185-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Certified Evaluations of H\u00f6lder Continuous Functions at Roots of Polynomials"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6875-5328","authenticated-orcid":false,"given":"Parker B.","family":"Edwards","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9252-8210","authenticated-orcid":false,"given":"Jonathan D.","family":"Hauenstein","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1486-7900","authenticated-orcid":false,"given":"Clifford D.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"issue":"1\u20132","key":"13_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jsco.1999.0269","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symbolic Comput. 28(1\u20132), 105\u2013124 (1999)","journal-title":"J. Symbolic Comput."},{"key":"13_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. Symbolic Comput. 86, 51\u201396 (2018)","journal-title":"J. Symbolic Comput."},{"key":"13_CR3","unstructured":"Boulier, F., Chen, C., Lemaire, F., Maza, M.M.: Real root isolation of regular chains. In: The Joint Conference of ASCM 2009 and MACIS 2009, COE Lect. Note, vol. 22, pp. 15\u201329. Kyushu Univ. Fac. Math, Fukuoka (2009)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Gargantini, I., Henrici, P.: Circular arithmetic and the determination of polynomial zeros. Numer. Math. 18, 305\u2013320 (1971\/72)","DOI":"10.1007\/BF01404681"},{"issue":"3","key":"13_CR5","first-page":"301","volume":"17","author":"GH Hardy","year":"1916","unstructured":"Hardy, G.H.: Weierstrass\u2019s non-differentiable function. Trans. Amer. Math. Soc. 17(3), 301\u2013325 (1916)","journal-title":"Trans. Amer. Math. Soc."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TC.2017.2690633","volume":"66","author":"F Johansson","year":"2017","unstructured":"Johansson, F.: Arb: efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Trans. Comput. 66, 1281\u20131292 (2017)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR7","unstructured":"Kantorovich, L.V.: On Newton\u2019s method for functional equations. Doklady Akad. Nauk SSSR (N.S.) 59, 1237\u20131240 (1948)"},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous global search: continuous problems, Nonconvex Optimization and its Applications","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous global search: continuous problems, Nonconvex Optimization and its Applications, vol. 13. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kobel, A., Rouillier, F., Sagraloff, M.: Computing real roots of real polynomials $$\\dots $$ and now for real! In: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, pp. 303\u2013310. ACM, New York (2016)","DOI":"10.1145\/2930889.2930937"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Krawczyk, R.: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing (Arch. Elektron. Rechnen) 4, 187\u2013201 (1969)","DOI":"10.1007\/BF02234767"},{"key":"13_CR11","unstructured":"Maple 2020 Program Committee Chairs: Private Communication"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/0714040","volume":"14","author":"RE Moore","year":"1977","unstructured":"Moore, R.E.: A test for existence of solutions to nonlinear systems. SIAM J. Numer. Anal. 14(4), 611\u2013615 (1977)","journal-title":"SIAM J. Numer. Anal."},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction Interval Analysis","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction Interval Analysis. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2009)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-26831-2_26","volume-title":"Computer Algebra in Scientific Computing","author":"VY Pan","year":"2019","unstructured":"Pan, V.Y.: Old and new nearly optimal polynomial root-finders. In: England, M., Koepf, W., Sadykov, T.M., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2019. LNCS, vol. 11661, pp. 393\u2013411. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26831-2_26"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Rioboo, R.: Real algebraic closure of an ordered field: implementation in axiom. In: Papers from the International Symposium on Symbolic and Algebraic Computation. ISSAC 1992, pp. 206\u2013215, New York, NY, USA. Association for Computing Machinery (1992)","DOI":"10.1145\/143242.143312"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F Rouillier","year":"1999","unstructured":"Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Engrg. Comm. Comput. 9(5), 433\u2013461 (1999)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cam.2003.08.015","volume":"162","author":"F Rouillier","year":"2003","unstructured":"Rouillier, F., Zimmermann, P.: Efficient isolation of polynomial\u2019s real roots. J. Comput. Appl. Math. 162(1), 33\u201350 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S096249291000005X","volume":"19","author":"SM Rump","year":"2010","unstructured":"Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer. 19, 287\u2013449 (2010)","journal-title":"Acta Numer."},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Smale, S.: Newton\u2019s method estimates from data at one point. In: Ewing, R.E., Gross, K.I., Martin, C.F. (eds.) The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (Laramie, Wyo., 1985), pp. 185\u2013196. Springer, New York (1986). Doi: https:\/\/doi.org\/10.1007\/978-1-4612-4984-9_13","DOI":"10.1007\/978-1-4612-4984-9_13"},{"issue":"5","key":"13_CR20","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1006\/jsco.2002.0572","volume":"34","author":"B Xia","year":"2002","unstructured":"Xia, B., Yang, L.: An algorithm for isolating the real solutions of semi-algebraic systems. J. Symbolic Comput. 34(5), 461\u2013477 (2002)","journal-title":"J. Symbolic Comput."},{"issue":"6\u20137","key":"13_CR21","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.camwa.2006.06.003","volume":"52","author":"B Xia","year":"2006","unstructured":"Xia, B., Zhang, T.: Real solution isolation using interval arithmetic. Comput. Math. Appl. 52(6\u20137), 853\u2013860 (2006)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02916723","volume":"44","author":"L Yang","year":"2001","unstructured":"Yang, L., Hou, X., Xia, B.: A complete algorithm for automated discovering of a class of inequality-type theorems. Sci. China Ser. F 44(1), 33\u201349 (2001)","journal-title":"Sci. China Ser. F"}],"container-title":["Communications in Computer and Information Science","Maple in Mathematics Education and Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81698-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T16:06:52Z","timestamp":1626710812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81698-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816971","9783030816988"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81698-8_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Maple Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Waterloo, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maplesoft.com\/mapleconference","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}