A parallel fast boundary element method using cyclic graph decompositions
The result's identifiers
Result code in 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>
Alternative codes found
RIV/61989100:27740/15:86096473
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
A parallel fast boundary element method using cyclic graph decompositions
Original language description
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
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Numerical algorithms
ISSN
1017-1398
e-ISSN
—
Volume of the periodical
70
Issue of the periodical within the volume
4
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
18
Pages from-to
807-824
UT code for WoS article
000368438600006
EID of the result in the Scopus database
2-s2.0-84948710731