Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “meshing framework”

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 379 records · Page 21

Transitioning from File-Based HPC Workflows to Streaming Data Pipelines with openPMD and ADIOS2

This paper aims to create a transition path from file-based IO to streaming-based workflows for scientific applications in an HPC environment. By using the openPMP-api, traditional workflows limited by filesystem bottlenecks can be overcome and flexibly extended for in situ analysis. The openPMD-api is a library for the description of scientific data according to the Open Standard for Particle-Mesh Data (openPMD). Its approach towards recent challenges posed by hardware heterogeneity lies in the decoupling of data description in domain sciences, such as plasma physics simulations, from concrete implementations in hardware and IO. The streaming backend is provided by the ADIOS2 framework, developed at Oak Ridge National Laboratory. This paper surveys two openPMD-based loosely-coupled setups to demonstrate flexible applicability and to evaluate performance. In loose coupling, as opposed to tight coupling, two (or more) applications are executed separately, e.g. in individual MPI contexts, yet cooperate by exchanging data. This way, a streaming-based workflow allows for standalone codes instead of tightly-coupled plugins, using a unified streaming-aware API and leveraging high-speed communication infrastructure available in modern compute clusters for massive data exchange. We determine new challenges in resource allocation and in the need of strategies for a flexible data distribution, demonstrating their influence on efficiency and scaling on the Summit compute system. The presented setups show the potential for a more flexible use of compute resources brought by streaming IO as well as the ability to increase throughput by avoiding filesystem bottlenecks.

Poeschel, Franz↗

Compression-based integral curve data reuse framework for flow visualization

Currently, by default, integral curves are repeatedly re-computed in different flow visualization applications, such as FTLE field computation, source-destination queries, etc., leading to unnecessary resource cost. We present a compression-based data reuse framework for integral curves, to greatly reduce their retrieval cost, especially in a resource-limited environment. In our design, a hierarchical and hybrid compression scheme is proposed to balance three objectives, including high compression ratio, controllable error, and low decompression cost. Specifically, we use and combine digitized curve sparse representation, floating-point data compression, and octree space partitioning to adaptively achieve the objectives. Results have shown that our data reuse framework could acquire tens of times acceleration in the resource-limited environment compared to on-the-fly particle tracing, and keep controllable information loss. Moreover, our method could provide fast integral curve retrieval for more complex data, such as unstructured mesh data.

97 MATHEMATICS AND COMPUTING↗

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

Theory and motivation behind the Godunov-like staggered grid hydrodynamic approach in FLAG [Slides]

The SGH Godunov-like approach extends some of the benefits of the CCH approach to the SGH framework. It eliminated some sources of errors in the numerical approximations and satisfies a broader set of ancillary equations. The SGH Godunov-like approach obviates the need for explicit viscosity treatments (i.e. mqbarton) and, in general, obviates the need for additional mesh stability models (i.e. TTS, TQS, hourglass, etc.)

97 MATHEMATICS AND COMPUTING↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

Multiphysics Coupling of PROTEUS-NODAL and SAM for Molten Salt Reactor Simulation

The purpose of this report is to document the new features and capabilities that have been implemented in the PROTEUS-NODAL code and the coupling procedure of PROTEUS-NODAL with SAM to analyze MSRs. This report is organized as follows. Section 2 presents the variational nodal P 1 solver for cylindrical geometries and its verification test results. Section 3 discusses the transient analysis capability implemented in the P 1 solvers of PROTEUS-NODAL. The solution methods for the coupled system of TFSP and precursor drift equations, the coarse mesh finite difference (CMFD) acceleration, the kinetics parameter evaluation method, and the thermal feedback are discussed. The verification test results against the SP 3 solutions are also discussed. Section 4 describes the coupling scheme of PROTEUS-NODAL and SAM under the MOOSE framework for MSR applications. The developed MOOSE applications named “TreeFrog” and “TreeKangaroo” are discussed. Verification test results for the coupled system are also discussed by comparing the MSFR steady state solution with that obtained from a manually coupled PROTEUS-NODAL and ANSYS CFX computational fluid dynamics (CFD) calculations and the MSFR transient analysis results with the open literature solutions and the PROTEUS-NODAL solutions obtained with the standalone thermal-hydraulics solver. Section 5 provides conclusions and future works.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

High-Fidelity Simulations of Plasma-Assisted Oxidation of Hydrocarbon Fuels Using Nanosecond Pulsed Discharges

Next, a robust and efficient framework for simulating NSPD in multiple dimensions is developed. The reactive Navier-Stokes equations are extended to include a drift-diffusion plasma-fluid model with a local field approximation (LFA) in a finite-volume solver, which uses an adaptive mesh refinement (AMR) strategy to address the wide separation of length scales in the problem. A two-way coupling strategy is used whereby the plasma-fluid model and reactive Navier-Stokes equations are integrated simultaneously. The oxidation of ethylene/air mixtures mediated by NSPD is simulated in a pin-to-pin configuration. All phases of the plasma discharge are simulated explicitly (including streamer ignition, propagation, and connection, as well as the subsequent spark phase), along with the evolution of the plasma during the inter-pulse period. Temporally and spatially-resolved results are presented, with an emphasis on the analysis of heating and energy deposition, as well as of the evolution of the concentration of active particles generated during the NSPD and their influence on ignition.

adaptive mesh refinement↗

dfnWorks: A discrete fracture network framework for modeling subsurface flow and transport

DFNWORKS is a parallelized computational suite to generate three-dimensional discrete fracture networks (DFN) and simulate flow and transport. Developed at Los Alamos National Laboratory over the past five years, it has been used to study flow and transport in fractured media at scales ranging from millimeters to kilometers. The networks are created and meshed using DFNGEN, which combines FRAM (the feature rejection algorithm for meshing) methodology to stochastically generate three-dimensional DFNs with the LaGriT meshing toolbox to create a high-quality computational mesh representation. The representation produces a conforming Delaunay triangulation suitable for high performance computing finite volume solvers in an intrinsically parallel fashion. Flow through the network is simulated in dfnFlow, which utilizes the massively parallel subsurface flow and reactive transport finite volume code PFLOTRAN. A Lagrangian approach to simulating transport through the DFN is adopted within DFNTRANS to determine pathlines and solute transport through the DFN. Example applications of this suite in the areas of nuclear waste repository science, hydraulic fracturing and CO 2 sequestration are also included.

42 ENGINEERING↗

Simulation of discrete cracks driven by nearly incompressible fluid via 2D combined finite-discrete element method

Here, we propose a novel hydraulic solver in order to simulate key mechanisms that control fluid-driven cracks in the framework of the combined finite-discrete element method (FDEM). The main innovative aspect of the present work is the independence of the fluid's critical time step size with the fracture opening. This advantage is extremely important because it means that very fine meshes can be used around areas of interest, such as boreholes, without penalizing the computational cost as fractures propagate (ie, open) and the fluid flows through them. This is a great advantage over other recently introduced approaches that exhibit a dependency of the time step in the form of Δt crit ∝ (l/a) 2 where l is the element size and a is the fracture aperture. This paper presents a series of benchmark cases for the proposed solver. The rationale adopted by the authors was to benchmark and validate the implementation of the hydraulic solver in an incremental fashion, starting from the simplest cases and building in complexity. The calculations shown in this work clearly demonstrate that the proposed approach is able to reproduce analytical results for fluid flow through a single crack. The results presented in this paper also demonstrate that the new approach is robust enough to deal with complex fracture patterns and complex geometries; the obtained fluid-driven fracture patterns in the vicinity of a borehole certainly stand to the scrutiny of human visual perception.

58 GEOSCIENCES↗

Physics–Informed Neural Networks of the Saint–Venant Equations for Downscaling a Large–Scale River Model

Large-scale river models are being refined over coastal regions to improve the scientific understanding of coastal processes, hazards and responses to climate change. However, coarse mesh resolutions and approximations in physical representations of tidal rivers limit the performance of such models at resolving the complex flow dynamics near the river-ocean interface, resulting in inaccurate simulations of flood inundation. In this research, we propose a machine learning (ML) framework based on the state-of-the-art physics-informed neural network (PINN) to simulate the downscaled flow at the subgrid scale. First, we demonstrate that PINN is able to assimilate observations of various types and solve the one-dimensional (1-D) Saint-Venant equations (SVE) directly. We perform the flow simulations over a floodplain and along an open channel in several synthetic case studies. The PINN performance is evaluated against analytical solutions and numerical models. Our results indicate that the PINN solutions of water depth have satisfactory accuracy with limited observations assimilated. In the case of flood wave propagation induced by storm surge and tide, a new neural network architecture is proposed based on Fourier feature embeddings that seamlessly encodes the periodic tidal boundary condition in the PINN's formulation. Furthermore, we show that the PINN-based downscaling can produce more reasonable subgrid solutions of the along-channel water depth by assimilating observational data. The PINN solution outperforms the simple linear interpolation in resolving the topography and dynamic flow regimes at the subgrid scale. This study provides a promising path towards improving emulation capabilities in large-scale models to characterize fine-scale coastal processes.

54 ENVIRONMENTAL SCIENCES↗

EVOLUTION OF COLD STREAMS AND THE EMERGENCE OF THE HUBBLE SEQUENCE

A new physical framework for the emergence of the Hubble sequence is outlined, based on novel analyses performed to quantify the evolution of cold streams of a large sample of galaxies from a state-of-the-art ultra-high resolution, large-scale adaptive mesh-refinement hydrodynamic simulation in a fully cosmological setting. It is found that the following three key physical variables of galactic cold inflows crossing the virial sphere substantially decrease with decreasing redshift: the number of streams N {sub 90} that make up 90% of concurrent inflow mass flux, average inflow rate per stream M-dot {sub 90} and mean (mass flux weighted) gas density in the streams n {sub gas}. Another key variable, the stream dimensionless angular momentum parameter λ, is found to instead increase with decreasing redshift. Assimilating these trends and others naturally leads to a physically coherent scenario for the emergence of the Hubble sequence, including the following expectations: (1) the predominance of a mixture of disproportionately small irregular and complex disk galaxies at z ≥ 2 when most galaxies have multiple concurrent streams, (2) the beginning of the appearance of flocculent spirals at z ∼ 1-2 when the number of concurrent streams are about 2-3, (3) the grand-design spiral galaxies appear at z ≤ 1 when galaxies with only one major cold stream significantly emerge. These expected general trends are in good accord with observations. Early-type galaxies are those that have entered a perennial state of zero cold gas stream, with their abundance increasing with decreasing redshift.

79 ASTRONOMY AND ASTROPHYSICS↗

Analysis of the uncertainties in the physical calculations of water-moderated power reactors of the VVER type by the parameters of models of preparing few-group constants

The article covers the uncertainty analysis of the physical calculations of the VVER reactor core for different meshes of the reference values of the feedback parameters (FBP). Various numbers of nodes of the parametric axes of FBPs and different ranges between them are investigated. The uncertainties of the dynamic calculations are analyzed using RTS RCCA ejection as an example within the framework of the model with the boundary conditions at the core inlet and outlet.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗

A Finite Element Method for Compressible and Turbulent Multiphase Flow Instabilities with Heat Transfer

We present a new finite element framework for modeling compressible, turbulent multiphase flows with heat transfer. For two-fluid systems with a free surface, the Volume of Fluid (VOF) method is implemented without the need for interface reconstruction, while turbulence is resolved using a dynamic Vreman large eddy simulation (LES) model. Unlike most two-phase VOF studies, which neglect heat transfer, the present approach incorporates energy transport equations within the VOF formulation to account for heat exchange, an effect particularly important in turbulent flows. Conjugate heat transfer is often challenging in finite volume methods, which require explicit specification of heat fluxes at the solid–fluid interface, limiting accuracy and predictive capability. By contrast, the finite element formulation does not require heat flux inputs, allowing more accurate and robust simulation of heat transfer between solids and fluids. The method is demonstrated through three representative cases. First, a two-fluid instability with a single-mode perturbation is simulated and validated against analytical growth rates. Second, conjugate heat transfer is examined in a high-temperature flow over a cold metal cylinder, with validation performed both quantitatively—via pressure coefficient comparisons with experimental data—and qualitatively using vector field topology. Finally, compressible spray injection and breakup are modeled, demonstrating the ability of the framework to capture interfacial dynamics and atomization under turbulent, high-speed conditions. In the compressible spray injection and breakup case, the results indicate that the finite element formulation achieved higher predictive accuracy and robustness than the finite-volume method. With the same mesh resolution, the FEM reduced the root mean square error (RMSE) and mean absolute percentage error (MAPE) from 6.96 mm and 26.0% (for the FVM) to 4.85 mm and 12.7%, respectively, demonstrating improved accuracy and robustness in capturing interfacial dynamics and heat transfer. The study also introduced vector field topology to visualize and interpret coherent flow structures and instabilities, offering insights beyond conventional scalar-field analyses.

97 MATHEMATICS AND COMPUTING↗

The coupling of the neutron transport application RATTLESNAKE to the nuclear fuels performance application BISON under the MOOSE framework

The MOOSE neutron transport application RATTLESNAKE was coupled to the fuels performance application BISON to provide a higher fidelity tool for fuel performance simulation. This project is motivated by the desire to couple a high fidelity core analysis program (based on the self-adjoint angular flux equations) to a high fidelity fuel performance program, both of which can simulate on unstructured meshes. RATTLESNAKE solves self-adjoint angular flux transport equation and provides a sub-pin level resolution of the multigroup neutron flux with resonance treatment during burnup or a fast transient. BISON solves the coupled thermomechanical equations for the fuel on a sub-millimeter scale. Both applications are able to solve their respective systems on aligned and unaligned unstructured finite element meshes. The power density and local burnup was transferred from RATTLESNAKE to BISON with the MOOSE Multiapp transfer system. Multiple depletion cases were run with one-way data transfer from RATTLESNAKE to BISON. The eigenvalues are shown to agree well with values obtained from the lattice physics code DRAGON. The one-way data transfer of power density is shown to agree with the power density obtained from an internal Lassman-style model in BISON.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Latent space dynamics identification for interface tracking with application to shock-induced pore collapse

Capturing sharp, evolving interfaces remains a central challenge in reduced-order modeling, especially when data is limited and the system exhibits localized nonlinearities or discontinuities. Here, we propose LaSDI-IT (Latent Space Dynamics Identification for Interface Tracking), a data-driven framework that combines low-dimensional latent dynamics learning with explicit interface-aware encoding to enable accurate and efficient modeling of physical systems involving moving material boundaries. At the core of LaSDI-IT is a revised autoencoder architecture that jointly reconstructs the physical field and an indicator function representing material regions or phases, allowing the model to track complex interface evolution without requiring detailed physical models or mesh adaptation. The latent dynamics are learned through linear regression in the encoded space and generalized across parameter regimes using Gaussian process interpolation with greedy sampling. We demonstrate LaSDI-IT on the problem of shock-induced pore collapse in high explosives, a process characterized by sharp temperature gradients and dynamically deforming pore geometries. The method achieves relative prediction errors below 9% across the parameter space, accurately recovers key quantities of interest such as pore area and hot spot formation, and matches the performance of dense training with only half the data. This latent dynamics prediction was 10 6 times faster than the conventional high-fidelity simulation, proving its utility for multi-query applications. These results highlight LaSDI-IT as a general, data-efficient framework for modeling discontinuity-rich systems in computational physics, with potential applications in multiphase flows, fracture mechanics, and phase change problems.

Gaussian process↗

Discontinuous Galerkin gradient discretisations for the approximation of second-order differential operators in divergence form

We include in the gradient discretisation method (GDM) framework two numerical schemes based on discontinuous Galerkin approximations: the symmetric interior penalty Galerkin (SIPG) method, and the scheme obtained by averaging the jumps in the SIPG method. We prove that these schemes meet the main mathematical gradient discretisation properties on any kind of polytopal mesh, by adapting discrete functional analysis properties to our precise geometrical hypotheses. Therefore, these schemes inherit the general convergence properties of the GDM, which hold for instance in the cases of the p-Laplace problem and of the anisotropic and heterogeneous diffusion problem. This is illustrated by simple 1D and 2D numerical examples.

97 MATHEMATICS AND COMPUTING↗