{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:37:53Z","timestamp":1774557473907,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:00:00Z","timestamp":1122854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Comput"],"published-print":{"date-parts":[[2005,8]]},"DOI":"10.1007\/s11155-005-6891-y","type":"journal-article","created":{"date-parts":[[2005,7,8]],"date-time":"2005-07-08T13:12:04Z","timestamp":1120828324000},"page":"275-290","source":"Crossref","is-referenced-by-count":84,"title":["Motivations for an Arbitrary Precision Interval Arithmetic and the MPFI Library"],"prefix":"10.1007","volume":"11","author":[{"given":"Nathalie","family":"Revol","sequence":"first","affiliation":[]},{"given":"Fabrice","family":"Rouillier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6891_CR1","unstructured":"Aberth, O.: Precise Numerical Methods Using C++, Academic Press, 1998."},{"issue":"4","key":"6891_CR2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/138351.138377","volume":"18","author":"O. Aberth","year":"1992","unstructured":"Aberth, O. and Schaefer, M. J.: Precise Computation Using Range Arithmetic, via C++, ACM TOMS 18 (4) (1992), pp. 481\u2013491.","journal-title":"ACM TOMS"},{"key":"6891_CR3","unstructured":"Alefeld, G. and Herzberger, J.: Introduction to Interval Analysis, Academic Press, 1983."},{"key":"6891_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-0348-6303-2_2","volume":"86","author":"W. Auzinger","year":"1988","unstructured":"Auzinger, W. and Stetter, H. J.: An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations, Int. Series in Numerical Mathematics, Birkh\u00e4user 86 (1988), pp. 11\u201330.","journal-title":"Int. Series in Numerical Mathematics, Birkh\u00e4user"},{"issue":"5","key":"6891_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1011423909873","volume":"7","author":"M. Berz","year":"2001","unstructured":"Berz, M. and Hoefkens, J.: Verified High-Order Inversion of Functional Dependencies and Interval Newton Methods, Reliable Computing 7(5) (2001), pp. 379\u2013398.","journal-title":"Reliable Computing"},{"key":"6891_CR6","unstructured":"Bini, D. and Fiorentino, G.: Numerical Computation of Polynomial Tools: MPSolve\u2014Version 2.0, 1998, http:\/\/www.dmi.unict.it\/-marotta\/Articoli\/mpsolve.ps."},{"issue":"4","key":"6891_CR7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V. Brattka","year":"1998","unstructured":"Brattka, V. and Hertling, P.: Feasible Real Random Access Machines, J. of Complexity 14(4) (1998), pp. 490\u2013526.","journal-title":"J. of Complexity"},{"key":"6891_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/355769.355775","volume":"4","author":"R. P. Brent","year":"1978","unstructured":"Brent, R. P.: A Fortran Multiple-Precision Arithmetic Package, ACM TOMS 4(1978), pp. 57\u201370.","journal-title":"ACM TOMS"},{"key":"6891_CR9","volume-title":"Arithmos: A Reliable Integrated Computational Environment","author":"CANTResearch Group","year":"2001","unstructured":"CANTResearch Group: Arithmos: A Reliable Integrated Computational Environment, University of Antwerpen, Belgium, 2001, http:\/\/win-www.uia.ac.be\/u\/cant\/arithmos\/."},{"key":"6891_CR10","doi-asserted-by":"crossref","unstructured":"Collins, G. and Akritas, A.: Polynomial Real Root Isolation Using Descartes\u2019 Rule of Signs, in: SYMSAC, 1976, pp. 272\u2013275.","DOI":"10.1145\/800205.806346"},{"key":"6891_CR11","unstructured":"Connell, A. E. and Corless, R. M.: An Experimental Interval Arithmetic Package in Maple, in: Num. Analysis with Automatic Result Verification, 1993."},{"key":"6891_CR12","doi-asserted-by":"crossref","unstructured":"Cox, D., Little, J., and O\u2019Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"6891_CR13","unstructured":"Daney, D., Hanrot, G., Lef\u00e8vre, V., Pelissier, P., Rouillier, F., and Zimmermann, P.: The MPFR Library, 2001, http:\/\/www.mpfr.org\/."},{"key":"6891_CR14","doi-asserted-by":"crossref","unstructured":"Fortune, S.: Polynomial Root Finding Using Iterated Eigenvalue Computation, in: Proc. ISSAC\u201901, 2001, pp. 121\u2013128.","DOI":"10.1145\/384101.384119"},{"key":"6891_CR15","unstructured":"Geulig, I. and Kr\u00e4mer, W.: Intervallrechnung in Maple\u2014Die Erweiterung intpakX zum Paket intpak der Share-Library, Technical Report 99\/2, Universit\u00e4t Karlsruhe, 1999."},{"key":"6891_CR16","unstructured":"Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, 1992."},{"key":"6891_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0096-3003(83)90001-2","volume":"12","author":"E. Hansen","year":"1983","unstructured":"Hansen, E. and Greenberg, R. I.: An Interval Newton Method, J. of Applied Math. and Computing 12 (1983), pp. 89\u201398.","journal-title":"J. of Applied Math. and Computing"},{"key":"6891_CR18","doi-asserted-by":"crossref","unstructured":"Hansen, E. and Sengupta, S.: Bounding Solutions of Systems of Equations Using Interval Analysis, BIT 21(1981), pp. 203\u2013211.","DOI":"10.1007\/BF01933165"},{"issue":"5","key":"6891_CR19","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"T.-J. Hickey","year":"2001","unstructured":"Hickey, T.-J., Ju, Q., and Van Emden, M.-H.: Interval Arithmetic: from Principles to Implementation, J. of ACM 48 (5) (2001), pp. 1038\u20131068.","journal-title":"J. of ACM"},{"key":"6891_CR20","doi-asserted-by":"crossref","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., and Walter, E.: Applied Interval Analysis, Springer Verlag, 2001.","DOI":"10.1007\/978-1-4471-0249-6"},{"key":"6891_CR21","doi-asserted-by":"crossref","unstructured":"Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4757-2495-0"},{"issue":"4","key":"6891_CR22","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/198429.198433","volume":"20","author":"R. B. Kearfott","year":"1994","unstructured":"Kearfott, R. B., Dawande, M., Du, K.-S., and Hu, C.-Y.: Algorithm 737: INTLIB: A Portable Fortran 77 Interval Standard-Function Library, ACM TOMS 20(4) (1994), pp. 447\u2013459.","journal-title":"ACM TOMS"},{"issue":"3","key":"6891_CR23","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/358407.358418","volume":"26","author":"R. B. Kearfott","year":"2000","unstructured":"Kearfott, R. B. and Walster, G. W.: On Stopping Criteria in Verified Nonlinear Systems or Optimization Algorithms, ACM TOMS 26(3) (2000), pp. 373\u2013389.","journal-title":"ACM TOMS"},{"key":"6891_CR24","first-page":"76","volume":"3","author":"J. Keiper","year":"1993","unstructured":"Keiper, J.: Interval Arithmetic in Mathematica, Interval Computations3 (1993), pp. 76\u201387.","journal-title":"Interval Computations"},{"key":"6891_CR25","doi-asserted-by":"crossref","unstructured":"Klatte, R., Kulisch, U., Lawo, C., Rauch, M., and Wiethoff, A.: C\u2013XSC: A C++ Class Library for Extended Scientific Computing, Springer Verlag, 1993.","DOI":"10.1007\/978-3-642-58058-1"},{"key":"6891_CR26","unstructured":"Kr\u00e4mer, W., Kulisch, U., and Lohner, R.: Numerical Toolbox for Verified Computing II\u2014 Advanced Numerical Problems, Springer, 2002."},{"issue":"3\u20134","key":"6891_CR27","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02307379","volume":"53","author":"O. Knueppel","year":"1994","unstructured":"Knueppel, O.: PROFIL\/BIAS\u2014A Fast Interval Library, Computing 53(3\u20134) (1994), pp. 277\u2013 287.","journal-title":"Computing"},{"key":"6891_CR28","unstructured":"Langlois, P. and Revol, N.:Validating Polynomial Numerical Computations with Complementary Automatic Methods, submitted to Mathematics and Computers in Simulation, 4th revision. INRIA research report RR\u20134205, 2001, http:\/\/www.inria.fr\/rrrt\/rr-4205.html."},{"key":"6891_CR29","unstructured":"Lerch, M., Tischler, G., Wolff von Gudenberg, J., Hofschuster, W., and Kr\u00e4mer, W.: The Interval Library filib++ 2.0, Preprint 2001\/4, Universit\u00e4t Wuppertal, 2001, http:\/\/www.math.uni-wuppertal.de\/org\/WRST\/software\/filib.html."},{"key":"6891_CR30","volume-title":"Les Robots parall\u00e8les","author":"J. P. Merlet","year":"1990","unstructured":"Merlet, J. P.: Les Robots parall\u00e8les, Robotique, Herm\u00e8s Paris, 1990."},{"key":"6891_CR31","unstructured":"Moore, R. E.: Interval Analysis, Prentice Hall, 1966."},{"key":"6891_CR32","doi-asserted-by":"crossref","unstructured":"M\u00fcller, N.: The iRRAM: Exact Arithmetic in C++, in: Workshop on Constructivity and Complexity in Analysis, Swansea, 2000.","DOI":"10.1007\/3-540-45335-0_14"},{"key":"6891_CR33","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511526473"},{"issue":"2","key":"6891_CR34","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/B:NUMA.0000005354.92791.41","volume":"34","author":"N. Revol","year":"2003","unstructured":"Revol, N.: Interval Newton Iteration in Multiple Precision for the Univariate Case, Numerical Algorithms 34 (2) (2003), pp. 417\u2013426.","journal-title":"Numerical Algorithms"},{"key":"6891_CR35","unstructured":"Revol, N. and Rouillier, F.: The MPFI Library, 2001, http:\/\/perso.ens-lyon.fr\/nathalie.revol\/software.html."},{"issue":"5","key":"6891_CR36","doi-asserted-by":"crossref","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, Journal of Applicable Algebra in Engineering, Communication and Computing 9 (5) (1999), pp. 433\u2013461.","journal-title":"Journal of Applicable Algebra in Engineering, Communication and Computing"},{"key":"6891_CR37","unstructured":"Rouillier, F.: RS \/ Real Solutions, 2000, http:\/\/fgbrs.lip6.fr\/-rouillie\/Software\/RS\/."},{"issue":"1","key":"6891_CR38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cam.2003.08.015","volume":"162","author":"F. Rouillier","year":"2004","unstructured":"Rouillier, F. and Zimmermann, P.: Efficient Isolation of Polynomial Real Roots, J. of Computational and Applied Math. 162 (1) (2004), pp. 33\u201350.","journal-title":"J. of Computational and Applied Math."},{"issue":"3","key":"6891_CR39","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1023\/A:1022374804152","volume":"39","author":"S. Rump","year":"1999","unstructured":"Rump, S.: Fast and Parallel Interval Arithmetic, BIT 39(3) (1999), pp. 534\u2013554.","journal-title":"BIT"},{"key":"6891_CR40","doi-asserted-by":"crossref","unstructured":"Rump, S.: INTLAB\u2014Interval Laboratory, in: Csendes, T. (ed.), Developments in Reliable Computing, Kluwer Academic Publishers, 1999, pp. 77\u2013104.","DOI":"10.1007\/978-94-017-1247-7_7"},{"key":"6891_CR41","unstructured":"Sun Microsystems: C++ Interval Arithmetic Programming Reference, 2000."},{"key":"6891_CR42","unstructured":"Vincent, A.-H.: Sur la r\u00e9solution des \u00e9quations num\u00e9riques, Journal de Math\u00e9matiques Pures et Appliqu\u00e9es (1836), pp. 341\u2013372."},{"key":"6891_CR43","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-7091-8577-3_15","volume":"2","author":"J. M. Yohe","year":"1980","unstructured":"Yohe, J. M.: Portable Software for Interval Arithmetic, Computing, Suppl. 2 (1980), pp. 211\u2013229.","journal-title":"Computing, Suppl."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11155-005-6891-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11155-005-6891-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11155-005-6891-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T05:48:23Z","timestamp":1586324903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11155-005-6891-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["6891"],"URL":"https:\/\/doi.org\/10.1007\/s11155-005-6891-y","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}