{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:06:09Z","timestamp":1767139569852,"version":"build-2238731810"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T00:00:00Z","timestamp":1587686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T00:00:00Z","timestamp":1587686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2020,6]]},"abstract":"Abstract<\/jats:title>\n \n More than 45 years ago, Dekker proved that it is possible to evaluate the exact error of a floating-point sum with only two additional floating-point operations, provided certain conditions are met. Today the respective algorithm for transforming a sum into its floating-point approximation and the corresponding error is widely referred to as\n \n \n $${{\\,\\mathrm{FastTwoSum}\\,}}$$<\/jats:tex-math>\n \n \n \n FastTwoSum<\/mml:mi>\n \n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Besides some assumptions on the floating-point system itself\u2014all of which are satisfied by any binary\n IEEE<\/jats:sc>\n \u00a0\n \n \n $$754$$<\/jats:tex-math>\n \n \n 754<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n standard conform arithmetic, the main practical limitation of\n \n \n $${{\\,\\mathrm{FastTwoSum}\\,}}$$<\/jats:tex-math>\n \n \n \n FastTwoSum<\/mml:mi>\n \n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is that the summands have to be ordered according to their exponents. In most preceding applications of\n \n \n $${{\\,\\mathrm{FastTwoSum}\\,}}$$<\/jats:tex-math>\n \n \n \n FastTwoSum<\/mml:mi>\n \n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , however, a more stringent condition is used, namely that the summands have to be sorted according to their absolute value. In remembrance of Dekker\u2019s work, this note reminds the original assumptions for an error-free transformation via\n \n \n $${{\\,\\mathrm{FastTwoSum}\\,}}$$<\/jats:tex-math>\n \n \n \n FastTwoSum<\/mml:mi>\n \n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Moreover, we generalize the conditions for arbitrary bases and discuss a possible modification of the\n \n \n $${{\\,\\mathrm{FastTwoSum}\\,}}$$<\/jats:tex-math>\n \n \n \n FastTwoSum<\/mml:mi>\n \n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n algorithm to extend its applicability even further. Subsequently, a range of programs exploiting the wider applicability is presented. This comprises the\n OnlineExactSum<\/jats:sc>\n algorithm by Zhu and Hayes, an error-free transformation from a product of three floating-point numbers to a sum of the same number of addends, and an algorithm for accurate summation proposed by Demmel and Hida.\n <\/jats:p>","DOI":"10.1007\/s00211-020-01114-2","type":"journal-article","created":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T19:04:02Z","timestamp":1587668642000},"page":"383-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A note on Dekker\u2019s FastTwoSum algorithm"],"prefix":"10.1007","volume":"145","author":[{"given":"Marko","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin\u2019ichi","family":"Oishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"1114_CR1","unstructured":"Briggs, K.: The doubledouble library. https:\/\/boutell.com\/fracster-src\/doubledouble\/doubledouble.html (1998)"},{"issue":"3","key":"1114_CR2","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 (1971). https:\/\/doi.org\/10.1007\/BF01397083","journal-title":"Numer. Math."},{"issue":"1\u20134","key":"1114_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/b:numa.0000049458.99541.38","volume":"37","author":"J Demmel","year":"2004","unstructured":"Demmel, J., Hida, Y.: Fast and accurate floating point summation with application to computational geometry. Numer. Algorithms 37(1\u20134), 101\u2013112 (2004). https:\/\/doi.org\/10.1023\/b:numa.0000049458.99541.38","journal-title":"Numer. Algorithms"},{"key":"1114_CR4","unstructured":"Graillat, S., Louvet, N.: Applications of fast and accurate summation in computational geometry. Technical report, Laboratoire LP2A, University of Perpignan, Perpignan, France (2006)"},{"key":"1114_CR5","unstructured":"Hida, Y., Li, X.S., Bailey, D.H.: C++\/fortran-90 double-double and quad-double package, version 2.3.17. http:\/\/crd-legacy.lbl.gov\/~dhbailey\/mpdist\/ (2012)"},{"issue":"1","key":"1114_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/363707.363723","volume":"8","author":"W Kahan","year":"1965","unstructured":"Kahan, W.: Further remarks on reducing truncation errors. Commun. ACM 8(1), 40 (1965). https:\/\/doi.org\/10.1145\/363707.363723","journal-title":"Commun. ACM"},{"key":"1114_CR7","doi-asserted-by":"publisher","unstructured":"Karush, W.: Minima of functions of several variables with inequalities as side conditions. In: Traces and Emergence of Nonlinear Programming, pp. 217\u2013245. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-0348-0439-4_10","DOI":"10.1007\/978-3-0348-0439-4_10"},{"key":"1114_CR8","unstructured":"Knuth, D.E.: The Art of Computer Programming. Pearson Education (US) (1997)"},{"key":"1114_CR9","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481\u2013492. University of California Press, Berkeley and Los Angeles (1951)","DOI":"10.1525\/9780520411586-036"},{"issue":"2","key":"1114_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0303020","volume":"3","author":"OL Mangasarian","year":"1965","unstructured":"Mangasarian, O.L.: Pseudo-convex functions. SIAM Ser. A. Control 3(2), 281\u2013290 (1965). https:\/\/doi.org\/10.1137\/0303020","journal-title":"SIAM Ser. A. Control"},{"issue":"6","key":"1114_CR11","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). https:\/\/doi.org\/10.1137\/030601818","journal-title":"SIAM J. Sci. Comput."},{"issue":"16","key":"1114_CR12","first-page":"553","volume":"4","author":"K Ozaki","year":"2006","unstructured":"Ozaki, K., Ogita, T., Rump, S.M., Oishi, S.: Fast and robust algorithm for geometric predicates using floating-point arithmetic. Trans. JSIAM 4(16), 553\u2013562 (2006). [in Japanese]","journal-title":"Trans. JSIAM"},{"issue":"5","key":"1114_CR13","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1137\/080738490","volume":"31","author":"SM Rump","year":"2009","unstructured":"Rump, S.M.: Ultimately fast accurate summation. SIAM J. Sci. Comput. 31(5), 3466\u20133502 (2009). https:\/\/doi.org\/10.1137\/080738490","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1114_CR14","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). https:\/\/doi.org\/10.1137\/050645671","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1114_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1587\/nolta.1.2","volume":"1","author":"SM Rump","year":"2010","unstructured":"Rump, S.M., Ogita, T., Oishi, S.: Fast high precision summation. NOLTA 1(1), 2\u201324 (2010). https:\/\/doi.org\/10.1587\/nolta.1.2","journal-title":"NOLTA"},{"issue":"3","key":"1114_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/pl00009321","volume":"18","author":"JR Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete Comput. Geom. 18(3), 305\u2013363 (1997). https:\/\/doi.org\/10.1007\/pl00009321","journal-title":"Discrete Comput. Geom."},{"key":"1114_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming. Springer, Berlin (1997). https:\/\/doi.org\/10.1007\/978-94-009-0035-6"},{"key":"1114_CR18","volume-title":"Floating-Point Computation","author":"PH Sterbenz","year":"1974","unstructured":"Sterbenz, P.H.: Floating-Point Computation. Prentice-Hall, Engelwood Cliffs (1974)"},{"issue":"6","key":"1114_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/512274.512287","volume":"7","author":"JM Wolfe","year":"1964","unstructured":"Wolfe, J.M.: Reducing truncation errors by programming. Commun. ACM 7(6), 355\u2013356 (1964). https:\/\/doi.org\/10.1145\/512274.512287","journal-title":"Commun. ACM"},{"issue":"3","key":"1114_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824801.1824815","volume":"37","author":"YK Zhu","year":"2010","unstructured":"Zhu, Y.K., Hayes, W.B.: Algorithm 908. ACM Trans. Math. Softw. 37(3), 1\u201313 (2010). https:\/\/doi.org\/10.1145\/1824801.1824815","journal-title":"ACM Trans. Math. Softw."}],"updated-by":[{"DOI":"10.1007\/s00211-021-01213-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T00:00:00Z","timestamp":1630713600000}}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-020-01114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-020-01114-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-020-01114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T12:09:46Z","timestamp":1722773386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-020-01114-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,24]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1114"],"URL":"https:\/\/doi.org\/10.1007\/s00211-020-01114-2","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,24]]},"assertion":[{"value":"13 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}