한국정보과학회:학술대회논문집 (Proceedings of the Korean Information Science Society Conference)
- 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
- /
- Pages.400-402
- /
- 2006
- /
- 1598-5164(pISSN)
A Hybrid Approach on Matrix Multiplication
- Tolentino Maribel (Department of Computer Engineering, Hankuk Aviation University) ;
- Kim Myung-Kyu (Department of Computer Engineering, Hankuk Aviation University) ;
- Chae Soo-Hoan (Department of Computer Engineering, Hankuk Aviation University)
- 발행 : 2006.06.01
초록
Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a
키워드