Sciweavers

236 search results - page 8 / 48
» Fast Sparse Matrix Multiplication
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
Fast matrix multiplication is stable
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix m...
James Demmel, Ioana Dumitriu, Olga Holtz, Robert K...
ICCS
2001
Springer
13 years 12 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
FCCM
2005
IEEE
142views VLSI» more  FCCM 2005»
14 years 1 months ago
FPGA-Based Vector Processing for Solving Sparse Sets of Equations
The solution to a set of sparse linear equations Ax = b, where A is an n×n sparse matrix and b is an n-element vector, can be obtained using the W-matrix method. An enhanced vect...
Muhammad Z. Hasan, Sotirios G. Ziavras
CP
2003
Springer
14 years 18 days ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
APLAS
2004
ACM
14 years 25 days ago
A MATLAB-Based Code Generator for Sparse Matrix Computations
Abstract. We present a matrix language compiler CMC which translates annotated MATLAB scripts into Fortran 90 programs. Distinguishing features of CMC include its applicability to ...
Hideyuki Kawabata, Mutsumi Suzuki, Toshiaki Kitamu...