Graph Grammar Based Petri Net Controlled Direct Solver Algorithm
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 a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH University of Science and Technology Press
2010-01-01
|
| Series: | Computer Science |
| Subjects: | |
| Online Access: | http://journals.agh.edu.pl/csci/article/download/122/71 |
| Summary: | 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. |
|---|---|
| ISSN: | 1508-2806 |