Shielding Calculations with the Unstructured Mesh Model of the ORNL’s Second Target Station
Explore the source record for details and available documents.
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A finite volume cell-centered Lagrangian scheme for solving large deformation problems is constructed based on the hypo-elastic model and using the mimetic theory. Rigorous analysis in the context of gas and solid dynamics, and arbitrary polygonal meshes, is presented to demonstrate the ability of cell-centered schemes in mimicking the continuum properties and principles at the discrete level. A new mimetic formulation based gradient evaluation technique and physics-based, frame independent and symmetry preserving slope limiters are proposed. Furthermore, a physically consistent dissipation model is employed which is both robust and inexpensive to implement. The cell-centered scheme along with these additional new features are applied to solve solids undergoing elasto-plastic deformation.
Abstract Not Provided
This documents the recent advances made by LANL in the areas of computational fluid and hydrodynamics.
Large simulation data requires a lot of time and computational resources to compute, store, analyze, visualize, and run user studies. Today, the largest cost of a supercomputer is not hardware but maintenance, in particular energy consumption. Our goal is to balance energy consumption and cognitive value of visualizations of resulting data. This requires us to go through the entire processing pipeline, from simulation to user studies. To reduce the amount of resources, data can be sampled or compressed. While this adds more computation time, the computational overhead is negligible compared to the simulation time. We built a processing pipeline at the example of regular sampling. The reasons for this choice are two-fold: using a simple example reduces unnecessary complexity as we know what to expect from the results. Furthermore, it provides a good baseline for future, more elaborate sampling methods. We measured time and energy for each test we did, and we conducted user studies in Amazon Mechanical Turk (AMT) for a range of different results we produced through sampling.
Abstract not provided.
Los Alamos National Laboratory’s (LANL) Monte Carlo N-Particle R (MCNP R ) transport code has a more general geometry capability than has been available in most combinatorial geometry codes [1]. In addition to the capability of combining several predefined geometric bodies, as in a combinatorial scheme, MCNP6 [2] gives the user the added flexibility of defining geometric regions from all the first and second degree surfaces of analytical geometry and elliptical tori and then combining them with Boolean operators. This decades-old constructive solid geometry (CSG) capability has been well-tested and verified. However, it has long been recognized that as the model complexity increases, this process of describing the geometry is difficult, tedious, time-consuming, and error prone[3, 4, 5]. Consequently, innovators have taken on the task of developing a better way to construct geometries, not only in MCNP6, but other particle transport codes as well
One important requirement for coupling multi-physics models is a means to remap fields between meshes in an accurate and conservative manner. Since the remapping algorithm is embarrassingly parallel, this motivates the use of Graphical Processing Units (GPU) for such routine. However, since our remapping code, portage, is fairly complex, we explore the use of GPUs through a simpler problem of generating material’s volume fraction and centroid inside each cell of the mesh. We use the same programming structure that is used in portage, namely, on-node parallelism via NVIDIA’s thrust library. Using a similar programming structure enables us to draw lessons from this study that can be applied to the more complex problem. We have found that while the speed-up is pronounced (10-100 times), significant effort is required to re-factor the code so that thrust can be used with a CUDA backend. Moreover, thrust takes away the fine grain control that vanilla CUDA programming gives us.
Abstract not provided.
Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and math have progressively built up a hierarchy of fluid models. This report is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10^6 times larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales.This disparity motivates the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features (non-linear, anisotropy, adaptivity, andimplicit) dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this report, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.
The work performed at Dihedral LLC supported the collaboration via two research topics: (1) Hodge-Optimized Triangulations and (2) Target-Matrix Opti-mization Paradigm. Because the project was focused on primal-dual meshes, attention in TMOP was partially confined to linear element triangle meshes in the plane and their duals. However, a lot of our results extend to other element types.
Abstract not provided.
Abstract not provided.
Abstract not provided.
The space-angle multiple/semi-coarsening multigrid methods of [3] for S n discretizations of the Boltzmann transport equation was developed assuming rediscretizations of the streaming collision operators on the coarser spatial grids. These rediscretized operators are directly used in the kernels of the spatial coarse-level scalar flux integral equations, which undergo the multigrid process. Since the computation is essentially performed on these integral equations, it appears that the multigrid procedure is applied directly to the finest level scalar flux integral equation, rather than to the finest level S n system. However, this procedure is actually applied implicitly to the finest level S n system, though it would be beneficial to directly relate the multiple/semi-coarsening methods to the full S n system: being able to relate the multigrid procedure directly to the full S n system will lead to a general framework that can help guide the development of multigrid algorithms for more general S n discretization settings, such as when spatial rediscretization of the integral equation kernel can not be applied. In this latter case, applying an operator-dependent Galerkin coarsening procedure to the integral operator is difficult, if not realizable, because the kernel is dense and often given by its action of numerically sweeping over all the streaming-collision operators. In this paper, we develop and analyze such a multigrid framework for the S n system. We further relate this framework to a multigrid scheme that directly coarsens the scalar flux integral equation using a Galerkin coarsening approach. For this approach, we show that an intricate operator-dependent Galerkin coarsening procedure may not be needed. In particular, this paper develops a Galerkin-principle framework for S n discretizations of the Boltzmann equation, of which the analysis shows that simple interpolation operators can be used to coarsen the integral equations operators arising from the space-angle multiple/semi-coarsening methods.
The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines, capturing the thin boundary layers, and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources.