.png){kind=icon}
.png){kind=icon}
Return
Efficient multi-level hp-finite elements in arbitrary dimensions
.png){kind=icon}
OA
AI
DOI：10.1016/j.cma.2022.115575.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an efficient algorithmic framework for constructing multi-level hp-bases that uses a data-oriented approach that easily extends to any number of dimensions and provides a natural framework for performance-optimized implementations. We only operate on the bounding faces of finite elements without considering their lower-dimensional topological features and demonstrate the potential of the presented methods using a newly written open-source library. First, we analyze a Fichera corner and show that the framework does not increase runtime and memory consumption when compared against the classical p-version of the finite element method. Then, we compute a transient example with dynamic refinement and derefinement, where we also obtain the expected convergence rates and excellent performance in computing time and memory usage. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Keywords:
High-order finite elements
hp-refinement
Arbitrary hanging nodes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W