A sparse matrix (or vector, or array) is one in which most of the elements are zero. If storage space is more important than access speed, it may be preferable to store a sparse matrix as a list of (index, value) pairs or use some kind of hash scheme or associative memory. (1995-01-16)

In addition suitable contents:
[ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ array ] [ as ] [ ash ] [ associative memory ] [ at ] [ b ] [ be ] [ cc ] [ ch ] [ ci ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ element ] [ er ] [ era ] [ es ] [ fi ] [ file ] [ ge ] [ h ] [ hash ] [ hr ] [ id ] [ il ] [ import ] [ in ] [ index ] [ ir ] [ is ] [ it ] [ ki ] [ Lex ] [ li ] [ list ] [ lu ] [ ma ] [ memory ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ne ] [ om ] [ pa ] [ pe ] [ ph ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ sc ] [ se ] [ sh ] [ so ] [ space ] [ st ] [ storage ] [ store ] [ th ] [ to ] [ tr ] [ us ] [ va ] [ value ] [ ve ] [ vector ] [ zero ]