Author:
Pichel Juan C.,Rivera Francisco F.
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference29 articles.
1. An approximate minimum degree ordering algorithm;Amestoy;SIAM J. Matrix Anal. Appl.,1996
2. M. Belgin, G. Back, C.J. Ribbens, Pattern-based sparse matrix representation for memory-efficient SMVM kernels, in: Proc. of the Int. Conf. on Supercomputing, 2009, pp. 100–109.
3. Efficient sparse matrix–vector multiplication on CUDA, Tech. Rep., NVIDIA;Bell,2008
4. Performance optimization and modeling of blocked sparse kernels;Buttari;Int. J. High Perform. Comput. Appl.,2007
5. Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations;Coutinho;Internat. J. Numer. Methods Engrg.,2006
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献