Techniques for parallel manipulation of sparse matrices
From MaRDI portal
Publication:1119337
DOI10.1016/0304-3975(89)90058-3zbMath0671.65033OpenAlexW2056824130MaRDI QIDQ1119337
Larry Rudolph, Clyde P. Kruskal, Marc Snir
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90058-3
sparse matricesGaussian eliminationmultiplicationmatrix additionmatrix transposematrix- vector multiplicationparallel MIMD computersrow and column permutation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results ⋮ MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗
Uses Software
Cites Work
- Direct methods for sparse matrices
- An almost optimal algorithm for unbounded searching
- Sparse matrix techniques, Copenhagen 1976. Advanced course held at the Technical University of Denmark, Copenhagen, August 9-12, 1976
- The Elimination form of the Inverse and its Application to Linear Programming
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- Parallel Prefix Computation
- Ultracomputers
- A New Implementation of Sparse Gaussian Elimination
- Fast Parallel Matrix Inversion Algorithms
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Techniques for parallel manipulation of sparse matrices
