Hexahedral refinement increases the density of an all-hexahedral mesh in a specified region, improving numerical accuracy. Previous research using solely sheet refinement theory made the implementation computationally expensive and unable to effectively handle multiply-connected transition elements and self-intersecting hexahedral sheets. The Selective Approach method is a new procedure that combines two diverse methodologies to create an efficient and robust algorithm able to handle the above stated problems. These two refinement methods are: 1) element by element refinement and 2) directional refinement. In element by element refinement, the three inherent directions of a hexahedron are refined in one step using one of seven templates. Because of its computational superiority over directional refinement, but its inability to handle multiply-connected transition elements, element by element refinement is used in all areas of the specified region except regions local to multiply-connected transition elements. The directional refinement scheme refines the three inherent directions of a hexahedron separately on a hexahedron by hexahedron basis. This differs from sheet refinement which refines hexahedra using hexahedral sheets. Directional refinement is able to correctly handle multiply-connected transition elements. A ranking system and propagation scheme allow directional refinement to work within the confines of the Selective Approach Algorithm.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-1978 |
| Date | 13 July 2007 |
| Creators | Parrish, Michael Hubbard |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0016 seconds