Sciweavers

64 search results - page 9 / 13
» Sparse Matrix Multiplication Using UPC
Sort
View
ICCS
2009
Springer
13 years 5 months ago
Parallel MLEM on Multicore Architectures
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...
Tilman Küstner, Josef Weidendorfer, Jasmine S...
IPPS
2007
IEEE
14 years 1 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
TSMC
2010
13 years 2 months ago
Probability Density Estimation With Tunable Kernels Using Orthogonal Forward Regression
A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimat...
Sheng Chen, Xia Hong, Chris J. Harris
SPAA
1998
ACM
13 years 11 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad