Parallel domain discretization algorithm for RBF-FD and other meshless numerical methods for solving PDEs. (May 2022)

• Record Type: Journal Article
• Authors: Depolli, Matjaž; Slak, Jure; Kosec, Gregor
• Is Part Of: Computers & structures. Volume 264(2022)
• Publication Date: 2022-05
• Subjects: Parallel -- Point fill -- Meshless -- Poisson disc sampling -- Performance; Structural engineering -- Data processing -- Periodicals; Electronic data processing -- Structures, Theory of -- Periodicals; 624.171
• DOI: 10.1016/j.compstruc.2022.106773
• Languages: English
• ISSNs: 0045-7949

Abstract

Highlights: Presented is a novel parallel domain discretization method for meshless methods. A very fast sequential algorithm is parallelized for shared-memory architectures. An arbitrary domain shape, number of dimensions and varying nodal density. The quality of node placements is thoroughly analysed. Excellent parallel scalability is demonstrated across a range of domain sizes. Abstract: In this paper, we present a novel parallel dimension-independent node positioning algorithm that is capable of generating nodes with variable density, suitable for meshless numerical analysis. A very efficient sequential algorithm based on Poisson disc sampling is parallelized for use on shared-memory computers, such as the modern workstations with multi-core processors. The parallel algorithm uses a global spatial indexing method with its data divided into two levels, which allows for an efficient multi-threaded implementation. The addition of bootstrapping enables the algorithm to use any number of parallel threads while remaining as general as its sequential variant. We demonstrate the algorithm performance on six complex 2- and 3-dimensional domains, which are either of non rectangular shape or have varying nodal spacing or both. We perform a run-time analysis of the algorithm, to demonstrate its ability to reach high speedups regardless of the domain and to show how well it scales on the experimental hardware with 16 processor cores. We also analyse the algorithm in terms of the effects of domain shape, quality of point placement, and various parallelization overheads.