Factorization-Based Graph Repartitionings

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F10%3A00348801" target="_blank" >RIV/67985807:_____/10:00348801 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Factorization-Based Graph Repartitionings

Original language description

The paper deals with the parallel computation of matrix factorization using graph partitioning-based domain decomposition. It is well-known that the partitioned graph may have both a small separator and well-balanced domains but sparse matrix decompositions on domains can be completely unbalanced. In this paper we propose to enhance the iterative strategy for balancing the decompositions by graph-theoretical tools. We propose the whole framework for the graph repartitioning. In particular, new global and local reordering strategies for domains are discussed in more detail. We present both theoretical results for structured grids and experimental results for unstructured large-scale problems.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/IAA100300802" target="_blank" >IAA100300802: Theory of Krylov subspace methods and its relationship to other mathematical disciplines</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Large Scale Scientific Computing

ISBN

978-3-642-12534-8

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

Sozopol

Event date

Jun 4, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000278091900092