On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel

Article type: Research Article

Authors: Paszyński, Maciej

Affiliations: Department of Computer Science, AGH University of Science and Technology, Al.Mickiewicza 30, 30-059, Kraków, Poland. e-mail: paszynsk@agh.edu.pl; http://home.agh.edu.pl/paszynsk

Note: [] Address for correspondence: Department of Computer Science, Al.Mickiewicza 30, 30-059, Kraków, Poland

Abstract: The paper present the composite programmable (CP) graph grammar model of the selfadaptive hp Finite Element Method (hp-FEM) algorithm. The model incorporates the process of the initial mesh generation, direct solver execution, as well as mesh transformations resulting from selectedoptimal hp refinements. The computational mesh is represented by the CP-graph. The operations performed over the mesh are expressed by the graph grammar productions. The graph grammar model allows for the definition of the computational tasks for the Partitioning, Communication, Agglomeration and Mapping (PCAM) method of the parallelization of the self-adaptive hp-FEM algorithm.

Keywords: Graph grammar, Automatic hp adaptivity, Finite Element Method, Parallel computing

DOI: 10.3233/FI-2009-111

Journal: Fundamenta Informaticae, vol. 93, no. 4, pp. 411-434, 2009