81 search results - page 3 / 17 » Using fast matrix multiplication to solve structured linear ... |
ADCM
2007
14 years 9 months ago
2007
The purpose of this paper is to develop a spectral analysis of the Hessenberg matrix obtained by the GMRES algorithm used for solving a linear system with a singular matrix. We pr...
69
Voted
DAC
2009
ACM
15 years 10 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
PC
2002
14 years 9 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
182
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
104
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
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...