A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids

Authors:
Alan Stagg;Jackie Hallberg;Joseph Schmidt
Affiliations:
-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 3
Cited 1

Introduction to algorithms

Introduction to algorithms
Quality local refinement of tetrahedral meshes based on bisection

SIAM Journal on Scientific Computing
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core

Distributed dynamic hash tables using IBM LAPI

Proceedings of the 2002 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A grid refinement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for refinement by an appropriate error indicator. Hash table/linked list data structures are used to store nodal and element information. The grid along inter-processor boundaries is refined consistently with the update of these data structures via MPI calls. The parallel adaption scheme has been applied to the solution of an unsteady, three-dimensional, nonlinear, groundwater flow problem. Timings indicate efficiency of the grid refinement process relative to the flow solver calculations.