Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
From MaRDI portal
Publication:4509819
DOI10.1137/S1064827598341475zbMath0960.65050MaRDI QIDQ4509819
Tamara G. Kolda, Bruce A. Hendrickson
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
bipartite graphparallel computingsparse matrixrectangular matrixmatrix-vector multiplicationmatrix partioningstructurally unsymmetric matrix
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Graph bisection revisited ⋮ An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem ⋮ Compact linearization for binary quadratic problems ⋮ Load balancing fictions, falsehoods and fallacies ⋮ Parallelization of population-based multi-objective meta-heuristics: an empirical study ⋮ Optimal block-tridiagonalization of matrices for coherent charge transport ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem
Uses Software
This page was built for publication: Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
