Není k dispozici

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099629" target="_blank" >RIV/68407700:21230/04:03099629 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Variable Reordering for a Parallel Envelope Method

Popis výsledku v původním jazyce

We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element (FE) method. A FE mesh is decomposed into the submeshes by a domain decomposition method. The submatrices formedfrom the submeshes consist of internal and boundary variables. The internal variables are factorized by an envelope method. Prior to the solution, the variables of each submatrix are reordered to minimize the size of its envelope. The boundary variablesare ordered last. The Sloan algorithm is used to perform the reordering, but it does not distinguish between internal and boundary variables. We introduce a modified version of the Sloan algorithm that takes the boundary variables into consideration. Experiments show that submatrices produced by the proposed algorithm have profiles smaller by approximately 15% and the time of solving FE problems with a parallel envelope is reduced by 23%.

Název v anglickém jazyce

Variable Reordering for a Parallel Envelope Method

Popis výsledku anglicky

We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element (FE) method. A FE mesh is decomposed into the submeshes by a domain decomposition method. The submatrices formedfrom the submeshes consist of internal and boundary variables. The internal variables are factorized by an envelope method. Prior to the solution, the variables of each submatrix are reordered to minimize the size of its envelope. The boundary variablesare ordered last. The Sloan algorithm is used to perform the reordering, but it does not distinguish between internal and boundary variables. We introduce a modified version of the Sloan algorithm that takes the boundary variables into consideration. Experiments show that submatrices produced by the proposed algorithm have profiles smaller by approximately 15% and the time of solving FE problems with a parallel envelope is reduced by 23%.

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/IBS3086102" target="_blank" >IBS3086102: Paralelní algoritmy pro rozsáhlé simulace na svazcích (klastrech) PC</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2004

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 2004 International Conference on Parallel Processing Workshops

ISBN

0-7695-2198-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

254-261

Název nakladatele

IEEE Computer Society Press

Místo vydání

Los Alamitos

Místo konání akce

Montreal, Quebec

Datum konání akce

15. 8. 2004

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—