✦ LIBER ✦

Hashing the subscripts of a sparse matrix

✍ Scribed by E. v. d. S. de Villiers; L. B. Wilson

Book ID: 105403196
Publisher: Springer Netherlands
Year: 1974
Tongue: English
Weight: 818 KB
Volume: 14
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933234

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compact sparse matrix representation u

A compact sparse matrix representation using random hash functions

✍ Ji-Han Jiang; Chin-Chen Chang; Tung-Shou Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 374 KB

In this paper, a practical method is presented that allows for the compact representation of sparse matrices. We have employed some random hash functions and applied the rehash technique to the compression of sparse matrices. Using our method, a large-scale sparse matrix can be compressed into some

A sparse-sparse iteration for computing

A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix

✍ Davod Khojasteh Salkuyeh; Faezeh Toutounian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Sparse estimation of a covariance matrix

✍ Bien, J.; Tibshirani, R. J. 📂 Article 📅 2011 🏛 Oxford University Press 🌐 English ⚖ 361 KB

Portrait of the inverse of a sparse matr

Portrait of the inverse of a sparse matrix

✍ Yu. B. Gol'dshtein 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 415 KB

On computing the inverse of a sparse mat

On computing the inverse of a sparse matrix

✍ H. Niessner; K. Reichert 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 697 KB

Optimal parallel triangulation of a spar

Optimal parallel triangulation of a sparse matrix

✍ Huang, J.; Wing, O. 📂 Article 📅 1979 🏛 IEEE ⚖ 822 KB