Abstract
Mono sparse matrices.
A mono sparse matrix is a matrix that stores fewer elements than a corresponding dense regular matrix (non-stored elements are assumed to be zero). There are two kinds of mono sparse matrices, one that stores only one element per row (mono sparse row matrix) and one that stores only one element per column (mono sparse column matrix).
Synopsis
local module type mono = {
| |||||||||||||||||||||||||||||||||||
module mk_mono | : | (T: field) -> mono with t = T.t |
Description
- ↑local module type mono
- ↑type t
- ↑type sr [n] [m]
- ↑type sc [n] [m]
- ↑module sr
Mono sparse row representation.
- include matrix_regular with t = t with mat [n] [m] = sr [n] [m]
- ↑val transpose [n] [m]: mat [n] [m] -> sc [m] [n]
Matrix transposition.
- ↑val smvm [n] [m]: mat [n] [m] -> [m]t -> [n]t
Sparse matrix vector multiplication. Given a sparse
n
timesm
matrix and a vector of sizem
, the function returns a vector of sizen
, the result of multiplying the argument matrix with the argument vector.
- ↑module sc
Mono sparse column representation.