Partitioning sparse rectangular matrices for parallel processing
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A semidiscrete matrix decomposition for latent semantic indexing information retrievalACM Transactions on Information Systems, 1998
- Partitioning sparse rectangular matrices for parallel computations of Ax and A T vPublished by Springer Nature ,1998
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- Spectral partitioningPublished by Association for Computing Machinery (ACM) ,1995
- A computational study of graph partitioningMathematical Programming, 1994
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Digital Image Compression by Outer Product ExpansionIEEE Transactions on Communications, 1983
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982