Parallel Adaptive Mesh Refinement

Previous chapter Next chapter Software, Environments, and Tools Parallel Processing for Scientific Computing8. Parallel Adaptive Mesh RefinementLori Freitag Diachin, Richard Hornung, Paul Plassmann, and Andy WissinkLori Freitag Diachin, Richard Hornung, Paul Plassmann, and Andy Wissinkpp.143 - 162Chapter DOI:https://doi.org/10.1137/1.9780898718133.ch8PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutExcerpt As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically reacting flows with radiative heat transfer, high Reynolds-number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features, while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally fine grid. Figure 8.1 shows two example computations using AMR. On the left is a structured mesh calculation of an impulsively sheared contact surface [3], and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [37]. Note the ability of both meshing methods to resolve simulation details by varying the local grid spacing. Previous chapter Next chapter RelatedDetails Published:2006ISBN:978-0-89871-619-1eISBN:978-0-89871-813-3 https://doi.org/10.1137/1.9780898718133Book Series Name:Software, Environments, and ToolsBook Code:SE20Book Pages:xxiv + 383Key words:Parallel processing, scientific computing, parallel algorithms, high-performance computing, computational science and engineering