Author:
Nguyen D. K.,Lavallee I.,Bui M.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. L. E. Cannon. A cellular computer to implement the kalman filter algorithm. Ph.d. thesis, Montana State University, 1969.
2. J. Choi. A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers. In 11th International Parallel Processing Symposium, pages 310–317, Geneva, Switzerland, April 1997. IEEE CS.
3. J. Choi, J. J. Dongarra, and D. W. Walker. Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience, 6(7):543–570, 1994.
4. C.-C. Chou, Y. Deng, G. Li, and Y. Wang. Parallelizing strassen’s method for matrix multiplication on distributed memory mimd architectures. Computers and Math. with Applications, 30(2):4–9, 1995.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251–280, 1990.