Search NASA⌕ Search

SEARCH · Search NASA

Results for “Meshing”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Replace Human Intelligence with Fast and Smart Geometric Reasoning and Graph Neural Network to Accelerate Next Gen ModSim Workflows

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Closing the Loop between In Situ Stress Complexity and EGS Fracture Complexity

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

42 ENGINEERING↗
DOE OSTI2025

A three-dimensional laser ray-tracing methodology for radiation-hydrodynamics simulations

We report on a methodology for performing laser ray-tracing in three spatial dimensions for radiation-hydrodynamics simulation codes. Our method, which is an extension of that developed in Haines et al., Comput. Fluids 201, 104478 (2020), utilizes an automatically generated separate mesh for the laser ray-tracing from the radiation-hydrodynamics mesh. This enables the laser mesh to be tailored to minimize ray noise with significantly fewer rays than would be required when the ray-tracing is performed on the radiation-hydrodynamics mesh, primarily by allowing the use of high-aspect-ratio cells that are not suitable for hydrodynamics solvers. For a planar target, we show that our method provides a ≈ 100× reduction in computational expense to achieve a fixed level of ray noise relative to ray-tracing directly on the radiation-hydrodynamics mesh. The relatively low ray requirement also enables efficient computation of cross-beam energy transfer. Each cell in the logically cubic laser mesh is a non-convex dodecahedron with triangular sides, and numerical integration of the ray trajectories and inverse bremsstrahlung is performed by mapping each cell to the unit cube. We will describe our methodology in detail as well as its implementation in the xRAGE radiation-hydrodynamics code, discuss performance, and present the results from applying the methodology to test problems with analytic solutions for laser ray-tracing through a quadratic density gradient with an analytic solution as well as for a laser-driven heat front. In 3D radiation-hydrodynamics simulations of laser-driven experiments performed on the National Ignition Facility, laser ray-tracing with our methodology uses less than 1% of total computational time while introducing acceptably low levels of ray noise.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗
DOE OSTI2024

Rapid particle generation from an STL file and related issues in the application of material point methods to complex objects

Abstract In this paper, we focus on three issues related to applications of material point methods (MPMs) to objects with complex geometries. They are material point generation, compatibility of material points with a mesh, and sensitivity to mesh orientation. An efficient method of generating material points from a stereolithography (STL) file is introduced. This material point generation method is independent of the mesh used in MPM calculations. The compatibility between the material points and the mesh is then studied. We also show that the original MPM and the dual domain material point (DDMP) method are sensitive to mesh orientation. These issues are related to the calculation of the internal force and are concerns of the MPMs. They become more prominent when MPMs are applied to complex geometries. Our numerical results show that the recently developed local stress difference (LSD) algorithm (Perez et al. in J Comp Phys 498:112681, 2024) can be used to effectively address them.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Elasto-viscoplastic fast Fourier transform modeling framework for assessing microstructural effects on stress intensity factors characterizing fracture toughness

A large-strain elasto-viscoplastic fast Fourier transform (LS-EVPFFT) model with non-periodic (NP) velocity-based boundary conditions is adapted to simulate the sensitivity of stress intensity factors on microstructure for 304L stainless steel. The material was characterized via electron backscattered diffraction (EBSD) serial-sectioning to obtain a measured 3-D microstructural cell to perform simulations. The NP-LS-EVPFFT model, including the simulation setup and boundary conditions, was verified using a crystal plasticity finite element (CPFE) model. To this end, the generation of meshes of notched specimens was developed, which involved creating Python scripts for mesh “cutting” in Abaqus, and Sculpt scripts in Cubit for meshing of the measured microstructural cell processed with DREAM.3D. The complexity of the mesh preparation highlighted the advantages of the FFT-based model, which circumvents the mesh generation process. Given the efficiency of the FFT-based model, statistical distribution of stress intensity factors in function of crystal orientation at the crack tip, grain structure, and crystallographic texture surrounding the crack tip were predicted. Further, the distributions reveal about 10% variation of stress intensity factors with microstructure with the most significant sensitivity found to be the crystal orientation at the crack tip. The methodology developed in this work is discussed as a practical simulation tool for predicting the sensitivity of stress intensity factors on microstructural variability in metallic materials.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Divertor heat load estimates on NSTX and DIII-D using new and open-source 2D inversion analysis code

A thermography inversion algorithm has been developed in the open-source Python-based computer code, HYPERION, to calculate the heat flux incident on plasma-facing components (PFCs) in axisymmetric tokamaks. The chosen mesh size at the surface significantly affects the calculated transient heat flux results. The calculated transient heat flux will exceed the real value when the mesh size tends to zero but will underestimate the real value when the mesh size is large. A criterion for determining the appropriate mesh size for the transient heat flux calculation will be discussed. The numerical scheme for HYPERION uses a 2D fully implicit finite-difference approach, allowing temperature-dependent thermal properties of PFC materials. The inversion algorithm is benchmarked against established heat flux calculation codes, TACO and THEODOR, based on thermography data from NSTX and DIII-D respectively. The primary benefits of HYPERION compared to TACO and THEODOR are that it is open-source and it allows for the optimization of mesh thickness along the substrate. The algorithm also accounts for the thermal properties of thin surface layers that characteristically form on PFCs due to plasma-material interactions. The agreement between HYPERION and THEODOR is excellent, as the percent difference between the codes is ~5% on average in the case of the DIII-D data for moderate to high heat flux. Verification tests with TACO show slightly higher average percent differences of 8% and 12%. In using HYPERION to study filaments in heat flux, the initial results indicate that small ELMs filaments significantly broaden the divertor heat flux, and decrease divertor peak flux. Compared to the inter-ELM, the small ELM filaments decrease the divertor peak surface temperature. With intermittent divertor filaments, the divertor heat flux width is comparable with that found in L-mode.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

PruningAMR

PruningAMR is an algorithm that reads in data stored as a neural network and outputs an adaptive mesh with values of the neural network stored at its vertices. Examples of input data include implicit neural representations (INRs) and physics-informed neural networks (PINNs). The output mesh is a grid-based adaptive mesh with larger elements for regions in which the neural network has coarse-scale variation and smaller elements for regions with fine scale variation. The goal of the software is to discretize the neural network to a mesh that faithfully captures the details encoded in the data without resorting a fine scale mesh.

Zvonek, JenniferE [Lawrence Livermore National Lab↗
DOE OSTI2024

Accuracy Enhancement of Nuclear Power Plant Simulators Utilizing High Accuracy Simulation Predictions

More recently, reactor core simulators for core designs associated with commercial nuclear power plants that utilize what is believed to be higher fidelity models have been developed. Features such as neutronics models that utilize transport equation solvers with fine spatial meshes and many energy-groups, thermal-hydraulic models that utilize sub-channel solvers with fine spatial mesh and capable of treating a wide range of fluid conditions, and fuel-coolant chemistry interaction models capable of treating CRUD deposition are to be found in these higher fidelity core simulators. These reactor core simulators require access to higher performance computers, characterized by many processors, cores and large memory. So associated with utilization of these simulators is access to high performance computers and ability to accommodate in one’s workflow longer execution times. By contrast, currently used core simulators by the nuclear industry can execute on engineering workstations and have execution times of seconds to minutes. The desirability for having short execution times is not only desired for support of time critical tasks but supports the mental process of decision making by engineers. The goal of the work reported upon here has the objective of retaining the fidelity of higher fidelity models while retaining the ability to utilize engineering workstations. Beyond the core simulator goal, additional goals of this work include incorporating the just described core simulator capability into a Nuclear Steam Supply System (NSSS) simulator, and to incorporate the resulting capability into an environment supportive of design and operational decision making associated with nuclear power stations. The model selected for the core neutronics model is the NESTLE code, for the core thermal-hydraulic model is the CTF code utilizing coarse mesh, and for the NSSS model is the RELAP5-3D code. WSC’s proprietary 3KEYMASTERTM platform is being used to provide software coupling, user interface, visualization, and reporting. The NESTLE core neutronics simulator was first integrated with the CTF core thermal-hydraulic simulator using CTF developed communication commands which are also used for CTF to communicate with RELAP5-3D under WSC’s proprietary 3KEYMASTERTM platform. To assure NESTLE prediction consistency with higher fidelity core neutronic simulators, buffer codes have been created to automatically generate from output files written by the VERA core simulator the NESTLE nodal neutronic parameter’ library, geometry, and pin-power reconstruction input files, thereby avoiding a number of challenges associated with utilizing lattice physics codes and providing consistency with VERA predictions. To treat absorber rod effects a multi-set library is utilized, where a set refers to a specific absorber rod fully inserted pattern. A coarse spatial mesh CTF model was developed with features added that support using CTF as envisioned in the engineering quality simulator. A hybrid meshing approach was implemented to allow for automated construction of models with mixed levels of refinement. Specifically, a core model could resolve some assemblies at a nodal level (4 subchannels per assembly) and others at a pin-resolution (one subchannel per coolant subchannel in the assembly). The intention is that this will allow for better resolution of limiting conditions such as DNBR and PCT, which are based on local rod and subchannel conditions. Further development was done of features that enhance the capabilities for the envisioned engineering quality simulator that has been developed, but now for RELAP-3D. The RELAP5-3D code development includes ability to model more than 999 components and the addition of the cross-channels turbulence mixing model and the void drift model that are implemented in CTF, aiming to achieve closer prediction agreement of the two codes for transient simulations, specifically, more accurate matches of the overall mass, momentum, and energy exchanges of both the liquid and gas phases between the neighboring core assemblies. Graphics were also developed for the Instructor Station for this project under WSC’s proprietary 3KEYMASTERTM platform to facilitate design and operational decision making.

42 ENGINEERING↗
DOE OSTI2025

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Role of Computational Parameters on Predicting Self-Consistent Residual Stress and Distortion during Wire Arc Additive Manufacturing

Production of three-dimensional metallic parts through integration of an articulated robot and gas metal arc welding, also known as wire arc additive manufacturing (WAAM), can produce large-scale components with moderate geometrical complexity. This technology is particularly appealing due to its high deposition rates, scalability, and cost-effective feedstock compared to other AM processes. Despite its advantages, WAAM adoption is hindered by challenges in ensuring geometric conformity without extensive distortion, defect-free structures, and consistent mechanical properties. Finite element analysis (FEA) is often used to address the challenge of geometrical conformity. As the size of parts increases, the best practices for mesh size and temporal resolution known in the literature become computationally unviable. This research examined the effects of mesh and time-step resolutions during transient FEA of a large-scale (248 layers) metallic part. The impact of computational parameters on the thermal history, displacement, and residual stress distributions were evaluated. The results showed that predicted distortion was consistent across resolutions, while time-step length significantly affected predicted thermal history, and mesh size influenced residual stress distributions. To investigate this relationship further, directionally biased meshes were considered and analyzed. The results indicated that increasing mesh resolution perpendicular to the welding path yielded stress predictions that aligned closely with higher-resolution models while offering substantial computational savings. In conclusion, the significances of this research are related to verification and validation of WAAM models for widespread industrial adoption and pragmatic guidelines for optimizing computation parameters for balancing computational efficiency and predictive accuracy of residual stress and distortion.

Solsbee, Brandon [Univ. of Tennessee, Knoxville, T↗
DOE OSTI2025

A novel transformation of the ice sheet Stokes equations and some of its properties and applications

We introduce a novel transformation of the Stokes equations into a form closely resembling the shallow Blatter–Pattyn equations. The two forms differ by only a few additional terms, while their variational formulations differ only by a single term in each horizontal direction. Specifically, the variational formulation of the Blatter–Pattyn model drops the vertical velocity in the second invariant of the strain rate tensor. Here we make use of the new transformation in two ways. First, we consider incorporating the transformed equations into a code that can be very easily converted from a Stokes to a Blatter–Pattyn model, and vice versa, by switching these terms on or off. This may be generalized so that the Stokes model is switched on adaptively only where the Blatter–Pattyn model loses accuracy. Second, the key role played by the vertical velocity in the Blatter–Pattyn approximation motivates new approximations. Two examples are presented. These require a mesh that enables the discrete continuity equation to be invertible for the vertical velocity in terms of the horizontal velocity components. Examples of such meshes, such as the first-order P1–E0 mesh and the second-order P2–E1 mesh, are given in both 2D and 3D. However, the transformed Stokes model has the same type of gravity forcing as the Blatter–Pattyn model, determined by the ice surface slope, thereby forgoing some of the mesh generality of the traditional formulation of the Stokes model.

58 GEOSCIENCES↗
DOE OSTI2024

System, method, and computer program for creating geometry-compliant lattice structures

A system and method of creating a shape-conforming lattice structure for a part formed via additive manufacturing. The method includes receiving a computer model of the part and generating a finite element mesh. A lattice structure including a number of lattice cellular components may also be generated. Some of the mesh elements of the finite element mesh may be deformed so that the finite element mesh conforms to the overall shape of the part. The lattice structure may then be deformed so that the lattice structure has a cellular periodicity corresponding to the finite elements of the finite element mesh. In this way, the part retains the benefits of its overall shape and the benefits of lattice features without introducing structural weak points, directional stresses, and other structural deficiencies.

Vernon, Gregory John↗
DOE OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
DOE OSTI2025

Sharp front tracking with geometric interface reconstruction

Here, this paper presents a novel sharp front-tracking method designed to address limitations in classical front-tracking approaches, specifically their reliance on smooth interpolation kernels and extended stencils for coupling the front and fluid mesh. In contrast, the proposed method employs exclusively sharp, localized interpolation and spreading kernels, restricting the coupling to the interfacial fluid cells–those containing the interface/front. This localized coupling is achieved by integrating a divergence-preserving velocity interpolation method with a piecewise parabolic interface calculation (PPIC) and a polyhedron intersection algorithm to compute the indicator function and local interface curvature. Surface tension is computed using the Continuum Surface Force (CSF) method, maintaining consistency with the sharp representation. Additionally, we propose an efficient local roughness smoothing implementation to account for surface mesh undulations, which is easily applicable to any triangulated surface mesh. Building on our previous work, the primary innovation of this study lies in the localization of the coupling for both the indicator function and surface tension calculations. By reducing the interface thickness on the fluid mesh to a single cell, as opposed to the 4–5 cell spans typical in classical methods, the proposed sharp front-tracking method achieves a highly localized and accurate representation of the interface. This sharper representation mitigates parasitic currents and improves force balancing, making it particularly suitable for scenarios where the interface plays a critical role, such as microfluidics, fluid-fluid interactions, and fluid-structure interactions. The proposed method is comprehensively validated and tested on canonical interfacial flow problems, including stationary and translating Laplace equilibria, oscillating droplets, and rising bubbles. The presented results demonstrate that the sharp front-tracking method significantly outperforms the classical approach in terms of accuracy, stability, and computational efficiency. Notably, parasitic currents are reduced by approximately two orders of magnitude and stable results are obtained for parameter ranges where classical front tracking fails to converge.

42 ENGINEERING↗
DOE OSTI2025

Precise Linker Length and Dynamic Bond Exchange Control Penetrant Diffusion in Dense Vitrimers

Polymer networks with dynamic covalent bonds have been investigated for their self-healing ability, recyclability, and potential as more sustainable materials. Recent results have indicated that in some cases, bond exchange can enhance the transport of penetrants in dense networks, pointing to their potential for separations of membranes. Here, imine dynamic bonds in ethylene oxide (EO) networks with precise linker lengths were synthesized to investigate the transport of N,N′-bis(2,5-di-tert-butylphenyl)-3,4,9,10-perylenedicarboximide (BTBP), a large, anisotropic dye molecule. Networks with mesh sizes smaller than, comparable to, and greater than the size of the penetrant axes were investigated to probe the effects of bond exchange and network confinement on transport. Mesh sizes, which ranged from 0.5 to 1.62 nm, were determined from shear rheology, glass transitions by calorimetry, and probe diffusion coefficients by fluorescence recovery after photobleaching. Permanent networks with identical EO chain lengths were prepared as control samples, and up to a 3 orders of magnitude increase in diffusion coefficient is observed in the dynamic systems for short linkers containing 13 backbone atoms. The longest linkers with 71 backbone atoms show no difference between the permanent and dynamic networks. Linkers shorter than 11 backbone atoms, corresponding to a mesh size smaller than the penetrant small axis, diffusion is no longer observable on the experimental time scale, indicating a sharp cutoff attributed to the precise linkers and narrow mesh size distribution. The dynamic imine exchange time scales were compared to the diffusive hopping times of penetrants and indicate that exchange can occur during a diffusive displacement. Furthermore, these findings provide insights into the factors affecting penetrant transport in dense polymers and inspire the development of next-generation selective polymer membranes.

Diffusion↗
DOE OSTI2025

Uncertainties in Simulating Flooding During Hurricane Harvey Using 2D Shallow Water Equations

Abstract Flooding is one of the most impactful weather‐related natural hazards. Numerical models that solve the two dimensional (2D) shallow water equations (SWE) represent the first‐principles approach to simulate all types of spatial flooding, such as pluvial, fluvial, and coastal flooding, and their compound dynamics. High spatial resolution (e.g., () m) is needed in 2D SWE simulations to capture flood dynamics accurately, resulting in formidable computational challenges. Thus, relatively coarser spatial resolutions are used for large‐scale simulations of flooding, which introduce uncertainties in the results. It is unclear how the uncertainty associated with the model resolution compares to the uncertainties in precipitation data sets and assumptions regarding boundary conditions when channelized flows interact with other water bodies. In this study, we compare these three sources of uncertainties in 2D SWE simulations for the 2017 Houston flooding event. Our results show that precipitation uncertainty and mesh resolution have more significant impacts on the simulated streamflow and inundation dynamics than the choice of the downstream boundary condition at the watershed outlet. We point out the viability to confine the uncertainty of coarsening mesh resolution by using the variable resolution mesh (VRM) which refines critical topographic features with far fewer grid cells. Specifically, in simulations with VRM, the simulated inundation depths over the refined region are comparable to that use the finest uniform mesh. This study contributes to understanding the challenges and pathways for applying 2D SWE models to improve the realism of flood simulations over large scales.

54 ENVIRONMENTAL SCIENCES↗