Problem decomposition for adaptive hp finite element methods

Abstract

Problem decomposition strategies for load balancing parallel computations on adaptive hp finite element discretizations are discussed in this work. The special difficulties that arise in partitioning these discretizations are highlighted. Three classes of algorithms—mesh traversal based on orderings, interface based decompositions and recursive bisection of orderings are discussed. A new ordering scheme for efficient recursive bisection of orderings is introduced. Details of the algorithms and examples along with discussions of their merits and demerits are presented. Recursive bisection on the new ordering introduced here outperforms several known algorithms on test cases.