2018
DOI: 10.1016/j.enganabound.2018.08.015
|View full text |Cite
|
Sign up to set email alerts
|

Parallel and vectorized implementation of analytic evaluation of boundary integral operators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…Indeed, in addition to the evaluation of the distance between spatial coordinates x − y , which is the most time consuming part of the BEM assembly for the Laplace equation, one has to evaluate the exponential and error functions in many quadrature points for all blocks of the Toeplitz matrix. The implementation strategy in shared memory thus follows the ideas presented by the authors previously for 3d space and 2d space-time BEM in [20,21,22]. To make use of modern multicore processors with vector arithmetic units we make use of features of modern OpenMP [23], namely threading and SIMD vectorisation.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Indeed, in addition to the evaluation of the distance between spatial coordinates x − y , which is the most time consuming part of the BEM assembly for the Laplace equation, one has to evaluate the exponential and error functions in many quadrature points for all blocks of the Toeplitz matrix. The implementation strategy in shared memory thus follows the ideas presented by the authors previously for 3d space and 2d space-time BEM in [20,21,22]. To make use of modern multicore processors with vector arithmetic units we make use of features of modern OpenMP [23], namely threading and SIMD vectorisation.…”
Section: Methodsmentioning
confidence: 99%
“…To exploit the full potential of floating point units we vectorise the code at the level of local contributions to the global matrix. For simplicity we opt for the OpenMP implementation of vector processing similarly as in [20,21,22].…”
Section: Local Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…The most popular methods are the message passing interface (MPI) and open multi-processing (OpenMP) (e.g. applied in [21,22]). Another very common method is the application of graphics processing unit (GPU) for numerical calculations (by CUDA or OpenCL) [23,24].…”
Section: Introductionmentioning
confidence: 99%
“…3 we propose a strategy to parallelize the assembly of the MTF matrix blocks and their application in an iterative solver based on the approach presented in [11][12][13] for single domain problems. Except for the distributed parallelism, the method takes full advantage of the BEM4I library [14,20,21] and its assemblers parallelized in shared memory and vectorized by OpenMP. We provide the results of numerical experiments in Sect.…”
Section: Introductionmentioning
confidence: 99%