التفاصيل البيبلوغرافية
| العنوان: |
Automatic generation of fast algorithms for matrix–vector multiplication. |
| المؤلفون: |
Andreatto, B.1 (AUTHOR) bandreatto@wi.zut.edu.pl, Cariow, A.1 (AUTHOR) |
| المصدر: |
International Journal of Computer Mathematics. Mar2018, Vol. 95 Issue 3, p626-644. 19p. |
| مصطلحات موضوعية: |
*MULTIPLICATION, *CROSS product (Mathematics), *MATRICES (Mathematics), *MATHEMATICAL optimization, *MATHEMATICAL decomposition |
| مستخلص: |
This paper describes the methods for finding fast algorithms for computing matrix–vector products including the procedures based on the block-structured matrices. The proposed methods involve an analysis of the structural properties of matrices. The presented approaches are based on the well-known optimization techniques: the simulated annealing and the hill-climbing algorithm along with its several extensions. The main idea of the proposed methods consists in finding a decomposition of the original matrix into a sparse matrix and a matrix corresponding to an appropriate block-structured pattern. The main criterion for optimizing is a reduction of the computational cost. The methods presented in this paper can be successfully implemented in many digital signal processing tasks. [ABSTRACT FROM PUBLISHER] |
| قاعدة البيانات: |
Academic Search Index |