Search NASA⌕ Search

SEARCH · Search NASA

Results for “sweep, unstructured”

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.

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New modelling capabilities in IDT

This work concerns the enhanced modelling capabilities of the discrete ordinates transport solver IDT. The novelties introduced allow for modelling unstructured geometries composed by a collection of X/Y segments and circles, and the use of reciprocity and conservation relations reduce the memory imprint as well as the computational cost of the method. IDT decomposes geometries in modular Cartesian patterns, which are the so-called Heterogeneous Cartesian Cells (HCCs), containing a chunk of the original unstructured geometries. Each HCC can be then discretized by superimposing a XY grid to refine locally the HCC. Unlike the most popular MOC, IDT performs the spatial sweeping by directional collision probabilities instead of trajectories. The sources and interface angular fluxes are expanded up to linear order. The accuracy of ray-tracing, the memory imprints together with the novel mesh refinement capabilities have been verified. A first set of preliminary results on PWR lattice problems will be presented in this paper.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the subject of large-scale pool fires and turbulent boundary layer interactions

The role to which a realistic inflow turbulent boundary layer (TBL) influences transient and mean large-scale pool fire quantities of interest (QoIs) is numerically investigated. High-fidelity, low-Mach large-eddy simulations that activate low-dissipation, unstructured numerics are conducted using an unsteady flamelet combustion modeling approach with mutiphysics coupling to soot and participating media radiation transport. Three inlet profile configurations are exercised for a large-scale, high-aspect rectangular pool that is oriented perpendicular to the flow direction: a time-varying, TBL inflow profile obtained from a periodic precursor simulation, the time-mean of the transient TBL, and a steady power-law inflow profile that replicates the mean TBL crosswind velocity of 10.0 m/s at a vertical height of 10 m. Results include both qualitative transient flame evolution and quantitative flame shape with ground-level temperature and convective/radiative heat flux profiles. While transient fire events, which are driven by burst-sweep TBL coupling, such as blow-off and reattachment are vastly different in the TBL case (contributing to increased root mean square QoI fluctuation prediction and disparate flame lengths), mean surface QoI magnitudes are similar. Quadrant analysis demonstrates that the TBL configuration modifies burst-sweep phenomena at windward pool locations, while leeward recovery is found. In conclusion, positive fluctuations of convective heat flux correlate with fast moving fluid away from the pool surface due to intermittent combustion events.

97 MATHEMATICS AND COMPUTING↗