Sparse matrix–vector multiplication

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Sparse matrix–vector multiplication (SpMV) of the form is a widely used computational kernel existing in many scientific applications. The input matrix is sparse. The input vector and the output vector are dense. In the case of a repeated operation involving the same input matrix but possibly changing numerical values of its elements, can be preprocessed to reduce both the parallel and sequential run time of the SpMV kernel.

Sparse matrix–vector multiplication (SpMV) of the form is a widely used computational kernel existing in many scientific applications. The input matrix is sparse. The input vector and the output vector are dense. In the case of a repeated operation involving the same input matrix but possibly changing numerical values of its elements, can be preprocessed to reduce both the parallel and sequential run time of the SpMV kernel.

See also

Matrix–vector multiplication

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1373521231 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001373521231 · captured 1788691621.0 · version history

Cite this page as: encyclopegia.org, “Sparse matrix–vector multiplication”, snapshot enwiki-001373521231. https://encyclopegia.org/a/sparse-matrix-vector-multiplication

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.