Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured Mesh”

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.

At least 91 records · Page 5

A high order characteristic discontinuous Galerkin scheme for advection on unstructured meshes

A new characteristic discontinuous Galerkin (CDG) advection scheme is presented. In contrast to standard discontinuous Galerkin schemes, the test functions themselves follow characteristics in order to ensure conservation and the edges of each element are also traced backwards along characteristics in order to create a swept region , which is integrated in order to determine the mass flux across the edge. Both the accuracy and performance of the scheme are greatly improved by the use of large Courant–Friedrichs–Lewy numbers for a shear flow test case and the scheme is shown to scale sublinearly with the number of tracers being advected, outperforming a standard flux corrected transport scheme for 10 or more tracers with a linear basis. Moreover the CDG scheme may be run to arbitrarily high order spatial accuracy and on unstructured grids, and is shown to give the correct order of error convergence for piecewise linear and quadratic bases on regular quadrilateral and hexahedral planar grids. Using a modal Taylor series basis, the scheme may be made monotone while preserving conservation with the use of a standard slope limiter, although this reduces the formal accuracy of the scheme to first order. The second order scheme is roughly as accurate as the incremental remap scheme with nonlocal gradient reconstruction at half the horizontal resolution. Furthermore, the scheme is being developed for implementation within the Model for Prediction Across Scales (MPAS) Ocean model, an unstructured grid finite volume ocean model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Framework and algorithms for illustrative visualizations of time-varying flows on unstructured meshes

Photo- and physically realistic techniques are often insufficient for visualization of fluid flow simulations, especially for 3D and time-varying studies. Substantial research effort has been dedicated to the development of non-photorealistic and illustration-inspired visualization techniques for compact and intuitive presentation of such complex datasets. However, a great deal of work has been reproduced in this field, as many research groups have developed specialized visualization software. Additionally, interoperability between illustrative visualization software is limited due to diverse processing and rendering architectures employed in different studies. In this investigation, a framework for illustrative visualization is proposed, and implemented in MarmotViz, a ParaView plug-in, enabling its use on a variety of computing platforms with various data file formats and mesh geometries. Region-of-interest identification and feature-tracking algorithms incorporated into this tool are described. Implementations of multiple illustrative effect algorithms are also presented to demonstrate the use and flexibility of this framework. Here, by providing an integrated framework for illustrative visualization of CFD data, MarmotViz can serve as a valuable asset for the interpretation of simulations of ever-growing scale.

42 ENGINEERING↗

Scalable algorithms for domain decomposition of Monte Carlo neutral particle transport simulations on unstructured mesh

Monte Carlo simulations are the gold standard in particle transport simulations, for shielding and nuclear reactor simulations Full core simulations can require terabytes of memory for tracking pin-resolved (up to 50k pins), nuclide (200 tracked), axial (20-200 zones) reaction rates Domain decomposition, splitting the calculation and the memory storage, among several nodes is challenging as it involves communication of particles across domain boundaries We created a new MOOSE application, MaCaw, to study this problem Algorithms developed for ray tracing in MOOSE were adapted for simulating neutral particle transport Physics and tally routines in OpenMC, dynamically linked, are called from the application

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Thermomechanics coupling to Monte Carlo particle transport on unstructured mesh geometries using Cardinal

Geometry deformation due to thermal expansion influences neutron transport in many systems. Studying this phenomenon involves coupling models for neutronics, thermal hydraulics, and solid mechanics. To enable high fidelity modeling of these coupled physics, new capabilities were introduced in Cardinal, coupling OpenMC Monte Carlo particle transport models with MOOSE thermomechanical physics on unstructured moving-mesh geometries. In this work, we present a fully open-source capability leveraging on-the-fly mesh skinning to automatically regenerate OpenMC geometry, which allows multiphysics feedback from temperature, density, and geometry changes. The new capability is verified using an analytic benchmark slab problem, which couples S 2 neutron transport with thermal conduction, convective boundary conditions, Doppler-broadened cross sections, and nonlinear thermal expansion effects along the heated slab. Cardinal reproduces the analytic solutions for the neutron flux, heating, k eff , and temperature with demonstrated convergence in various error terms including mesh resolution and cross section temperature library spacing. For the nominal benchmark conditions and with a fine mesh, maximum relative errors for neutron flux, temperature, and heating are lower than 1%, while errors in integral quantities such as k eff and slab length are within 1 pcm and 48 µm, respectively. This work (i) presents a new numerical approach to thermomechanics coupling with OpenMC models, (ii) is the first (to our knowledge) to utilize a mechanical partial differential equation (PDE) solution to solve the (Griesheimer and Kooreman, 2022) analytic benchmark, and (iii) develops this verified capability within an open-source package.

97 - MATHEMATICS AND COMPUTING↗

Compressing unstructured mesh data from simulations using machine learning

The amount of data output from a computer simulation has grown to terabytes and petabytes as increasingly complex simulations are being run on massively parallel systems. As we approach exaflop computing in the next decade, it is expected that the I/O subsystem will not be able to write out these large volumes of data. In this paper, we explore the use of machine learning to compress the data before it is written out. Despite the computational constraints that limit us to using very simple learning algorithms, our results show that machine learning is a viable option for compressing unstructured data. Furthermore, we demonstrate that by simply using a better sampling algorithm to generate the training set, we can obtain more accurate results compared to random sampling, but at no extra cost. Further, by carefully selecting and incorporating points with high prediction error, we can improve reconstruction accuracy without sacrificing the compression rate.

97 MATHEMATICS AND COMPUTING↗

In‐memory integration of existing software components for parallel adaptive unstructured mesh workflows

Summary Reliable mesh‐based simulations are needed to solve complex engineering problems. Mesh adaptivity can increase reliability by reducing discretization errors but requires multiple software components to exchange information. Often, components exchange information by reading and writing a common file format. This file‐based approach becomes a problem on massively parallel computers where filesystem bandwidth is a critical performance bottleneck. Our approach using data streams and component interfaces avoids the filesystem bottleneck. In this paper, we present these techniques and their use for coupling mesh adaptivity to the PHASTA computational fluid dynamics solver, the Albany multi‐physics framework, and the Omega3P linear accelerator frequency analysis applications. Performance results are reported on up to 16,384 cores of an Intel Knights Landing‐based system.

Smith, Cameron W.↗

A second-order accurate finite volume scheme with the discrete maximum principle for solving Richards’ equation on unstructured meshes

Richards’s equation describes steady-state or transient flow in a variably saturated medium. For a medium having multiple layers of soils that are not aligned with coordinate axes, a mesh fitted to these layers is no longer orthogonal and the classical two-point flux approximation finite volume scheme is no longer accurate. Here, we propose new second-order accurate nonlinear finite volume (NFV) schemes for the head and pressure formulations of Richards’ equation. We prove that the discrete maximum principles hold for both formulations at steady-state which mimics similar properties of the continuum solution. The second-order accuracy is achieved using high-order upwind algorithms for the relative permeability. Numerical simulations of water infiltration into a dry soil show significant advantage of the second-order NFV schemes over the first-order NFV schemes even on coarse meshes. Since explicit calculation of the Jacobian matrix becomes prohibitively expensive for high-order schemes due to build-in reconstruction and slope limiting algorithms, we study numerically the preconditioning strategy introduced recently in Lipnikov et al. (2016) that uses a stable approximation of the continuum Jacobian. Lastly, numerical simulations show that the new preconditioner reduces computational cost up to 2–3 times in comparison with the conventional preconditioners.

97 MATHEMATICS AND COMPUTING↗

Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes

This article presents a method for goal-based anisotropic adaptive methods for the finite element method applied to the Boltzmann transport equation. The neutron multiplication factor, k{sub eff}, is used as the goal of the adaptive procedure. The anisotropic adaptive algorithm requires error measures for k{sub eff} with directional dependence. General error estimators are derived for any given functional of the flux and applied to k{sub eff} to acquire the driving force for the adaptive procedure. The error estimators require the solution of an appropriately formed dual equation. Forward and dual error indicators are calculated by weighting the Hessian of each solution with the dual and forward residual respectively. The Hessian is used as an approximation of the interpolation error in the solution which gives rise to the directional dependence. The two indicators are combined to form a single error metric that is used to adapt the finite element mesh. The residual is approximated using a novel technique arising from the sub-grid scale finite element discretisation. Two adaptive routes are demonstrated: (i) a single mesh is used to solve all energy groups, and (ii) a different mesh is used to solve each energy group. The second method aims to capture the benefit from representing the flux from each energy group on a specifically optimised mesh. The k{sub eff} goal-based adaptive method was applied to three examples which illustrate the superior accuracy in criticality problems that can be obtained.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Agglomeration-based geometric multigrid solvers for compact discontinuous Galerkin discretizations on unstructured meshes

Here, we present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗