An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
Tensors, linear-algebraic extensions of matrices in arbitrary dimensions, have numerous applications in computer science and computational science. Many tensors are sparse, containing more than 90% zero entries. Efficient algorithms can leverage sparsity to do less work, but the irregular locations...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/109792 |