Sparsity of a matrix

From Linear
Revision as of 15:53, 1 May 2014 by Vipul (talk | contribs) (Created page with "==Definition== Suppose <math>m,n</math> are positive integers and <math>A</math> is a <math>m \times n</math> matrix. The '''sparsity''' or '''sparseness''' of <math>A</math>...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

Suppose are positive integers and is a matrix. The sparsity or sparseness of is defined as the fraction of entries of that have value 0. Explicitly, it is the ratio:

Failed to parse (syntax error): {\displaystyle \frac{# \{ (i,j) \in \{ 1,2,\dots,m\} \times \{1,2,\dots,n \} : a_{ij} = 0 \}}{mn}}

The sparsity of the matrix can also be defined as 1 minus its density. Formulas about the relation with matrix operations are more neatly expressed in terms of density than sparsity.

See also