Graph Grammar Based Petri Net Controlled Direct Solver Algorithm
Arkadiusz Szymczak, Maciej R. Paszyński, David Pardo · DOAJ (DOAJ: Directory of Open Access Journals) · 2010
In this paper we present the Petri net setting the optimal order of elimination for directsolver working with hp refined finite finite element meshes. The computational mesh is representedby a graph, with graph vertices corresponding to finite element nodes. The directsolver algorithm is expressed as a sequence of graph grammar productions, attributing thegraph vertices. The Petri net dictates the order of graph grammar productions, representingthe execution of the solver algorithm over a graph representation of computational mesh.The presentation is concluded with numerical experiments performed for a model L-shapedomain.