Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Fukaya, Takeshi"'
In this paper, we focus on solving a sequence of linear systems with an identical (or similar) coefficient matrix. For this type of problems, we investigate the subspace correction and deflation methods, which use an auxiliary matrix (subspace) to ac
Externí odkaz:
http://arxiv.org/abs/2203.08498
Publikováno v:
JSIAM Letters, Volume 14 Pages 13-16, 2022
A performance prediction method for massively parallel computation is proposed. The method is based on performance modeling and Bayesian inference to predict elapsed time T as a function of the number of used nodes P (T=T(P)). The focus is on extrapo
Externí odkaz:
http://arxiv.org/abs/2110.14545
Sparse Matrix Vector multiplication (SpMV) is one of basic building blocks in scientific computing, and acceleration of SpMV has been continuously required. In this research, we aim for accelerating SpMV on recent CPUs for sparse matrices that have a
Externí odkaz:
http://arxiv.org/abs/2105.04937
In this paper, we develop a (preconditioned) GMRES solver based on integer arithmetic, and introduce an iterative refinement framework for the solver. We describe the data format for the coefficient matrix and vectors for the solver that is based on
Externí odkaz:
http://arxiv.org/abs/2009.07495
Autor:
Iakymchuk, Roman, Mukunoki, Daichi, Podobas, Artur, Jézéquel, Fabienne, Imamura, Toshiyuki, Fujita, Norihisa, Huthmann, Jens, Kudo, Shuhei, Tan, Yiyu, Domke, Jens, Ohlhus, Kai Torben, Fukaya, Takeshi, Hoshi, Takeo, Murakami, Yuki, Nakata, Maho, Ogita, Takeshi, Sano, Kentaro, Boku, Taisuke
In numerical computations, precision of floating-point computations is a key factor to determine the performance (speed and energy-efficiency) as well as the reliability (accuracy and reproducibility). However, precision generally plays a contrary ro
Externí odkaz:
http://arxiv.org/abs/2004.04628
Hierarchical Matrix (H-matrix) is an approximation technique which splits a target dense matrix into multiple submatrices, and where a selected portion of submatrices are low-rank approximated. The technique substantially reduces both time and space
Externí odkaz:
http://arxiv.org/abs/1911.00093
In this paper, we propose a new parallel ordering method to vectorize and parallelize the sparse triangular solver, which is called hierarchical block multi-color ordering. In this method, the parallel forward and backward substitutions can be vector
Externí odkaz:
http://arxiv.org/abs/1908.00741
Publikováno v:
In Journal of Computational and Applied Mathematics February 2023 419
The Cholesky QR algorithm is an efficient communication-minimizing algorithm for computing the QR factorization of a tall-skinny matrix. Unfortunately it has the inherent numerical instability and breakdown when the matrix is ill-conditioned. A recen
Externí odkaz:
http://arxiv.org/abs/1809.11085
Autor:
Tanaka, Kazuyuki, Imachi, Hiroto, Fukumoto, Tomoya, Kuwata, Akiyoshi, Harada, Yuki, Fukaya, Takeshi, Yamamoto, Yusaku, Hoshi, Takeo
An open-source middleware EigenKernel was developed for use with parallel generalized eigenvalue solvers or large-scale electronic state calculation to attain high scalability and usability. The middleware enables the users to choose the optimal solv
Externí odkaz:
http://arxiv.org/abs/1806.00741