Multilinear algebra and parallel programming
暂无分享,去创建一个
[1] R. Tolimieri,et al. Algorithms for Discrete Fourier Transform and Convolution , 1989 .
[2] R. W. Johnson,et al. A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.
[3] Robert Schreiber,et al. Block Algorithms for Parallel Machines , 1988 .
[4] V. Strassen. Gaussian elimination is not optimal , 1969 .
[5] Thomas E. Anderson,et al. The performance implications of thread management alternatives for shared-memory multiprocessors , 1989, SIGMETRICS '89.
[6] Nicholas J. Higham,et al. Exploiting fast matrix multiplication within the level 3 BLAS , 1990, TOMS.
[7] R. W. Johnson,et al. A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures , 1990 .
[8] Webb Miller. Computational complexity and numerical stability , 1974, STOC '74.
[9] Hans F. de Groote. Lectures on the Complexity of Bilinear Problems , 1987, Lecture Notes in Computer Science.
[10] David H. Bailey,et al. Extra high speed matrix multiplication on the Cray-2 , 1988 .
[11] Marshall C. Pease,et al. An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.
[12] Chua-Huang Huang,et al. A report on the performance of an implementation of Strassen's algorithm , 1991 .
[13] S. Winograd. Arithmetic complexity of computations , 1980 .