Abstract
Solving a linear system with large sparse matrices is a com-putational kernel used in a wide range of applications. The block version of Wiedemann’s algorithm proposed in [Wiedemann 1986] takes advantage of the sparsity to achieve better performance. Our objectives in this poster is to provide an efficient implementation of block Wiedemann algorithm on NUMA multicores architectures.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
