{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:44:55Z","timestamp":1771958695373,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030779603","type":"print"},{"value":"9783030779610","type":"electronic"}],"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-77961-0_61","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"765-778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Error Estimation and Correction Using the Forward CENA Method"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-2567","authenticated-orcid":false,"given":"Paul D.","family":"Hovland","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3479-6361","authenticated-orcid":false,"given":"Jan","family":"H\u00fcckelheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Ahrens, P., Demmel, J., Nguyen, H.D.: Algorithms for efficient reproducible floating point summation. ACM Trans. Math. Softw. 46(3), 1\u201349 (2020)","DOI":"10.1145\/3389360"},{"issue":"4","key":"61_CR2","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/15M1032168","volume":"37","author":"G Ballard","year":"2016","unstructured":"Ballard, G., Benson, A.R., Druinsky, A., Lipshitz, B., Schwartz, O.: Improving the numerical stability of fast matrix multiplication. SIAM J. Matrix Anal. Appl. 37(4), 1382\u20131418 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"61_CR3","unstructured":"Bischof, C.H., Carle, A., Hovland, P.D., Khademi, P., Mauer, A.: ADIFOR 2.0 user\u2019s guide (Revision D). Argonne Technical Memorandum 192 (1998)"},{"issue":"1","key":"61_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556789208805508","volume":"1","author":"B Christianson","year":"1992","unstructured":"Christianson, B.: Reverse accumulation and accurate rounding error estimates for Taylor series coefficient. Optim. Methods Softw. 1(1), 81\u201394 (1992)","journal-title":"Optim. Methods Softw."},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2), 13es (2007)","DOI":"10.1145\/1236463.1236468"},{"key":"61_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-030-58475-7_37","volume-title":"Principles and Practice of Constraint Programming","author":"R Garcia","year":"2020","unstructured":"Garcia, R., Michel, C., Rueher, M.: A branch-and-bound algorithm to rigorously enclose the round-off errors. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 637\u2013653. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_37"},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2011.09.003","volume":"216","author":"S Graillat","year":"2012","unstructured":"Graillat, S., M\u00e9nissier-Morain, V.: Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic. Inf. Comput. 216, 57\u201371 (2012)","journal-title":"Inf. Comput."},{"key":"61_CR8","doi-asserted-by":"publisher","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives. Society for Industrial and Applied Mathematics (2008). https:\/\/doi.org\/10.1137\/1.9780898717761","DOI":"10.1137\/1.9780898717761"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Habib, S., et al.: HACC: Simulating sky surveys on state-of-the-art supercomputing architectures. New Astron. 42, 49\u201365 (2016)","DOI":"10.1016\/j.newast.2015.06.003"},{"issue":"4","key":"61_CR10","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/98267.98290","volume":"16","author":"NJ Higham","year":"1990","unstructured":"Higham, N.J.: Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Softw. 16(4), 352\u2013368 (1990)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"61_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0377-0427(88)90298-1","volume":"24","author":"M Iri","year":"1988","unstructured":"Iri, M., Tsuchiya, T., Hoshi, M.: Automatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equations. J. Comput. Appl. Math. 24(3), 365\u2013392 (1988)","journal-title":"J. Comput. Appl. Math."},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-63618-0_10","volume-title":"Software Verification","author":"F J\u00e9z\u00e9quel","year":"2020","unstructured":"J\u00e9z\u00e9quel, F., Graillat, S., Mukunoki, D., Imamura, T., Iakymchuk, R.: Can we avoid rounding-error estimation in HPC codes and still get trustworthy results? In: Christakis, M., Polikarpova, N., Duggirala, P.S., Schrammel, P. (eds.) NSV\/VSTTE -2020. LNCS, vol. 12549, pp. 163\u2013177. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63618-0_10"},{"issue":"12","key":"61_CR13","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.cpc.2008.02.003","volume":"178","author":"F J\u00e9z\u00e9quel","year":"2008","unstructured":"J\u00e9z\u00e9quel, F., Chesneaux, J.M.: CADNA: a library for estimating round-off error propagation. Comput. Phys. Commun. 178(12), 933\u2013955 (2008)","journal-title":"Comput. Phys. Commun."},{"issue":"1","key":"61_CR14","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). https:\/\/doi.org\/10.1145\/363707.363723","journal-title":"Commun. ACM"},{"key":"61_CR15","unstructured":"Kahan, W.: How futile are mindless assessments of roundoff in floating-point computation? (2006). http:\/\/www.cs.berkeley.edu\/~wkahan\/Mindless.pdf"},{"issue":"3","key":"61_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1023\/A:1021919329342","volume":"41","author":"P Langlois","year":"2001","unstructured":"Langlois, P.: Automatic linear correction of rounding errors. BIT Numer. Math. 41(3), 515\u2013539 (2001)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"61_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01931367","volume":"16","author":"S Linnainmaa","year":"1976","unstructured":"Linnainmaa, S.: Taylor expansion of the accumulated rounding error. BIT Numer. Math. 16(2), 146\u2013160 (1976)","journal-title":"BIT Numer. Math."},{"issue":"1","key":"61_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10990-006-8608-2","volume":"19","author":"M Martel","year":"2006","unstructured":"Martel, M.: Semantics of roundoff error propagation in finite precision calculations. Higher-Order Symbolic Comput. 19(1), 7\u201330 (2006)","journal-title":"Higher-Order Symbolic Comput."},{"key":"61_CR19","unstructured":"Menon, H., et al.: ADAPT: Algorithmic differentiation applied to floating-point precision tuning. In: Proceedings of SC 2018, pp. 48:1\u201313. IEEE Press, Piscataway, NJ (2018)"},{"issue":"6","key":"61_CR20","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."},{"key":"61_CR21","doi-asserted-by":"crossref","unstructured":"Solovyev, A., Baranowski, M.S., Briggs, I., Jacobsen, C., Rakamari\u0107, Z., Gopalakrishnan, G.: Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions. ACM Trans. Program. Lang. Syst. 41(1), 2:1\u201339 (2018)","DOI":"10.1145\/3230733"},{"issue":"3","key":"61_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01934204","volume":"10","author":"M Tienari","year":"1970","unstructured":"Tienari, M.: A statistical model of roundoff error for varying length floating-point arithmetic. BIT Numer. Math. 10(3), 355\u2013365 (1970)","journal-title":"BIT Numer. Math."},{"key":"61_CR23","doi-asserted-by":"crossref","unstructured":"Vassiliadis, V., et al.: Towards automatic significance analysis for approximate computing. In: 2016 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 182\u2013193 (March 2016)","DOI":"10.1145\/2854038.2854058"},{"issue":"1\u20134","key":"61_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1023\/B:NUMA.0000049483.75679.ce","volume":"37","author":"J Vignes","year":"2004","unstructured":"Vignes, J.: Discrete stochastic arithmetic for validating results of numerical software. Numer. Algorithms 37(1\u20134), 377\u2013390 (2004)","journal-title":"Numer. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77961-0_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:04:54Z","timestamp":1749506694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}