#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2014

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Tomonori Kouya
- ArXiv
- 2014

The Strassen algorithm and Winograd’s variant accelerate matrix multiplication by using fewer arithmetic operations than standard matrix multiplication. Although many papers have been published to accelerate singleas well as double-precision matrix multiplication by using these algorithms, no research to date has been undertaken to accelerate multiple… (More)

- Tomonori Kouya
- ArXiv
- 2014

We evaluate the performance of the Krylov subspace method by using highly efficient multiple precision sparse matrix-vector multiplication (SpMV). BNCpack is our multiple precision numerical computation library based on MPFR/GMP, which is one of the most efficient arbitrary precision floating-point arithmetic libraries. However, it does not include… (More)

- Tomonori Kouya
- ArXiv
- 2015

It is well known that Strassen and Winograd algorithms can reduce the computational costs associated with dense matrix multiplication. We have already shown that they are also very effective for software-based multiple precision floating-point arithmetic environments such as the MPFR/GMP library. In this paper, we show that we can obtain the same… (More)

- Tomonori Kouya
- 2017

Although reliable long precision floating-point arithmetic libraries such as QD and MPFR/GMP are necessary to solve ill-conditioned problems in numerical simulation, long precision BLAS-level computation such as matrix multiplication has not been fully optimized because tuning costs are very high compared to IEEE float and double precision arithmetic. In… (More)

- ‹
- 1
- ›