Permuting sparse rectangular matrices into block-diagonal form

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage1879en_US
dc.citation.issueNumber6en_US
dc.citation.spage1860en_US
dc.citation.volumeNumber25en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorPınar, A.en_US
dc.contributor.authorÇatalyürek Ü. V.en_US
dc.date.accessioned2016-02-08T10:24:44Z
dc.date.available2016-02-08T10:24:44Zen_US
dc.date.issued2004en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe investigate the problem of permuting a sparse rectangular matrix into block-diagonal form. Block-diagonal form of a matrix grants an inherent parallelism for solving the deriving problem, as recently investigated in the context of mathematical programming, LU factorization, and QR factorization. To represent the nonzero structure of a matrix, we propose bipartite graph and hypergraph models that reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Our experiments on a wide range of matrices, using the state-of-the-art graph and hypergraph partitioning tools MeTiS and PaToH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and runtime.en_US
dc.identifier.doi10.1137/S1064827502401953en_US
dc.identifier.issn1064-8275
dc.identifier.urihttp://hdl.handle.net/11693/24145en_US
dc.language.isoEnglishen_US
dc.publisherSIAMen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/S1064827502401953en_US
dc.source.titleSIAM Journal on Scientific Computingen_US
dc.subjectCoarse-grain parallelismen_US
dc.subjectDoubly bordered block-diagonal formen_US
dc.subjectGraph partitioning by vertex separatoren_US
dc.subjectHypergraph partitioningen_US
dc.subjectSingly bordered block-diagonal formen_US
dc.subjectSparse rectangular matricesen_US
dc.subjectCoarse-grain parallelismen_US
dc.subjectDoubly bordered block-diagnol formen_US
dc.subjectGraph partitioning by vertex separatorsen_US
dc.subjectHypergraph partitioningen_US
dc.subjectSingly bordered block diagnol formen_US
dc.subjectSparse rectangular matricesen_US
dc.subjectAlgorithmsen_US
dc.subjectApproximation theoryen_US
dc.subjectGraph theoryen_US
dc.subjectMathematical modelsen_US
dc.subjectMathematical programmingen_US
dc.subjectProblem solvingen_US
dc.subjectMatrix algebraen_US
dc.titlePermuting sparse rectangular matrices into block-diagonal formen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Permuting sparse rectangular matrices into block-diagonal form.pdf
Size:
763.53 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Computer Engineering