@techreport{oai:ipsj.ixsq.nii.ac.jp:00210000,
 author = {鈴木, 智博 and Shen, Zhongyu and Tomohiro, Suzuki and Zhongyu, Shen},
 issue = {2},
 month = {Mar},
 note = {線形方程式の直 7接解法ではピボット選択が不可欠であるが，これにより発生する大量のデータ移動はソルバーの性能低下の要因となる．これに対して，解法の前進消去過程で対角要素が0とならない行列を生成する前処理がある．今回，名古屋大学不老スーパーコンピュータ上で，タイルアルゴリズムでこの前処理付きの不定値密対称行列の線形ソルバーを実装し，ソルバーの性能とこの前処理の効果を調査した結果を報告する．, Pivoting is essential for a direct solver of linear equations. However, the large amount of data movement caused by this process can degrade the solver's performance. There is a preconditioning method for this problem to generate a matrix whose diagonal elements do not become zero in the forward elimination process. In this report, we implement a tiled solver for dense indefinite symmetric systems with the randomized preconditioning on the Flow supercomputer of Nagoya University and report this solver's performance and the effects of this preconditioning.},
 title = {RBT前処理付き不定値密対称行列線形ソルバ},
 year = {2021}
}