学際大規模情報基盤共同利用・共同研究拠点

採択課題 【詳細】

jh240033 Hierarchical Low-Rank Approximation Methods on Distributed Memory and GPUs
課題代表者 横田理央(東京科学大学 情報基盤センター)
Rio Yokota (Center for Information Infrastructure,Institute of Science Tokyo)
概要

The success and importance of dense linear algebra libraries such as BLAS and LAPACK in high performance computing can be seen from Jack Dongarra’s receipt of the ACM Turing award. However, in the modern era of low/mixed-precision computing, it does not make sense to compute such dense linear algebra operations with exact algorithms that require O(N^3) compute and O(N^2) memory. The purpose of this research project is to replace BLAS and LAPACK with approximate dense linear algebra methods using H-matrices, which can reduce the compute and memory complexity to O(N).

報告書等 研究紹介ポスター / 最終報告書
関連Webページ
無断転載禁止