Organizing a p-Version Finite Element Computation by an Octree-Based Hierarchy

In this paper, we present a method to organize a high order finite element model in an octree-based hierarchy. Thereby the finite element problem is solved by using a nested dissection algorithm. The main focus of this work is to utilize the hierarchic organization in order to speed up the solution process in case only parts of the computational domain have changed. An example will show, how this approach can be used to accelerate local refinement processes in a p-version finite element computation.     «

In this paper, we present a method to organize a high order finite element model in an octree-based hierarchy. Thereby the finite element problem is solved by using a nested dissection algorithm. The main focus of this work is to utilize the hierarchic organization in order to speed up the solution process in case only parts of the computational domain have changed. An example will show, how this approach can be used to accelerate local refinement processes in a p-version finite element computat...     »