2019
DOI: 10.1007/s11075-019-00781-z
|View full text |Cite
|
Sign up to set email alerts
|

Optimizations of a fast multipole symmetric Galerkin boundary element method code

Abstract: This paper presents some optimizations of a fast multipole symmetric Galerkin boundary element method code. Except general optimizations, the code is specially sped up for crack propagation problems. Existing useful computational results are saved and re-used during the propagation. Some time-consuming phases of the code are accelerated by a shared memory parallelization. A new sparse matrix method is designed based on coordinate format and compressed sparse row format to limit the memory required during the m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…However, the most important is huge reducing the RAM utilization. There are efficient implementations of the FMM for solving potential problems [31,32], also by the BEM [33,34]. Therefore, the authors of this paper have modified the PIES to include the FMM, and the fast PIES was obtained [35].…”
Section: Introductionmentioning
confidence: 99%
“…However, the most important is huge reducing the RAM utilization. There are efficient implementations of the FMM for solving potential problems [31,32], also by the BEM [33,34]. Therefore, the authors of this paper have modified the PIES to include the FMM, and the fast PIES was obtained [35].…”
Section: Introductionmentioning
confidence: 99%
“…A new version of the code noted MBEMv3.0, is developed by Dansou et al in [10,11,12]. In this version, multiple strategies have been proposed and implemented for performance enhancement, including a data reusing technique, a shared memory parallelism using OpenMP directives and the proposal of a new sparse matrix method.…”
mentioning
confidence: 99%