Distributed fast boundary element methods for Helmholtz problems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10242265" target="_blank" >RIV/61989100:27240/19:10242265 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/19:10242265

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0096300319304825" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0096300319304825</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.amc.2019.06.017" target="_blank" >10.1016/j.amc.2019.06.017</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Distributed fast boundary element methods for Helmholtz problems

Popis výsledku v původním jazyce

We present an approach for a distributed memory parallelization of the boundary element method. The given mesh is decomposed into submeshes and the respective matrix blocks are distributed among computational nodes (processes). The distribution which takes care of the load balancing during the system matrix assembly and matrix-vector multiplication is based on the cyclic graph decomposition. Moreover, since the individual matrix blocks are approximated using the adaptive cross approximation method, we describe its modification capable of dealing with zero blocks in the double-layer operator matrix since these are usually problematic when using the original adaptive cross approximation algorithm. Convergence and scalability of the method are demonstrated on the half- and full-space sound scattering problems modeled by the Helmholtz equation.

Název v anglickém jazyce

Distributed fast boundary element methods for Helmholtz problems

Popis výsledku anglicky

We present an approach for a distributed memory parallelization of the boundary element method. The given mesh is decomposed into submeshes and the respective matrix blocks are distributed among computational nodes (processes). The distribution which takes care of the load balancing during the system matrix assembly and matrix-vector multiplication is based on the cyclic graph decomposition. Moreover, since the individual matrix blocks are approximated using the adaptive cross approximation method, we describe its modification capable of dealing with zero blocks in the double-layer operator matrix since these are usually problematic when using the original adaptive cross approximation algorithm. Convergence and scalability of the method are demonstrated on the half- and full-space sound scattering problems modeled by the Helmholtz equation.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

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í

2019

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

APPLIED MATHEMATICS AND COMPUTATION

ISSN

0096-3003

e-ISSN

—

Svazek periodika

362

Číslo periodika v rámci svazku

1 December 2019

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

1-15

Kód UT WoS článku

000479157100008

EID výsledku v databázi Scopus

2-s2.0-85068522785