Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Sparse matrix

Known as: Dense matrix, Sparse vector, Sparsity 
In numerical analysis, a sparse matrix is a matrix in which most of the elements are zero. By contrast, if most of the elements are nonzero, then the… Expand
Wikipedia

Related topics

Related topics

50 relations
APMonitorARPACKASCENDASTAP
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to… Expand
  • figure 4.1
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform… Expand
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Ecient Sparse Matrix-Vector Multiplication on CUDA
The massive parallelism of graphics processing units (GPUs) oers tremendous performance in many high-performance computing… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Sparse matrix solvers on the GPU: conjugate gradients and multigrid
Many computer graphics applications require high-intensity numerical simulation. We show that such computations can be performed… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Non-negative Matrix Factorization with Sparseness Constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Iterative methods for sparse linear systems
Preface 1. Background in linear algebra 2. Discretization of partial differential equations 3. Sparse matrices 4. Basic iterative… Expand
  • figure 2.8
  • figure 3.10
  • figure 2.10
  • table 8.1
  • table 10.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A sparse matrix arithmetic based on H-matrices
A class of matrices (H-matrices) is introduced which have the following properties. (i) They are sparse in the sense that only… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The university of Florida sparse matrix collection
We describe the University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices that arise in… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1973
Highly Cited
1973
PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
The problem ofcomputing a small vertex separator in a graph arises in the context ofcomputing a good ordering for the parallel… Expand
  • figure 1
  • table 3
  • figure 3
  • table 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE