Sciweavers

2239 search results - page 1 / 448
» Computing with abstract matrix structures
Sort
View
ISSAC
2009
Springer
137views Mathematics» more  ISSAC 2009»
13 years 11 months ago
Computing with abstract matrix structures
Alan P. Sexton, Volker Sorge, Stephen M. Watt
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 4 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
HPCC
2005
Springer
13 years 10 months ago
Fast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
Richard W. Vuduc, Hyun-Jin Moon
ICCS
2001
Springer
13 years 9 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
EUROPAR
2009
Springer
13 years 9 months ago
Two-Dimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Based on Their Functional Performance Mod
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
Alexey L. Lastovetsky, Ravi Reddy