{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:21:47Z","timestamp":1783034507014,"version":"3.54.6"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032305206","type":"print"},{"value":"9783032305213","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"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":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-30521-3_32","type":"book-chapter","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:11:18Z","timestamp":1783033878000},"page":"500-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Acceleration of\u00a0Multicomponent Multiple-Precision Arithmetic with\u00a0Branch-Free Algorithms and\u00a0SIMD Vectorization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0178-5519","authenticated-orcid":false,"given":"Tomonori","family":"Kouya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,3]]},"reference":[{"key":"32_CR1","unstructured":"Bailey, D.H.: QD. https:\/\/www.davidhbailey.com\/dhbsoftware\/"},{"issue":"3","key":"32_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\u2013242 (1971)","journal-title":"Numer. Math."},{"key":"32_CR3","unstructured":"Enge, A., Th\u00e9veny, P., Zimmermann, P.: MPC. http:\/\/www.multiprecision.org\/mpc\/"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Fabiano, N., Muller, J.M., Picot, J.: Algorithms for triple-word arithmetic. IEEE Trans. Comput. 68, 1573\u20131583 (2019)","DOI":"10.1109\/TC.2019.2918451"},{"key":"32_CR5","unstructured":"Granlaud, T., GMP development team. The GNU Multiple Precision arithmetic library. https:\/\/gmplib.org\/"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Hishinuma, T., Fujii, A., Tanaka, T., Hasegawa, H.: AVX acceleration of DD arithmetic between a sparse matrix and vector. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015b Niewski, J., eds., Parallel Processing and Applied Mathematics, pp. 622\u2013631, Berlin, Heidelberg, 2014. Springer Berlin Heidelberg (2014)","DOI":"10.1007\/978-3-642-55224-3_58"},{"key":"32_CR7","unstructured":"Kotakemori, T., Fujii, S., Hasegawa, H., Nishida, A.: Lis: Library of iterative solvers for linear systems. https:\/\/www.ssisc.org\/lis\/"},{"key":"32_CR8","unstructured":"Kouya, T.: BNCmatmul. https:\/\/github.com\/tkouya\/bncmatmul"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Kouya, T.: Acceleration of multiple precision matrix multiplication based on multicomponent floating-point arithmetic using avx2. In: Gervasi, O., et al., eds., Computational Science and Its Applications \u2013 ICCSA 2021, pp. 202\u2013217, Cham (2021). Springer International Publishing","DOI":"10.1007\/978-3-030-86976-2_14"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Kouya, T.: Performance evaluation of\u00c2 accelerated complex multiple-precision lu decomposition. In: Gervasi, O., et al., eds., Computational Science and Its Applications, ICCSA 2024 Workshops, pp. 3\u201319, Cham (2024). Springer Nature, Switzerland","DOI":"10.1007\/978-3-031-65273-8_1"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Lange, M., Rump, S.M.: Faithfully rounded floating-point computations. ACM Trans. Math. Softw. 46, No.\u00a03 (July 2020)","DOI":"10.1145\/3290955"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Lu, M., He, B., Luo, Q.: Supporting extended precision on graphics processors. In: Proceedings of the Sixth International Workshop on Data Management on New Hardware, DaMoN \u201910, pp. 19\u201326, New York, NY, USA, (2010). ACM","DOI":"10.1145\/1869389.1869392"},{"key":"32_CR13","unstructured":"MPLAPACK\/MPBLAS. Multiple precision arithmetic LAPACK and BLAS. https:\/\/github.com\/nakatamaho\/mplapack"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Mukunoki, D., Ozaki, K.: Sparse iterative solvers using high-precision arithmetic with quasi multi-word algorithms. In: 2025 IEEE 18th International Symposium on Embedded Multicore\/Many-core Systems-on-Chip (MCSoC), pp. 33\u201340. (2025)","DOI":"10.1109\/MCSoC67473.2025.00016"},{"key":"32_CR15","unstructured":"MPFR Project. The MPFR library. https:\/\/www.mpfr.org\/"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, D.K., Aiken, A.: Automatic verification of\u00c2 floating-point accumulation networks. In: Piskac, R., Rakamari\u0107, Z., eds. Computer Aided Verification, pp. 215\u2013237, Cham 2025. Springer Nature, Switzerland (2025)","DOI":"10.1007\/978-3-031-98682-6_12"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, D.K., Aiken, A.: High-performance branch-free algorithms for extended-precision floating-point arithmetic. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201925, p. 695\u2013710, New York, NY, USA, 2025. Association for Computing Machinery (2025)","DOI":"10.1145\/3712285.3759876"},{"key":"32_CR18","volume-title":"Trial Approach to Accelerate Multi-component-type Multiple-precision Basic Linear Computation with Arm Neon Intrinsics (in Japanese)","author":"T Kouya","year":"2025","unstructured":"Kouya, T.: Trial Approach to Accelerate Multi-component-type Multiple-precision Basic Linear Computation with Arm Neon Intrinsics (in Japanese). Technical report, HPC (2025)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30521-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:11:25Z","timestamp":1783033885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30521-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,3]]},"ISBN":["9783032305206","9783032305213"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30521-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,3]]},"assertion":[{"value":"3 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}