skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Impact of Mesh Decomposition on Performance of Teton

Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Presented at: Impact of Mesh Decomposition on Performance of Teton, Livermore, CA, United States, Oct 17 - Oct 21, 2016
Country of Publication:
United States

Citation Formats

Pearce, O. Impact of Mesh Decomposition on Performance of Teton. United States: N. p., 2017. Web.
Pearce, O. Impact of Mesh Decomposition on Performance of Teton. United States.
Pearce, O. Tue . "Impact of Mesh Decomposition on Performance of Teton". United States. doi:.
title = {Impact of Mesh Decomposition on Performance of Teton},
author = {Pearce, O},
abstractNote = {},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jan 17 00:00:00 EST 2017},
month = {Tue Jan 17 00:00:00 EST 2017}

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • The performance of the versatile McNally Wedag horizontal vibratory centrifuge for dewatering ultra fine 0.5 x 0.15 mm (28 x 100 mesh) material has proven to be successful and the results presented herein will examine its capabilities in terms of capacity, solids capture, product moisture, effluent solids, and size analysis. Centrifugal dewatering of fine refuse has proven to be another application for which this unit has performed exceptionally well.
  • Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning the entire geometry into meshable pieces matched with appropriate meshing algorithm the original geometry becomes meshable and may achieve better mesh quality. Each meshable portion is recognized as a meshing feature. This paper, which is a part of the feature based meshingmore » methodology, presents the work on shape recognition and volume decomposition to automatically decompose a CAD model into meshable volumes. There are four phases in this approach: (1) Feature Determination to extinct decomposition features, (2) Cutting Surfaces Generation to form the ''tailored'' cutting surfaces, (3) Body Decomposition to get the imprinted volumes; and (4) Meshing Algorithm Assignment to match volumes decomposed with appropriate meshing algorithms. The feature determination procedure is based on the CLoop feature recognition algorithm that is extended to be more general. Results are demonstrated over several parts with complicated topology and geometry.« less
  • Incomplete domain decomposition preconditioning for parallel implementation of the conjugate gradient-like methods is applied to solve the two-group, three-dimensional, coarse mesh finite differenced neutron diffusion equation on the PARAGON XP/S-10 parallel computer. The linear system resulting from implicit time differencing of the time-dependent neutron diffusion equation is solved by the preconditioned biconjugate gradient squared method without employing the fission source iteration. An efficient domain decomposition preconditioning scheme is constructed by taking advantage of strong diagonal dominance of the coarse mesh finite difference formulation. Simplifications are made in the incomplete LU factorization process to construct a preconditioner for a three dimensionalmore » subdomain and the coupling between subdomains is approximated by incorporating only the effect of the non-leakage terms of neighboring subdomains. The method is applied to quarter core and full core fixed source problems which are created from the IAEA three-dimensional benchmark problem. Results show that on a single processor the computation time for the preconditioned biconjugate gradient method is comparable to other conventional iteration methods such as Line-SOR and the cyclic Chebyshev semi-iterative method. The effectiveness of the incomplete domain decomposition preconditioning on a multi-processor is evidenced by the small increase in the number of iterations as the number of subdomains increases. Speedups up to 32.1 are achievable with 64 processing elements for a 34{times}34{times}36 full core three-dimensional problem.« less
  • The generation of all-hexahedral finite element meshes has been an area of ongoing research for the past two decades and remains an open problem. Unconstrained plastering is a new method for generating all-hexahedral finite element meshes on arbitrary volumetric geometries. Starting from an unmeshed volume boundary, unconstrained plastering generates the interior mesh topology without the constraints of a pre-defined boundary mesh. Using advancing fronts, unconstrained plastering forms partially defined hexahedral dual sheets by decomposing the geometry into simple shapes, each of which can be meshed with simple meshing primitives. By breaking from the tradition of previous advancing-front algorithms, which startmore » from pre-meshed boundary surfaces, unconstrained plastering demonstrates that for the tested geometries, high quality, boundary aligned, orientation insensitive, all-hexahedral meshes can be generated automatically without pre-meshing the boundary. Examples are given for meshes from both solid mechanics and geotechnical applications.« less