First, the result was proved that two matrices tensor product can be exchanged in the sense of permutation similar and this explants that the tensor product of block matrixes can be block calculated in the sense of permutation similar. Second, the convenient constructing method for the permutation matrix is given. Third, the parallel computing models of matrix tensor product are proposed. Final, the thought and process of the algorithm are showed by an example.
HattoriMasamitsuItoNobuhiroChenWeiParallel Matrix-Multiplication Algorithm for Distributed Parallel Computers[J]. Systems and Computers in Japan, 2005, 36(4):48–59
2.
Oksa;?GabrielBecka;?MartinVajtersicMarian. Parallel algorithm for matrix multiplication by Gramian of Toeplitz-block matrix[C]. IASTED International Conference on Applied Informatics, International Sympsosium on Parallel and Distributed Computing and Networks.Innsbruck, Austria. 2002:53–58
3.
XiaozhouLIQinghuaLI. Implementation of Matrix Multiple Cannon Parallel Algorithm on Cluster of Workstations[J]. Computer Engineering, 2002, 28(6): 102–103, 107(In Chinese)
4.
XueboZhangXiaomeiLI. A Parallel Algorithm for Matrix Multiplication Based on Diagonal Partition Strategy[J]. Computer Engineering, 2004, 30 (6):42–43 (In Chinese)
5.
GuolvTAN. A Kind of Data Encryption Scheme Based on the Tensor Product of Matrices[J]. COMPUTER SCIENCE, 2002, 29(8):119–120, 125(In Chinese)
6.
MarcusM.. Finite Dimensional Multilinear Algebra, Part I.Marcel Dekker, New York, 1973.
