Optimizations of a fast multipole symmetric Galerkin boundary element method code

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-consum...

Full description

Saved in:
Bibliographic Details
Published inNumerical algorithms Vol. 84; no. 3; pp. 825 - 846
Main Authors Dansou, Anicet, Mouhoubi, Saïda, Chazallon, Cyrille
Format Journal Article
LanguageEnglish
Published New York Springer US 01.07.2020
Springer Nature B.V
Springer Verlag
Subjects
Algebra
Algorithms
Boundary element method
Computer Science
Crack propagation
Decomposition
Format
Galerkin method
Integrals
Mathematical analysis
Matrix methods
Modeling and Simulation
Multipoles
Numeric Computing
Numerical Analysis
Original Paper
Propagation
Sparse matrices
Sparsity
Theory of Computation
Sparse matrix
SGBEM
Fatigue crack propagation
Parallelization
FMM
Online AccessGet full text
ISSN1017-1398
1572-9265
1572-9265
DOI10.1007/s11075-019-00781-z

Cover

More Information
Summary: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 matrix construction phase. The remarkable performance of the new code is shown through many simulations including large-scale problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
1572-9265
DOI:10.1007/s11075-019-00781-z