A parallel fast boundary element method using cyclic graph decompositions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096473" target="_blank" >RIV/61989100:27240/15:86096473 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/15:86096473

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s11075-015-9974-9" target="_blank" >http://dx.doi.org/10.1007/s11075-015-9974-9</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11075-015-9974-9" target="_blank" >10.1007/s11075-015-9974-9</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A parallel fast boundary element method using cyclic graph decompositions

Popis výsledku v původním jazyce

We propose a method of a parallel distribution of densely populated matrices arising in boundary element discretizations of partial differential equations. In our method the underlying boundary element mesh consisting of n elements is decomposed into N submeshes. The related NxN submatrices are assigned to N concurrent processes to be assembled. Additionally we require each process to hold exactly one diagonal submatrix, since its assembling is typically most time consuming when applying fast boundary elements. We obtain a class of such optimal parallel distributions of the submeshes and corresponding submatrices by cyclic decompositions of undirected complete graphs. It results in a method the theoretical complexity of which is O((n/root N) log( n/root N)) in terms of time for the setup, assembling, matrix action, as well as memory consumption per process. Nevertheless, numerical experiments up to n = 2744832 and N = 273 on a real-world geometry document that the method exhibits super

Název v anglickém jazyce

A parallel fast boundary element method using cyclic graph decompositions

Popis výsledku anglicky

We propose a method of a parallel distribution of densely populated matrices arising in boundary element discretizations of partial differential equations. In our method the underlying boundary element mesh consisting of n elements is decomposed into N submeshes. The related NxN submatrices are assigned to N concurrent processes to be assembled. Additionally we require each process to hold exactly one diagonal submatrix, since its assembling is typically most time consuming when applying fast boundary elements. We obtain a class of such optimal parallel distributions of the submeshes and corresponding submatrices by cyclic decompositions of undirected complete graphs. It results in a method the theoretical complexity of which is O((n/root N) log( n/root N)) in terms of time for the setup, assembling, matrix action, as well as memory consumption per process. Nevertheless, numerical experiments up to n = 2744832 and N = 273 on a real-world geometry document that the method exhibits super

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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 periodika

Numerical algorithms

ISSN

1017-1398

e-ISSN

—

Svazek periodika

70

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

18

Strana od-do

807-824

Kód UT WoS článku

000368438600006

EID výsledku v databázi Scopus

2-s2.0-84948710731