Premium
Structured multigrid agglomeration on a data structure for unstructured meshes
Author(s) -
Hannemann V.
Publication year - 2002
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.292
Subject(s) - multigrid method , polygon mesh , hexahedron , grid , computational science , mesh generation , computer science , unstructured grid , volume mesh , data structure , key (lock) , topology (electrical circuits) , geometry , parallel computing , mathematics , finite element method , computer graphics (images) , engineering , structural engineering , partial differential equation , mathematical analysis , combinatorics , programming language , computer security
A key issue for using multigrid as an acceleration technique on unstructured meshes is the generation of the coarse grid levels. Some new ideas are presented to improve the agglomeration of coarse cells in hybrid grids with respect to the structure of hexahedral or prismatic layers. The algorithms are embedded in the standard advancing front method which works locally on the edge based data structure representing the dual grid. The goal is to preserve the topological structure of the hexahedral and prismatic parts as far as possible. As a result of the structure preservation a desired coarsening ratio (number of fine grid volumes per coarse grid volume), responsible for the memory requirements and the computing time spent in looping over all volumes, can be achieved with a minimal number of edges, which is linked to the major working time spent in loops over all edges. Copyright © 2002 John Wiley & Sons, Ltd.