Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hans Aribowo"'
Publikováno v:
Concurrency and Computation: Practice and Experience. 25:586-603
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f5bb50f59762cf767ef90b4c450b501
https://doi.org/10.1002/cpe.2896
https://doi.org/10.1002/cpe.2896
Publikováno v:
Euro-Par 2011 Parallel Processing ISBN: 9783642233968
Euro-Par (2)
Euro-Par (2)
The Block Wiedemann (BW) and the Block Lanczos (BL) algorithms are frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix-vector multiplication is the most time consuming operation of these approaches. The necessity to acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e46cac39022241319c1a2c72e4cf8f01
https://doi.org/10.1007/978-3-642-23397-5_41
https://doi.org/10.1007/978-3-642-23397-5_41
