行列の式の並列計算について

概要

論文の詳細を見る
In this paper we consider the parallel evaluation of matrix expressions using arbitrarily many independent processors. We first give upper bounds on the time required to perform binary matrix operations: addition, subtraction and multiplication. Second, we give upper bounds on the time required to evaluate matrix expressions with on inversions, and then give bounds for expressions with inversions. Finally, we consider the time required to evaluate polynomial forms of matrices.
一般社団法人情報処理学会の論文
1974-05-15