Sciweavers

25 search results - page 2 / 5
» A Family of High-Performance Matrix Multiplication Algorithm...
Sort
View
TOMS
2008
120views more  TOMS 2008»
13 years 4 months ago
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a tr...
Paolo Bientinesi, Brian C. Gunter, Robert A. van d...
FOCS
2005
IEEE
13 years 10 months ago
Group-theoretic Algorithms for Matrix Multiplication
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
Henry Cohn, Robert D. Kleinberg, Balázs Sze...
ARC
2010
Springer
387views Hardware» more  ARC 2010»
13 years 11 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides
ICCD
2005
IEEE
246views Hardware» more  ICCD 2005»
14 years 1 months ago
H-SIMD Machine: Configurable Parallel Computing for Matrix Multiplication
FPGAs (Field-Programmable Gate Arrays) are often used as coprocessors to boost the performance of dataintensive applications [1, 2]. However, mapping algorithms onto multimillion-...
Xizhen Xu, Sotirios G. Ziavras
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
13 years 10 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna