{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:46Z","timestamp":1740123526820,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China \u2014 Precision analysis and optimization of basic mathematical functions on domestic processors","award":["61802434"],"award-info":[{"award-number":["61802434"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11227-021-03937-8","type":"journal-article","created":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T11:02:34Z","timestamp":1624618954000},"page":"2196-2218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Design of variable precision transcendental function automatic generator"],"prefix":"10.1007","volume":"78","author":[{"given":"Jiangwei","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6275-2617","authenticated-orcid":false,"given":"Jinchen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaozhong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YuanYuan","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,25]]},"reference":[{"issue":"12","key":"3937_CR1","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1109\/JPROC.2020.2991885","volume":"108","author":"JM Muller","year":"2020","unstructured":"Muller JM (2020) Elementary functions and approximate computing. Proc IEEE 108(12):2136\u20132149. https:\/\/doi.org\/10.1109\/JPROC.2020.2991885","journal-title":"Proc IEEE"},{"key":"3937_CR2","doi-asserted-by":"publisher","unstructured":"Xu JC , Guo SZ, WANG L (2012) Optimization technology in simd mathematical functions based on vector register reuse. In: 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems, pp 1102\u20131107. https:\/\/doi.org\/10.1109\/HPCC.2012.161","DOI":"10.1109\/HPCC.2012.161"},{"key":"3937_CR3","doi-asserted-by":"publisher","unstructured":"Franchetti F, Low TM, Popovici DT, et\u00a0al (2018) SPIRAL: extreme performance portability. In: IEEE special issue on From High Level Specification to High Performance Code 2018, vol 106, pp 1935\u20131968. https:\/\/doi.org\/10.1109\/JPROC.2018.2873289","DOI":"10.1109\/JPROC.2018.2873289"},{"key":"3937_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7983-4","volume-title":"Elementary functions, algorithms and implementation","author":"JM Muller","year":"2016","unstructured":"Muller JM (2016) Elementary functions, algorithms and implementation, 3rd edn. Birkh\u00e4user, Boston. https:\/\/doi.org\/10.1007\/978-1-4899-7983-4","edition":"3"},{"key":"3937_CR5","unstructured":"Saint-Geni\u00e8s HDL (2018) Elementary functions: towards automatically generated, efficient, and vectorizable implementations. Universit\u00e9 de Perpignan. https:\/\/tel.archives-ouvertes.fr\/tel-01841424\/document"},{"key":"3937_CR6","doi-asserted-by":"publisher","unstructured":"Mouilleron C, Revy G (2011) Automatic generation of fast and certified code for polynomial evaluation. In: Proceedings of the 2011 IEEE 20th Symposium on Computer Arithmetic, pp 233\u2013242. https:\/\/doi.org\/10.1109\/ARITH.2011.39.","DOI":"10.1109\/ARITH.2011.39."},{"key":"3937_CR7","doi-asserted-by":"publisher","unstructured":"Mouilleron C, Najahi MA, Revy G (2014) Automated synthesis of target-dependent programs for polynomial evaluation in fixed-point arithmetic. In: SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, pp 141\u2013148. https:\/\/doi.org\/10.1109\/SYNASC.2014.27","DOI":"10.1109\/SYNASC.2014.27"},{"key":"3937_CR8","doi-asserted-by":"publisher","unstructured":"Brunie N, Lauter C, Revy G (2019) Precision adaptation for fast and accurate polynomial evaluation generation. In: 2019 IEEE 30th International Conference on Application-specific Systems, Architectures and Processors (ASAP), vol 2160-052X, pp 41-41. https:\/\/doi.org\/10.1109\/ASAP.2019.00-32","DOI":"10.1109\/ASAP.2019.00-32"},{"key":"3937_CR9","doi-asserted-by":"crossref","unstructured":"Ewart T, Cremonesi F, Sch\u00fcrmann F, Delalondre F (2020) Polynomial evaluation on superscalar architecture, applied to the elementary function $$e^x$$. ACM Trans Math Softw 46(3), 28. https:\/\/doi.org\/10.1145\/3408893","DOI":"10.1145\/3408893"},{"issue":"12","key":"3937_CR10","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.1109\/TC.2017.2703870","volume":"66","author":"HDL Saint-Geni\u00e8s","year":"2017","unstructured":"Saint-Geni\u00e8s HDL, Defour D, Revy G (2017) Exact lookup tables for the evaluation of trigonometric and hyperbolic functions. IEEE Trans Comput 66(12):2058\u20132071. https:\/\/doi.org\/10.1109\/TC.2017.2703870","journal-title":"IEEE Trans Comput"},{"key":"3937_CR11","doi-asserted-by":"crossref","unstructured":"Volkova A, Muller JM (2019) Semi-automatic implementation of the complementary error function. In: ARITH 2019\u201426th IEEE Symposium on Computer Arithmetic, pp 1\u20138","DOI":"10.1109\/ARITH.2019.00039"},{"key":"3937_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5281\/zenodo.4067194","volume":"5","author":"JP Lim","year":"2021","unstructured":"Lim JP, Aanjaneya M, Gustafson J, Nagarakatte S (2021) An approach to generate correctly rounded math libraries for new floating point variants. Proc ACM Program Lang 5:1\u201330. https:\/\/doi.org\/10.5281\/zenodo.4067194","journal-title":"Proc ACM Program Lang"},{"key":"3937_CR13","doi-asserted-by":"publisher","unstructured":"Chevillard S, Joldes M, Lauter C (2010) Sollya: an environment for the development of numerical codes. In: ICMS\u201910 Proceedings of the Third International Congress Conference on Mathematical Software. vol 6327, pp 28\u201331. https:\/\/doi.org\/10.1007\/978-3-642-15582-6_5","DOI":"10.1007\/978-3-642-15582-6_5"},{"key":"3937_CR14","doi-asserted-by":"publisher","unstructured":"Brunie N, Dinechin FD, Kupriianova O, Lauter C (2015) Code generators for mathematical functions. In: 2015 IEEE 22nd Symposium on Computer Arithmetic, pp 66\u201373. https:\/\/doi.org\/10.1109\/ARITH.2015.22","DOI":"10.1109\/ARITH.2015.22"},{"key":"3937_CR15","doi-asserted-by":"publisher","unstructured":"Brisebarre N, Chevillard S (2007) Efficient polynomial L-approximations. In: 18th IEEE Symposium on Computer Arithmetic (ARITH \u201907), pp 169\u2013176. https:\/\/doi.org\/10.1109\/ARITH.2007.17","DOI":"10.1109\/ARITH.2007.17"},{"key":"3937_CR16","doi-asserted-by":"publisher","unstructured":"Kupriianova O, Lauter C (2014) A domain splitting algorithm for the mathematical functions code generator. In: 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2014, pp 1271\u20131275. https:\/\/doi.org\/10.1109\/ACSSC.2014.7094664","DOI":"10.1109\/ACSSC.2014.7094664"},{"key":"3937_CR17","doi-asserted-by":"publisher","first-page":"012119","DOI":"10.1088\/1742-6596\/1325\/1\/012119","volume":"1325","author":"JW Hao","year":"2019","unstructured":"Hao JW, Xu JC, Guo SZ, Xia YY, Liu D (2019) Design and implementation of variable precision algorithm for transcendental functions. J Phys: Conf Ser 1325:012119. https:\/\/doi.org\/10.1088\/1742-6596\/1325\/1\/012119","journal-title":"J Phys: Conf Ser"},{"key":"3937_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76526-6","volume-title":"Handbook of floating-point arithmetic","author":"JM Muller","year":"2018","unstructured":"Muller JM, Brunie N, Dinechin FD, Jeannerod CP et al (2018) Handbook of floating-point arithmetic, 2nd edn. Birkh\u00e4user, Boston","edition":"2"},{"issue":"2","key":"3937_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/1141885.1141890","volume":"32","author":"N Brisebarre","year":"2006","unstructured":"Brisebarre N, Muller JM, Tisserand A (2006) Computing machine-efficient polynomial approximations. ACM Trans Math Softw: TOMS 32(2):236\u2013256. https:\/\/doi.org\/10.1145\/1141885.1141890","journal-title":"ACM Trans Math Softw: TOMS"},{"issue":"2","key":"3937_CR20","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/63522.214389","volume":"15","author":"Ping Tang","year":"1989","unstructured":"Tang Ping (1989) Table-driven implementation of the exponential function in IEEE floating-point arithmetic. ACM Trans Math Softw 15(2):144\u2013157. https:\/\/doi.org\/10.1145\/63522.214389","journal-title":"ACM Trans Math Softw"},{"issue":"4","key":"3937_CR21","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1145\/98267.98294","volume":"16","author":"Ping Tang","year":"1990","unstructured":"Tang Ping (1990) Table-driven implementation of the logarithm function in IEEE floating-point arithmetic. ACM Trans Math Softw 16(4):378\u2013400. https:\/\/doi.org\/10.1145\/98267.98294","journal-title":"ACM Trans Math Softw"},{"key":"3937_CR22","doi-asserted-by":"publisher","unstructured":"Tang P (1991) Table lookup algorithms for elementary functions and their error analysis. In: Proceedings of the 10th IEEE Symposium on Computer Arithmetic. Argonne National Lab, pp 232\u2013236. https:\/\/doi.org\/10.1109\/ARITH.1991.145565","DOI":"10.1109\/ARITH.1991.145565"},{"issue":"2","key":"3937_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/146847.146928","volume":"18","author":"Tang Ping","year":"1992","unstructured":"Ping Tang (1992) Table-driven implementation of the expm1 function in IEEE floating-point arithmetic. ACM Trans Math Softw 18(2):211\u2013222. https:\/\/doi.org\/10.1145\/146847.146928","journal-title":"ACM Trans Math Softw"},{"key":"3937_CR24","unstructured":"Bruce R, Devlin M, Marshall S (2008) An elementary transcendental function core library for reconfigurable computing. Reconfigurable Systems Summer Institute (RSSI 2007), pp 1\u20139. https:\/\/core.ac.uk\/display\/9022716"},{"key":"3937_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1236463.1236468","volume":"33","author":"F Laurent","year":"2007","unstructured":"Laurent F, Guillaume H, Vincent L, Patrick P, Paul Z (2007) MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans Math Softw 33:13. https:\/\/doi.org\/10.1145\/1236463.1236468","journal-title":"ACM Trans Math Softw"},{"issue":"6","key":"3937_CR26","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.13328\/j.cnki.jos.004589","volume":"26","author":"JC Xu","year":"2015","unstructured":"Xu JC, Huang YZ, Guo SZ, Zhou B, Zhao J (2015) Testing platform for floating mathematical function libraries. J Softw 26(6):1306\u20131321. https:\/\/doi.org\/10.13328\/j.cnki.jos.004589","journal-title":"J Softw"},{"issue":"06","key":"3937_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.11896\/j.issn.1002-137X.2014.06.003","volume":"41","author":"JC Xu","year":"2014","unstructured":"Xu JC, Guo SZ, Huang YZ, Wang L (2014) Access optimization technique for mathematical library of slave processors on heterogeneous many-core architectures. Comput Sci 41(06):12\u201317. https:\/\/doi.org\/10.11896\/j.issn.1002-137X.2014.06.003","journal-title":"Comput Sci"},{"key":"3937_CR28","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TC.2010.128","volume":"60","author":"FD Dinechin","year":"2011","unstructured":"Dinechin FD, Lauter C, Melquiond G (2011) Certifying the floatingpoint implementation of an elementary function using Gappa. IEEE Trans Comput 60:242\u2013253. https:\/\/doi.org\/10.1109\/TC.2010.128","journal-title":"IEEE Trans Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03937-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03937-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03937-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T11:24:48Z","timestamp":1643023488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03937-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,25]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["3937"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03937-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,6,25]]},"assertion":[{"value":"7 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}