Výsledky vyhledávání - "Tomonori, KOUYA"

Development of Teaching Materials for Python-based Web Programming using Flask

Autor: Tomonori, KOUYA

Publikováno v: 静岡理工科大学紀要 = The Bulletin of the Shizuoka Institute of Science and Technology. 30:123-128

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::28571a042e556ed467e12512439f0258
http://id.nii.ac.jp/1617/00000306/

Zobrazit plný text záznamu

Acceleration of LU decomposition supporting double-double, triple-double, and quadruple-double precision floating-point arithmetic with AVX2

Autor: Tomonori Kouya

Publikováno v: ARITH

In this paper, we report the results obtained from the acceleration of multi-binary64-type multiple precision LU decomposition with Intel's Advanced Vector Extensions 2 (AVX2). We targeted double-double (DD), triple-double (TD), and quad-double (QD)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ce21eb0ec3b683662c669c90141097ec
https://doi.org/10.1109/arith51176.2021.00021

Zobrazit plný text záznamu

Acceleration of Multiple Precision Matrix Multiplication Based on Multi-component Floating-Point Arithmetic Using AVX2

Autor: Tomonori Kouya

Publikováno v: Computational Science and Its Applications – ICCSA 2021 ISBN: 9783030869755
ICCSA (5)

In this paper, we report the results obtained from the acceleration of multi-binary64-type multiple precision block and Strassen matrix multiplications with AVX2. We target double-double (DD), triple-double (TD), and quad-double (QD) precision arithm

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7ad23b685dd59d2f0637f273a0b4fa85
https://doi.org/10.1007/978-3-030-86976-2_14

Zobrazit plný text záznamu

Performance Evaluation of Strassen Matrix Multiplication Supporting Triple-Double Precision Floating-Point Arithmetic

Autor: Tomonori Kouya

Publikováno v: Computational Science and Its Applications – ICCSA 2020 ISBN: 9783030588137
ICCSA (5)

The Strassen matrix multiplication can be categorized into divide-and-conquer algorithms, and they are known as the most efficient algorithms. We previously implemented them supporting multiple precision floating-point arithmetic using MPFR and Baile

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c65041037c3544d3d1c0a8f29f095449
https://doi.org/10.1007/978-3-030-58814-4_12

Zobrazit plný text záznamu

Performance Evaluation of an Efficient Double-Double BLAS1 Function With Error-Free Transformation and its Application to Explicit Extrapolation Methods

Autor: Tomonori Kouya

Publikováno v: ARITH

Error-free transformation (EFT) has been recently applied to solve ill-conditioned problems. This transformation can reduce the number of arithmetic operations required compared to multiple precision arithmetic. In this study, we implement double-dou

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::43036b4ca2cadb8b0b017711cc610b12
https://doi.org/10.1109/arith.2019.00032

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání