Efficient representation of computational meshes
Artikel i vetenskaplig tidskrift, 2009

We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a straightforward and efficient storage scheme for such mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations. It is elaborated on how the proposed concepts and data structures may be used for assembly of variational forms in parallel over distributed meshes. Benchmarks are presented to demonstrate the efficiency of the proposed data structure. Copyright © 2009, Inderscience Publishers.

Mesh representation

Mesh algorithms

Mesh

Mesh entity

Parallel assembly

Författare

Anders Logg

Chalmers, Matematiska vetenskaper, Matematik

Göteborgs universitet

International Journal of Computational Science and Engineering

1742-7185 (ISSN) 1742-7193 (eISSN)

Vol. 4 4 283-295

Ämneskategorier

Matematik

Beräkningsmatematik

DOI

10.1504/IJCSE.2009.029164