Sciweavers

180 search results - page 1 / 36
» Approximation of matrix operators applied to multiple vector...
Sort
View
MCS
2008
Springer
13 years 4 months ago
Approximation of matrix operators applied to multiple vectors
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
Marlis Hochbruck, Jörg Niehoff
ICASSP
2011
IEEE
12 years 8 months ago
Image editing based on Sparse Matrix-Vector multiplication
This paper presents a unified model for image editing in terms of Sparse Matrix-Vector (SpMV) multiplication. In our framework, we cast image editing as a linear energy minimizat...
Ying Wang, Hongping Yan, Chunhong Pan, Shiming Xia...
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
SAMOS
2010
Springer
13 years 2 months ago
A Polymorphic Register File for matrix operations
—Previous vector architectures divided the available register file space in a fixed number of registers of equal sizes and shapes. We propose a register file organization whic...
Catalin Bogdan Ciobanu, Georgi Kuzmanov, Georgi Ga...
MST
2010
121views more  MST 2010»
13 years 2 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna