Block partitioning of sparse rectangular matrices

Abstract: We present a means of reordering large, sparse rectangular matrices such that their nonzeros are closer to the diagonal. This enables a block‐partitioning which is useful in parallel contexts. We use the Reverse Cuthill‐McKee (RCM) algorithm on the adjacency matrix of the associated bipartite graph. The resulting, reordered matrix has a block bidiagonal structure.

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Block partitioning of sparse rectangular matrices ; volume:19 ; number:1 ; year:2019 ; extent:2
Proceedings in applied mathematics and mechanics ; 19, Heft 1 (2019) (gesamt 2)

Creator
Dumitrasc, Andrei
Leleux, Philippe
Rüde, Ulrich

DOI
10.1002/pamm.201900287
URN
urn:nbn:de:101:1-2022072207113469494290
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:26 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Dumitrasc, Andrei
  • Leleux, Philippe
  • Rüde, Ulrich

Other Objects (12)