The algorithms for FPGA implementation of sparse matrices multiplication

zbMATH Open1413.65168MaRDI QIDQ4557985FDOQ4557985

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

Publication date: 27 November 2018

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

zbMATH Keywords

sparse matricesFPGAsparse BLASmatrices multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cited In (5)

• Sparse Cholesky factorization on FPGA using parameterized model
• FPGA based high performance double-precision matrix multiplication
• Mapping full‐systolic arrays for matrix product on XILINX's XC4000(E,EX) FPGAs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)