Sciweavers

10 search results - page 2 / 2
» Minimizing communication in sparse matrix solvers
Sort
View
ICCSA
2003
Springer
13 years 10 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
EUROPAR
2004
Springer
13 years 10 months ago
Task-Queue Based Hybrid Parallelism: A Case Study
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
Karl Fürlinger, Olaf Schenk, Michael Hagemann
TSP
2008
146views more  TSP 2008»
13 years 5 months ago
Improved M-FOCUSS Algorithm With Overlapping Blocks for Locally Smooth Sparse Signals
Abstract-- The FOCal Underdetermined System Solver (FOCUSS) algorithm has already found many applications in signal processing and data analysis, whereas the regularized MFOCUSS al...
Rafal Zdunek, Andrzej Cichocki
CVPR
2012
IEEE
11 years 7 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
GLOBECOM
2009
IEEE
13 years 12 months ago
Multiple Target Localization Using Compressive Sensing
Abstract— In this paper, a novel multiple target localization approach is proposed by exploiting the compressive sensing theory, which indicates that sparse or compressible signa...
Chen Feng, Shahrokh Valaee, Zhenhui Tan