论文信息 - A grid coarsening algorithm for unstructured multigrid applications

A grid coarsening algorithm for unstructured multigrid applications

An algorithm for the construction of nested coarse tetrahedral meshes given an initial ne tetrahedral mesh is described. This algorithm, termed Dynamic Graph Reduction with Swapping (DGRS), is able to produce nested coarse meshes suitable for unstructured multigrid applications. The capabilities of the DGRS approach are demonstrated through several examples.

Rainald Loehner | Jacob Waltz | R. Loehner | J. Waltz | R. L. ohner

[1] A. Dervieux,et al. Looking for O(N) Navier-Stokes solutions on non-structured meshes , 1993 .

[2] K. Morgan,et al. Unstructured multigrid methods , 1987 .

[3] C. Fletcher. Computational techniques for fluid dynamics , 1992 .

[4] Jacob Isaiah Waltz. Unstructured multigrid for time-dependent incompressible fluid flow , 2000 .

[5] Dimitri J. Mavriplis,et al. AGGLOMERATION MULTIGRID FOR THE THREE-DIMENSIONAL EULER EQUATIONS , 1994 .

[6] Michael B. Giles,et al. Implicit time-accurate solutions on unstructured dynamic grids , 1997 .

[7] Michael B. Giles,et al. Aircraft computations using multigrid and an unstructured parallel library , 1995 .

[8] Dimitri J. Mavriplis,et al. Directional Agglomeration Multigrid Techniques for High-Reynolds Number Viscous Flows , 1998 .

[9] J. Peraire,et al. A 3D finite element multigrid solver for the Euler equations , 1992 .

[10] William L. Briggs,et al. A multigrid tutorial , 1987 .

[11] D. Mavriplis. Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes , 1997 .