Change search
ReferencesLink to record
Permanent link

Direct link
Compact Representation and Efficient Manipulation of Sparse Multidimensional Arrays
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Efficient manipulation of sparse multidimensional arrays, or tensors, is of interest because their decompositions have applications in many different areas. These areas include neuroscience, machine learning, psychometrics, data mining, numerical analysis, and more. This thesis aims to develop the performance-critical parts of a library for manipulating sparse multidimensional arrays by focusing on sorting them in one or more dimensions—a fundamental operation on which many other operations can be built.

High performance is achieved by tailoring algorithms to a compact representation scheme. Evaluation is done on different algorithms and implementation techniques. The result is shown to be 20 to 70 times faster than qsort in the C standard library. The resulting library is open source.

Place, publisher, year, edition, pages
2014. , 21 p.
, UMNAD, 996
National Category
Engineering and Technology
URN: urn:nbn:se:umu:diva-92841OAI: diva2:743838
Educational program
Bachelor of Science Programme in Computing Science
Available from: 2014-09-05 Created: 2014-09-05 Last updated: 2014-09-05Bibliographically approved

Open Access in DiVA

fulltext(458 kB)137 downloads
File information
File name FULLTEXT01.pdfFile size 458 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 137 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 387 hits
ReferencesLink to record
Permanent link

Direct link