Efficient representation of computational meshes

Authors:
A. Logg
Affiliations:
Center for Biomedical Computing, Simula Research Laboratory, Department of Informatics, University of Oslo, P.O. Box 134 1325 Lysaker, Norway
Venue:
International Journal of Computational Science and Engineering
Year:
2009

Citing 5
Cited 5

Efficient management of parallelism in object-oriented numerical software libraries

Modern software tools for scientific computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Computational Partial Differential Equations: Numerical Methods and Diffpack Programming

Computational Partial Differential Equations: Numerical Methods and Diffpack Programming
GrAL: the grid algorithms library

Future Generation Computer Systems
DOLFIN: Automated finite element computing

ACM Transactions on Mathematical Software (TOMS)

Unified framework for finite element assembly

International Journal of Computational Science and Engineering
DOLFIN: Automated finite element computing

ACM Transactions on Mathematical Software (TOMS)
Increased efficiency in finite element computations through template metaprogramming

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Algorithms and data structures for massively parallel generic adaptive finite element codes

ACM Transactions on Mathematical Software (TOMS)
Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.