Sparse matrix (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sparse matrix" in English language version.

Last modified:

Ref.Un. Ref.Website
Global rank English rank
2nd place
2nd place
low place
low place
828th place
485th place
8,120th place
6,195th place
621st place
429th place
4th place
4th place
low place
low place
15th place
8th place
934th place
530th place
1st place
1st place
1,293rd place
776th place

anl.gov (Global: 8,120th place; English: 6,195th place)

berkeley.edu (Global: 621st place; English: 429th place)

people.eecs.berkeley.edu

businesswire.com (Global: 828th place; English: 485th place)

  • "Cerebras Systems Unveils the Industry's First Trillion Transistor Chip". www.businesswire.com. 2019-08-19. Retrieved 2019-12-02. The WSE contains 400,000 AI-optimized compute cores. Called SLAC™ for Sparse Linear Algebra Cores, the compute cores are flexible, programmable, and optimized for the sparse linear algebra that underpins all neural network computation

doi.org (Global: 2nd place; English: 2nd place)

  • Yan, Di; Wu, Tao; Liu, Ying; Gao, Yang (2017). "An efficient sparse-dense matrix multiplication on a multicore system". 2017 IEEE 17th International Conference on Communication Technology (ICCT). IEEE. pp. 1880–3. doi:10.1109/icct.2017.8359956. ISBN 978-1-5090-3944-9. The computation kernel of DNN is large sparse-dense matrix multiplication. In the field of numerical analysis, a sparse matrix is a matrix populated primarily with zeros as elements of the table. By contrast, if the number of non-zero elements in a matrix is relatively large, then it is commonly considered a dense matrix. The fraction of zero elements (non-zero elements) in a matrix is called the sparsity (density). Operations using standard dense-matrix structures and algorithms are relatively slow and consume large amounts of memory when applied to large sparse matrices.
  • Saad 2003 Saad, Yousef (2003). Iterative Methods for Sparse Linear Systems. SIAM. doi:10.1137/1.9780898718003. ISBN 978-0-89871-534-7. OCLC 693784152.
  • Bank, Randolph E.; Douglas, Craig C. (1993), "Sparse Matrix Multiplication Package (SMMP)" (PDF), Advances in Computational Mathematics, 1: 127–137, doi:10.1007/BF02070824, S2CID 6412241

dtic.mil (Global: 934th place; English: 530th place)

apps.dtic.mil

  • Eisenstat, S. C.; Gursky, M. C.; Schultz, M. H.; Sherman, A. H. (April 1977). "Yale Sparse Matrix Package" (PDF). Archived (PDF) from the original on April 6, 2019. Retrieved 6 April 2019.

mgnet.org (Global: low place; English: low place)

scipy.org (Global: low place; English: low place)

docs.scipy.org

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

umn.edu (Global: 1,293rd place; English: 776th place)

purl.umn.edu

web.archive.org (Global: 1st place; English: 1st place)

  • Eisenstat, S. C.; Gursky, M. C.; Schultz, M. H.; Sherman, A. H. (April 1977). "Yale Sparse Matrix Package" (PDF). Archived (PDF) from the original on April 6, 2019. Retrieved 6 April 2019.

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org