Parallelization of the multi-level hp-adaptive finite cell method. (1st July 2017)

• Record Type: Journal Article
• Authors: Jomo, John N.; Zander, Nils; Elhaddad, Mohamed; Özcan, Ali; Kollmannsberger, Stefan; Mundani, Ralf-Peter; Rank, Ernst
• Is Part Of: Computers & mathematics with applications. Volume 74:issue 1(2017)
• Page Start: 126
• Page End: 142
• Publication Date: 2017-07-01
• Subjects: High-order FEM -- Automatic hp-adaptivity -- Arbitrary hanging nodes -- Finite cell method -- Parallel computation -- High performance computing; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2017.01.004
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: The multi-level h p -refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes, a h p -scheme based on spatial refinement by superposition. An efficient parallelization of this method using standard domain decomposition approaches in combination with ghost elements faces the challenge of a large basis function support resulting from the overlay structure and is in many cases not feasible. In this contribution, a parallelization strategy for the multi-level h p -scheme is presented that is adapted to the scheme's simple hierarchical structure. By distributing the computational domain among processes on the granularity of the active leaf elements and utilizing shared mesh data structures, good parallel performance is achieved, as redundant computations on ghost elements are avoided. We show the scheme's parallel scalability for problems with a few hundred elements per process. Furthermore, the scheme is used in conjunction with the finite cell method to perform numerical simulations on domains of complex shape.