Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices.
Enver KayaaslanBora UçarPublished in: HiPC (2014)
Keyphrases
- singular value decomposition
- kronecker product
- tensor factorization
- low rank
- low rank matrix
- sparse matrix
- missing entries
- matrix factorization
- coefficient matrix
- sparse matrices
- tree structure
- parallel processing
- low rank matrices
- measurement matrix
- data matrix
- matrix completion
- distance matrix
- low rank approximation
- sparse coding
- tree structures
- computer architecture
- parallel implementation
- distributed memory
- shared memory
- b tree
- sparse representation
- linear algebra
- tensor decomposition
- binary matrices