{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:12:39Z","timestamp":1760573559170,"version":"build-2065373602"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00211-025-01487-2","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T06:05:15Z","timestamp":1757397915000},"page":"1615-1641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Emulation of the FMA and the correctly-rounded sum of three numbers in rounding-to-nearest floating-point arithmetic"],"prefix":"10.1007","volume":"157","author":[{"given":"Stef","family":"Graillat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Michel","family":"Muller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"1487_CR1","unstructured":"IEEE standard for floating-point arithmetic. IEEE Std 754-2019 (Revision of IEEE 754-2008), IEEE, pages 1\u201384 (2019)"},{"key":"1487_CR2","doi-asserted-by":"crossref","unstructured":"Bohlender, G., Walter, W., Kornerup, P., Matula, D.W.: Semantics for exact floating point operations. In 10th IEEE Symposium on Computer Arithmetic, pages 22\u201326 (1991)","DOI":"10.1109\/ARITH.1991.145529"},{"key":"1487_CR3","unstructured":"Boldo, S., Muller, J.-M.: Some functions computable with a fused-mac. In 17th IEEE Symposium on Computer Arithmetic (ARITH-17), Cape Cod, MA, USA (2005)"},{"key":"1487_CR4","doi-asserted-by":"crossref","unstructured":"Boldo, Sylvie., Daumas, Marc.: Representable correcting terms for possibly underflowing floating point operations. In 16th IEEE Symposium on Computer Arithmetic (ARITH-16), pages 79\u201386, Santiago de Compostela, Spain (2003)","DOI":"10.1109\/ARITH.2003.1207663"},{"key":"1487_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S0962492922000101","volume":"32","author":"S Boldo","year":"2023","unstructured":"Boldo, S., Jeannerod, C.-P., Melquiond, G., Muller, J.-M.: Floating-point arithmetic. Acta Numerica 32, 203\u2013290 (2023)","journal-title":"Acta Numerica"},{"issue":"4","key":"1487_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TC.2007.70819","volume":"57","author":"S Boldo","year":"2008","unstructured":"Boldo, S., Melquiond, G.: Emulation of FMA and correctly rounded sums: proved algorithms using rounding to odd. IEEE Trans. Comput. 57(4), 462\u2013471 (2008)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"1487_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TC.2010.139","volume":"60","author":"S Boldo","year":"2011","unstructured":"Boldo, S., Muller, J.-M.: Exact and approximated error of the FMA. IEEE Trans. Comput. 60(2), 157\u2013164 (2011)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"1487_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1147\/rd.341.0004","volume":"34","author":"John Cocke","year":"1990","unstructured":"Cocke, John, Markstein, V.: The evolution of RISC technology at IBM. IBM Journal of Research and Development 34(1), 4\u201311 (1990)","journal-title":"IBM Journal of Research and Development"},{"key":"1487_CR9","doi-asserted-by":"crossref","unstructured":"Cornea-Hasegan, M.A., Golliver, R.A., Markstein, P.: Correctness proofs outline for Newton\u2013Raphson based floating-point divide and square root algorithms. In 14th IEEE Symposium on Computer Arithmetic (ARITH-14), pages 96\u2013105 (1999)","DOI":"10.1109\/ARITH.1999.762834"},{"issue":"3","key":"1487_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01397083","volume":"18","author":"TJ Dekker","year":"1971","unstructured":"Dekker, T.J.: A floating-point technique for extending the available precision. Numer. Math. 18(3), 224\u2013242 (1971)","journal-title":"Numer. Math."},{"issue":"11","key":"1487_CR11","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TC.2019.2918451","volume":"68","author":"N Fabiano","year":"2019","unstructured":"Fabiano, N., Muller, J.-M., Picot, J.: Algorithms for triple-word arithmetic. IEEE Trans. Comput. 68(11), 1573\u20131583 (2019)","journal-title":"IEEE Trans. Comput."},{"key":"1487_CR12","doi-asserted-by":"crossref","unstructured":"Fasi, M., Higham, N., Mikaitis, M., Pranesh, S.: Numerical behavior of NVIDIA tensor cores. Peer J. Computer Science, 7(e330) 2021","DOI":"10.7717\/peerj-cs.330"},{"key":"1487_CR13","doi-asserted-by":"crossref","unstructured":"Graillat, S., Langlois, P., Louvet, N.: Improving the compensated horner scheme with a fused multiply and add. In Proceedings of the 2006 ACM Symposium on Applied Computing, SAC \u201906, page 1323\u20131327, New York, NY, USA, 2006. Association for Computing Machinery","DOI":"10.1145\/1141277.1141585"},{"key":"1487_CR14","doi-asserted-by":"crossref","unstructured":"Jolde\u015f, M., Muller, J.-M., Popescu, V.: Tight and rigorous error bounds for basic building blocks of double-word arithmetic. ACM Transactions on Mathematical Software, 44(2) (2017)","DOI":"10.1145\/3121432"},{"issue":"1","key":"1487_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/363707.363723","volume":"8","author":"W Kahan","year":"1965","unstructured":"Kahan, W.: Pracniques: further remarks on reducing truncation errors. Commun. ACM 8(1), 40 (1965)","journal-title":"Commun. ACM"},{"key":"1487_CR16","unstructured":"Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, vol. 2, 3rd edn. Reading, MA (1998)"},{"issue":"2","key":"1487_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TC.2011.27","volume":"61","author":"Peter Kornerup","year":"2012","unstructured":"Kornerup, Peter, Lef\u00e8vre, V., Louvet, N., Muller, J.-M.: On the computation of correctly-rounded sums. IEEE Transactions on Computers 61(2), 289\u2013298 (2012)","journal-title":"IEEE Transactions on Computers"},{"key":"1487_CR18","doi-asserted-by":"crossref","unstructured":"Lauter, C.: An efficient software implementation of correctly rounded operations extending FMA: $$a + b + c$$ and $$a \\times b + c \\times d$$. In ACSSC Proc.\u00a0(2017)","DOI":"10.1109\/ACSSC.2017.8335379"},{"key":"1487_CR19","unstructured":"Lindholm, T., Yellin, F., Bracha, G., Buckley, A., Smith, D.: The Java Virtual Machine Specification, Java SE 23 Edition. Oracle America, Inc.l (2024). Available at https:\/\/docs.oracle.com\/javase\/specs\/jvms\/se23\/jvms23.pdf"},{"key":"1487_CR20","unstructured":"Louvet, N.: Algorithmes Compens\u00e9s en Arithm\u00e9tique Flottante: Pr\u00e9cision, Validation, Performances. PhD thesis, Universit\u00e9 de Perpignan, Perpignan, France (2007)"},{"issue":"1","key":"1487_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1147\/rd.341.0111","volume":"34","author":"P Markstein","year":"1990","unstructured":"Markstein, P.: Computation of elementary functions on the IBM RISC System\/6000 processor. IBM J. Res. Dev. 34(1), 111\u2013119 (1990)","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"1487_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4666","volume":"31","author":"S Mittal","year":"2019","unstructured":"Mittal, S.: A survey of techniques for dynamic branch prediction. Concurrency and Computation: Practice and Experience 31(1), e4666 (2019)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"1487_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01975722","volume":"5","author":"O M\u00f8ller","year":"1965","unstructured":"M\u00f8ller, O.: Quasi double-precision in floating-point addition. BIT 5, 37\u201350 (1965)","journal-title":"BIT"},{"key":"1487_CR24","unstructured":"Muller, J.-M.: Elementary Functions, 3rd edn. Algorithms and Implementation. Birkh\u00e4user Boston, MA (2016)"},{"key":"1487_CR25","doi-asserted-by":"crossref","unstructured":"Muller, J.-M., Brunie, N., de Dinechin, F., Jeannerod, C.-P., Joldes, M., Lef\u00e8vre, V., Melquiond, G., Revol, N., Torres, S.: Handbook of Floating-Point Arithmetic, 2nd edition. Birkh\u00e4user Boston (2018)","DOI":"10.1007\/978-3-319-76526-6"},{"issue":"6","key":"1487_CR26","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1137\/030601818","volume":"26","author":"T Ogita","year":"2005","unstructured":"Ogita, T., Rump, S.M., Oishi, S.: Accurate sum and dot product. SIAM J. Sci. Comput. 26(6), 1955\u20131988 (2005)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1487_CR27","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/050645671","volume":"31","author":"SM Rump","year":"2008","unstructured":"Rump, S.M., Ogita, T., Oishi, S.: Accurate floating-point summation part I: Faithful rounding. SIAM J. Sci. Comput. 31(1), 189\u2013224 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"1487_CR28","volume-title":"Floating-Point Computation","author":"PH Sterbenz","year":"1974","unstructured":"Sterbenz, P.H.: Floating-Point Computation. Prentice-Hall, Englewood Cliffs, NJ (1974)"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-025-01487-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-025-01487-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-025-01487-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T04:03:53Z","timestamp":1760501033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-025-01487-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1487"],"URL":"https:\/\/doi.org\/10.1007\/s00211-025-01487-2","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"type":"print","value":"0029-599X"},{"type":"electronic","value":"0945-3245"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"14 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}