The algorithms for FPGA implementation of sparse matrices multiplication

MaRDI QIDQ4557985zbMATH OpenFDO

Authors Ernest Jamro, Tomasz Pabiś, P. Russek, Kazimierz Wiatr

Publication date 27 November 2018

zbMATH Keywords

sparse matricesFPGAsparse BLASmatrices multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 1941106
• FPGA based high performance double-precision matrix multiplication
• scientific article; zbMATH DE number 882133
• Processor-efficient sparse matrix-vector multiplication
• A note on the multiplication of sparse matrices

Cited in

(5)

• FPGA based high performance double-precision matrix multiplication
• Sparse Cholesky factorization on FPGA using parameterized model
• scientific article; zbMATH DE number 1941106 (Why is no real title available?)
• Mapping full‐systolic arrays for matrix product on XILINX's XC4000(E,EX) FPGAs
• scientific article; zbMATH DE number 1849101 (Why is no real title available?)

This page was built for publication: The algorithms for FPGA implementation of sparse matrices multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557985)