Frank Hülsemann
Computer Science
University Erlangen
Germany
Amongst other properties, PDE solvers for large scale problems should be flexible, as they are time consuming to write, and obviously runtime efficient. This presentation reports on the experiences with a regularity centered approach for grid based PDE software that aims to combine geometric flexibility with runtime efficiency. An unstructured coarse grid that describes the problem geometry is repeatedly subdivided in a regular fashion to yield a hierarchy of grids on which the approximation is sought. By construction, the grid hierarchy is well suited for multilevel methods. The gain in runtime performance that results from the exploitation of the patchwise regularity of the refined grids over standard implementations will be illustrated.