Efficient representation of computational meshes
Efficient representation of computational meshes
复制标题
计算网格的有效表示
DOI：
10.1504/ijcse.2009.029164
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
A. Logg
中科院分区：
文献类型：
--
作者：
A. Logg
我们提出了一个简单而通用和有效的方法来表示计算网格。网格表示为不同拓扑尺寸的网格实体及其关联关系的集合。我们讨论了一个简单而有效的存储方案，这样的网格表示和有效的算法计算任意的关联关系从一个给定的初始和最小的关联关系。它阐述了如何建议的概念和数据结构可用于组装的变分形式在分布式网格上并行。基准测试表明，所提出的数据结构的效率。
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.