A general topology Godunov method.

*(English)*Zbl 0665.76032We describe a numerical technique for solving 2-dimensional compressible multimaterial problems using a general topology mesh. Multimaterial problems are characterized by the presence of interfaces whose shapes may become arbitrarily complex in the course of dynamic evolution. Computational methods based on more conventional fixed-connectivity quadrilateral meshes do not have adequate flexibility to follow convoluted interface shapes and frequently fail due to excessive mesh distortion. The present method is based on a mesh of arbitrary polygonal cells. Because this mesh is dual to a triangulation, its topology is unrestricted and it is able to accommodate arbitrary boundary shapes. Additionally, this mesh is able to quickly and smoothly change local mesh resolution, thus economizing on the number of mesh cells, and it is able to improve mesh isotropy because in a region of uniform mesh the cells tend to become regular hexagons. The underlying algorithms are based on those of the CAVEAT code. These consist of an explicit, finite-volume, cell-centered, arbitrary Lagrangian-Eulerian technique, coupled with the Godunov method, which together are readily adaptable to a general topology mesh.

Several special techniques have been developed for this extension to a more general mesh. They include an interface propagation scheme based on Huygens’ construction, a “near-Lagrangian” mesh rezoning algorithm that minimizes advection while enhancing mesh regularity, an efficient global remapping algorithm that is capable of conservatively transferring quantities from one general mesh to another and various mesh restructering algorithms, such as mesh reconnection, smoothing, and point addition and deletion.

Several special techniques have been developed for this extension to a more general mesh. They include an interface propagation scheme based on Huygens’ construction, a “near-Lagrangian” mesh rezoning algorithm that minimizes advection while enhancing mesh regularity, an efficient global remapping algorithm that is capable of conservatively transferring quantities from one general mesh to another and various mesh restructering algorithms, such as mesh reconnection, smoothing, and point addition and deletion.

##### MSC:

76D05 | Navier-Stokes equations for incompressible viscous fluids |

65N99 | Numerical methods for partial differential equations, boundary value problems |

76M99 | Basic methods in fluid mechanics |

##### Keywords:

compressible multimaterial problems; general topology mesh; fixed- connectivity quadrilateral meshes; triangulation; CAVEAT code; explicit, finite-volume, cell-centered, arbitrary Lagrangian-Eulerian technique; Godunov method; Huygens’ construction; global remapping algorithm
PDF
BibTeX
XML
Cite

\textit{J. K. Dukowicz} et al., J. Comput. Phys. 82, No. 1, 29--63 (1989; Zbl 0665.76032)

Full Text:
DOI

**OpenURL**

##### References:

[1] | Addessio, F.L.; Carroll, D.E.; Dukowicz, J.K.; Harlow, F.H.; Johnson, J.N.; Kashiwa, B.A.; Maltrud, M.E.; Ruppel, H.M., Los alamos national laboratory report no. LA-10613-MS, (1986), (unpublished) |

[2] | Hirt, C.W.; Amsden, A.A.; Cook, J.L., J. comput. phys., 14, 227, (1974) |

[3] | Van Leer, B., J. comput. phys., 32, 101, (1979) |

[4] | Dukowicz, J.K., J. comput. phys., 61, 119, (1985) |

[5] | Brackbill, J.U.; Saltzman, J.S., J. comput. phys., 46, 342, (1982) |

[6] | Delaunay, B., Bull. acad. sci. USSR (VII), cl. sci. mat. nat., 793, (1934) |

[7] | Voronoi, G., J. reine angew. math., 134, 198, (1908) |

[8] | Dukowicz, J.K., J. comput. phys., 54, 411, (1983) |

[9] | Ramshaw, J.D., J. comput. phys., 59, 193, (1985) |

[10] | Ramshaw, J.D., J. comput. phys., 67, 214, (1986) |

[11] | Dukowicz, J.K.; Kodis, J.W., SIAM J. sci. statist. comput., 8, 305, (1987) |

[12] | Karp, R.R., Los alamos scientific laboratory report no. LA-8371, (1980), (unpublished) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.