{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:22:24Z","timestamp":1762323744484,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"1\/2","license":[{"start":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T00:00:00Z","timestamp":1404950400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2014,7,10]]},"abstract":"<jats:p>We present a new algorithm for refining a real interval containing a single real root: the new method combines the robustness of the classical Bisection algorithm with the speed of the Newton-Raphson method; that is, our method exhibits quadratic convergence when refining isolating intervals of simple roots of polynomials (and other well-behaved functions). We assume the use of arbitrary precision rational arithmetic. Unlike Newton-Raphson our method does not need to evaluate the derivative.<\/jats:p>","DOI":"10.1145\/2644288.2644291","type":"journal-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:09:41Z","timestamp":1405080581000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Quadratic interval refinement for real roots"],"prefix":"10.1145","volume":"48","author":[{"given":"John","family":"Abbott","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Genova, Genova, Italy"}]}],"member":"320","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"F. Roullier P. Zimmermann Efficient Isolation of Polynomial Real Roots INRIA Rapport de Recherche 4113 Feb 2001.  F. Roullier P. Zimmermann Efficient Isolation of Polynomial Real Roots INRIA Rapport de Recherche 4113 Feb 2001."},{"key":"e_1_2_1_2_1","unstructured":"The CoCoA web site http:\/\/cocoa.dima.unige.it\/  The CoCoA web site http:\/\/cocoa.dima.unige.it\/"},{"key":"e_1_2_1_3_1","unstructured":"The GMP web site http:\/\/www.swox.com\/gmp\/  The GMP web site http:\/\/www.swox.com\/gmp\/"},{"key":"e_1_2_1_4_1","unstructured":"FRISCO Polynomial Test Suite http:\/\/www-sop.inria.fr\/saga\/POL\/  FRISCO Polynomial Test Suite http:\/\/www-sop.inria.fr\/saga\/POL\/"},{"key":"e_1_2_1_5_1","unstructured":"MPSolve Benchmarks http:\/\/www.dm.unipi.it\/cluster-pages\/mpsolve\/bench.htm  MPSolve Benchmarks http:\/\/www.dm.unipi.it\/cluster-pages\/mpsolve\/bench.htm"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/164081.164090"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993920"},{"key":"e_1_2_1_8_1","unstructured":"M. Kerber &amp; M. Sagraloff Root Refinement for Real Polynomials arXiv:1104.1362 (2011)  M. Kerber &amp; M. Sagraloff Root Refinement for Real Polynomials arXiv:1104.1362 (2011)"},{"volume-title":"Interval Analysis SIAM 2009","author":"Moore R. B.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442872"},{"key":"e_1_2_1_11_1","unstructured":"M. Sagraloff &amp; K. Mehlhorn Computing Real Roots of Real Polynomials: An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration arXiv:1308.4088v1 (2013)  M. Sagraloff &amp; K. Mehlhorn Computing Real Roots of Real Polynomials: An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration arXiv:1308.4088v1 (2013)"},{"key":"e_1_2_1_12_1","unstructured":"Y. Liang Real root refinements for univariate polynomial equationsarXiv:1211.4332 (2012)  Y. Liang Real root refinements for univariate polynomial equationsarXiv:1211.4332 (2012)"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2644288.2644291","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2644288.2644291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:03Z","timestamp":1750230063000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2644288.2644291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,10]]},"references-count":12,"journal-issue":{"issue":"1\/2","published-print":{"date-parts":[[2014,7,10]]}},"alternative-id":["10.1145\/2644288.2644291"],"URL":"https:\/\/doi.org\/10.1145\/2644288.2644291","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2014,7,10]]},"assertion":[{"value":"2014-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}