A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices.
Michel CosnardLaura GrigoriPublished in: ICS (2001)
Keyphrases
- parallel algorithm
- kronecker product
- singular value decomposition
- tensor factorization
- sparse matrices
- measurement matrix
- sparse matrix
- random projections
- coefficient matrix
- low rank matrix
- low rank
- parallel computation
- data matrix
- binary search trees
- matrix factorization
- interior point methods
- parallel programming
- discovery of association rules
- cluster of workstations
- matrix completion
- pairwise
- parallel implementations
- processor array
- multibody