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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1940-2019
0200040006000800019402018

Related topics

Related topics

50 relations
APMonitorARPACKASCENDASTAP
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
Sparse matrix
Numerical analysis
Iterative method
Data compression
Data structure
Computer data storage

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
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… (More)
  • table 3.1
  • table 3.2
  • figure 3.1
  • figure 3.2
  • figure 5.1
Is this relevant?
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… (More)
  • figure 4.1
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
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… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Efficient Sparse Matrix-Vector Multiplication on CUDA
The massive parallelism of graphics processing units (GPUs) offers tremendous performance in many high-performance computing… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Sparsity: Optimization Framework for Sparse Matrix Kernels
Sparse matrix-vector multiplication is an important computational kernel that performs poorly on most modern processors due to a… (More)
  • table 1
  • table 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Automatic Performance Tuning of Sparse Matrix Kernels
Automatic Performance Tuning of Sparse Matrix Kernels 
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A Sparse Matrix Arithmetic Based on H-Matrices . Part I : Introduction to H-Matrices
A class of matrices (H-matrices) is introduced which have the following properties. (i) They are sparse in the sense that only… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Sparse matrix test problems
We describe the Harwell-Boeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. Our test set… (More)
Is this relevant?