Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Boundary value problem”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Local-nonlocal coupling in Emu/PDMS

A technique called the splice method for coupling local to peridynamic subregions of a body is described. The method relies on ghost nodes, whose values of displacement are interpolated from nearby physical nodes, to make each subregion visible to the other. In each time step, the nodes in each subregion treat the nodes in the other subregion as boundary conditions. Adaptively changing the subregions is possible through the creation and deletion of ghost nodes. Example problems in 2D and 3D illustrate how the method is used to perform multiscale modeling of fracture and impact events within a larger structure.

42 ENGINEERING↗
DOE OSTI2024

A robust spectral element implementation of the $k - τ$ RANS model in Nek5000/NekRS

The $k - ω$ Reynolds Averaged Navier Stokes (RANS) model is one of the industry standard approaches for modeling of turbulent flows. It performs better than the $k - ϵ$ model for low Reynolds number flows and is also more suitable for boundary layers with adverse pressure gradients. Major drawback of the model, however, is that the asymptotic value of $ω$ at the walls is singular, necessitating the use of a contrived “sufficiently” large value for $ω$ as the boundary condition for its transport equation. Here, this invariably leads to the solution being sensitive to near wall grid spacing. While an acceptable solution for low order (finite volume) methods, the excessive near wall gradients lead to persistent numerical stability issues in high order codes. To alleviate the problem, specifically in the context of the high order spectral element code Nek5000, a regularized $k - ω$ approach was formulated in our prior work (Tomboulides et al., 2018). The formulation, however, relies on the use of wall distance and its gradients for modeling the closure terms and can pose problems for simulations in complex geometries. This work presents a novel implementation of the $k - τ$ RANS model in Nek5000, where $τ = 1/ω$, eliminating the need for regularization, owing to the asymptotically bounded behavior of the source terms in the $τ$ transport equation, and also eliminating dependence on wall distance. Robustness and stability of the $k - τ$ model is ensured through implicit treatment of the source terms and their careful numerical implementation and demonstrated through several cases aimed at verification and validation. Studies include both canonical and engineering relevant problems, viz., turbulent channel flow, pipe flow, backward facing step, flow over NACA 0012 airfoil and flow in a T-junction. Results from the $k - τ$ model are shown to be consistent with regularized $k - ω$ model and also with the $k - ω$ SST model in OpenFOAM (for select studies). Comparison with experimental data is also shown, where available, to bolster validation efforts for the $k - τ$ model implementation through prediction of key turbulent quantities of interest.

Nek5000↗
DOE OSTI2022

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Spatially quasi-periodic water waves of finite depth

We present a numerical study of spatially quasi-periodic gravity-capillary waves of finite depth in both the initial value problem and travelling wave settings. We adopt a quasi-periodic conformal mapping formulation of the Euler equations, where one-dimensional quasi-periodic functions are represented by periodic functions on a higher-dimensional torus. We compute the time evolution of free surface waves in the presence of a background flow and a quasi-periodic bottom boundary and observe the formation of quasi-periodic patterns on the free surface. Two types of quasi-periodic travelling waves are computed: small-amplitude waves bifurcating from the zero-amplitude solution and larger-amplitude waves bifurcating from finite-amplitude periodic travelling waves. We derive weakly nonlinear approximations of the first type and investigate the associated small-divisor problem. We find that waves of the second type exhibit striking nonlinear behaviour, e.g. the peaks and troughs are shifted non-periodically from the corresponding periodic waves due to the activation of quasi-periodic modes.

Science & Technology - Other Topics↗
DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗
DOE OSTI2022

Extension of the PINN diffusion model to k-eigenvalue problems

This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗
DOE OSTI2020

Simulation of the Fast Reactor Fuel Assembly Duct-Bowing Reactivity Effect Using Monte Carlo Neutron Transport and Finite Element Analysis

This paper discusses a new method of simulating the fuel assembly duct-bowing reactivity coefficient for EBR-II run 138B. Quantification of the fuel assembly duct-bowing reactivity effect in liquid metal–cooled fast reactors has been a persistent problem since they were first designed and operated. Simulation of the duct-bowing reactivity effect is difficult because the level of detail required to simulate the effect has exceeded most modeling capabilities. The new method outlined in this paper utilizes the finite element analysis code ANSYS to analyze the thermal and structural components. Here, the displacement of the fuel assembly duct due to thermal expansion and mechanical interaction was calculated by ANSYS using recorded EBR-II run 138B temperature and power boundary value data. The displacement values were incorporated into to a Monte Carlo model of EBR-II run 138B and keff was calculated. Multiple Monte Carlo calculations were performed with duct displacement values corresponding to different reactor temperatures. Using the calculated keff values associated with the different duct displacement results allowed calculation of the duct-bowing reactivity coefficient. The duct-bowing reactivity coefficient was calculated to be –14.5 × 10 –4 $/°C/ ± 4.4%.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Elucidating the Onset of Plasticity in Sliding Contacts Using Differential Computational Orientation Tomography

Abstract Depending on the mechanical and thermal energy introduced to a dry sliding interface, the near-surface regions of the mated bodies may undergo plastic deformation. In this work, we use large-scale molecular dynamics simulations to generate “differential computational orientation tomographs” (dCOT) and thus highlight changes to the microstructure near tribological FCC alloy surfaces, allowing us to detect subtle differences in lattice orientation and small distances in grain boundary migration. The analysis approach compares computationally generated orientation tomographs with their undeformed counterparts via a simple image analysis filter. We use our visualization method to discuss the acting microstructural mechanisms in a load- and time-resolved fashion, focusing on sliding conditions that lead to twinning, partial lattice rotation, and grain boundary-dominated processes. Extracting and laterally averaging the color saturation value of the generated tomographs allows us to produce quantitative time- and depth-resolved maps that give a good overview of the progress and severity of near-surface deformation. Corresponding maps of the lateral standard deviation in the color saturation show evidence of homogenization processes occurring in the tribologically loaded microstructure, frequently leading to the formation of a well-defined separation between deformed and undeformed regions. When integrated into a computational materials engineering framework, our approach could help optimize material design for tribological and other deformation problems. Graphic Abstract .

36 MATERIALS SCIENCE↗
DOE OSTI2025

Information theory optimization of signals from small-angle scattering measurements

Small-angle X-ray scattering (SAXS) of particles in solution informs on the conformational states and assemblies of biological macromolecules (bioSAXS) outside of cryo- and solid-state conditions. In bioSAXS, the SAXS measurement under dilute conditions is resolution limited, and through an inverse Fourier transform, the measured SAXS intensities directly relate to the physical space occupied by the particles via the P (r)-distribution. Yet, this inverse transform of SAXS data has been historically cast as an ill-posed, ill-conditioned problem requiring an indirect approach. Here, we show that through the applications of matrix and information theories, the inverse transform of SAXS intensity data is a well-conditioned problem. The so-called ill-conditioning of the inverse problem is directly related to the Shannon number. By exploiting the oversampling enabled by modern detectors, a direct inverse Fourier transform of the SAXS data is possible, provided the recovered information does not exceed the Shannon number. The Shannon limit corresponds to the maximum number of significant singular values that can be recovered in a SAXS experiment, suggesting this relationship is a fundamental property of band-limited inverse integral transform problems. This correspondence reduces the complexity of the inverse problem to the Shannon limit and maximum dimension. We propose a hybrid scoring function using an information theory framework that assesses both the quality of the model-data fit as well as the quality of the recovered P (r)-distribution. The hybrid score utilizes the Akaike information criteria and Durbin-Watson statistic that considers parameter-model complexity, i.e., degrees of freedom, and the randomness of the model-data residuals. The described tests and findings extend the boundaries for bioSAXS by completing the information theory formalism initiated by Peter B. Moore to enable a quantitative measure of resolution in SAXS, robustly determine maximum dimension, and more precisely define the best parameter model appropriately representing the observed scattering data.

Rambo, Robert P. [Science and Technology Facilitie↗
DOE OSTI2021

Lattice determination of 𝐼=0 and 2 𝜋⁢𝜋 scattering phase shifts with a physical pion mass

Phase shifts for 𝑠-wave 𝜋⁢𝜋 scattering in both the 𝐼 =0 and 𝐼 =2 channels are determined from a lattice QCD calculation performed on 741 gauge configurations obeying G-parity boundary conditions with a physical pion mass and lattice size of 32 3 ×64. These results support our recent 2021 study of direct 𝐶⁢𝑃 violation in 𝐾 → 𝜋⁢𝜋 decay, improving our earlier 2015 calculation. The phase shifts are determined for both stationary and moving 𝜋⁢𝜋 systems, at three (𝐼 = 0) and four (𝐼 = 2) different total momenta. We implement several 𝜋⁢𝜋 interpolating operators including a scalar bilinear “𝜎” operator and paired single-pion bilinear operators with the constituent pions carrying various relative momenta. Several techniques, including correlated fitting and a bootstrap determination of p-values have been used to refine the results and a comparison with the generalized eigenvalue problem method is given. A detailed systematic error analysis is performed which allows phase shift results to be presented at a fixed energy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Hydro-Code Implementation and Testing of a Kinetic Phase Transition Framework

In this report we describe the Kinetic Phase Transition (KPT) framework that has been worked out over the last 10 years (from around 2014) and the implementation of it into three different codes, the one-dimensional hydro- LASLO and the three-dimensional magneto-hydro- ALEGRA, Sandia codes, via subroutines in the LAMBDA Equations of State and constitutive models package, and Flag, an arbitrary Lagrangian-Eulerian multiphysics code developed within the Lagrangian Applications project (LAP) at LANL. We discuss the introduction of phase mass (and/or volume) fractions that are needed in a code for it to be ‘phase aware’, that is, not only the thermodynamic state is known in each point but also the mixture of the materials’ phases in that point. Further we point to the need of a full Equations of State for each phase in a material to achieve phase awareness and we review the equilibrium phase model, where a phase mixture is at its lowest Gibbs free energy state, to make this point clear. Contrasting the kinetic phase transition to this equilibrium model seamlessly introduce us to the KPT framework that is subsequently thoroughly discussed. While the determination of the total state and the states and mass fractions of phases in each point is a problem that can borrow many of its numerical details from Eulerian codes and mixture of materials (not phases), the update of mass fractions with time in a KPT framework needs a new set of considerations. General for any update model is that we need to prevent mass fractions from becoming unphysical (negative or their sum to be larger than one). We have solved this problem by implementing a subdivision of the hydro time step that prevents the phase from being fully present to not present at all in one subdivided time step by limiting the size of the subdivided time step. This scheme also corrects numerical problems from abrupt changes in parameter values, the so called Gibbs phenomena, that gives rise to slushing between phases in the KPT framework. Interspersed throughout the report are discussions on different thermodynamics considerations. EOS validity windows, limitations on the EOS phase space, are needed for the KPT framework and are discussed separately and exemplified. The KPT framework described in this report has been verified by code comparison, but validation is still an active area of research. There is room for improvement in the update model, both in the model for determination of rates and in how to prevent the mass fractions from becoming unphysical. In addition, the parameters in the KPT update model and the placement of the phase boundary in the EOS phase space, and interactions with other constitutive models, are closely related and interfering with each other. One possible way forward is to simultaneously develop KPT parameters, EOS, and constitutive models for each material.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The transition from resistance to acceptance: Managing a marine invasive species in a changing world

Abstract Marine invasive species can transform coastal ecosystems, yet mitigating their effects can be difficult, and even impractical. Often, marine invasive species are managed at poorly matched spatial scales, and at the same time, rates of spread and establishment are increasing under climate change and can outpace resources available for population suppression. These circumstances challenge traditional conservation goals of maintaining a historic environmental state, especially for a species like the European green crab ( Carcinus maenas ), a formidable invader with few examples of successful long‐term removal programs. A management paradigm where decision alternatives include resisting or accepting a new ecological trajectory may be needed. We apply mathematical concepts from decision theory to develop a quantitative framework for navigating management decisions in this new resist‐accept paradigm. We develop a model of European green crab growth, removal and colonization, and we find optimal levels of removal effort that minimize both ecological change and removal cost. We establish a benchmark of colonization pressure at which green crab density becomes decoupled from a decision maker's actions, such that population control can no longer shape the invasion trajectory. For informing the decision boundary between resistance and acceptance, our results highlight that a decision maker's understanding of how removal cost scales with removal effort is more important than understanding the density‐impact relationship. We show that assuming stationary system dynamics can result in sub‐optimal levels of species removal effort, highlighting the importance of developing anticipatory management strategies by accounting for non‐stationary dynamics. Policy implications . For marine invasive species that can disperse across long distances and recolonize rapidly after removal, the focus of conservation policy should shift away from understanding how to resist change to understanding when to stop resisting change. Navigating this decision problem involves trade‐offs among competing objectives, highlighting the need for structured approaches to elicit objective weights that reflect the values of the decision maker. For natural resource managers facing possible ecosystem transformation, this decision framework can enable proactive and strategic decisions made under uncertainty in a changing world.

Keller, Abigail G. [Department of Environment Scie↗
DOE OSTI2021

Inverse Design of Two-Dimensional Airfoils Using Conditional Generative Models and Surrogate Log-Likelihoods

Abstract This paper shows how to use conditional generative models in two-dimensional (2D) airfoil optimization to probabilistically predict good initialization points within the vicinity of the optima given the input boundary conditions, thus warm starting and accelerating further optimization. We accommodate the possibility of multiple optimal designs corresponding to the same input boundary condition and take this inversion ambiguity into account when designing our prediction framework. To this end, we first employ the conditional formulation of our previous work BézierGAN–Conditional BézierGAN (CBGAN)—as a baseline, then introduce its sibling conditional entropic BézierGAN (CEBGAN), which is based on optimal transport regularized with entropy. Compared with CBGAN, CEBGAN overcomes mode collapse plaguing conventional GANs, improves the average lift-drag (Cl/Cd) efficiency of airfoil predictions from 80.8% of the optimal value to 95.8%, and meanwhile accelerates the training process by 30.7%. Furthermore, we investigate the unique ability of CEBGAN to produce a log-likelihood lower bound that may help select generated samples of higher performance (e.g., aerodynamic performance). In addition, we provide insights into the performance differences between these two models with low-dimensional toy problems and visualizations. These results and the probabilistic formulation of this inverse problem justify the extension of our GAN-based inverse design paradigm to other inverse design problems or broader inverse problems.

Engineering↗
DOE OSTI2021

MOOSE Framework Meshing Enhancements to Support Reactor Analysis

MOOSE-based physics codes require an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The use of difficult-touse, external licensed software is often required to generate high quality meshes for reactor geometries. High-fidelity geometry modeling also requires elaborate tracking of groups of elements for material property assignment and output reporting which can be considerably complex for the user to identify and maintain. Under the U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, several meshingrelated enhancements have been developed for the MOOSE framework to address user challenges in creating finite element meshes for advanced reactor geometries. MOOSE mesh generators have been developed to mesh hexagonal geometries (pins, ducted assemblies, and cores) commonly found in liquid-metal cooled fast reactor concepts. The mesh generator used for hexagonal pin cells is generic for regular polygons and therefore may also be used for Cartesian pin cells. Hexagonal pin cells can be stitched into ducted assemblies, and assemblies can be stitched together into a core. The user may specify region ids, region names, and other preferences on the mesh. This control is useful for later material mapping in the MOOSE-based physics codes input. A capability was also developed for meshing rotating control drums including determination of material volume fractions in each mesh element as a function of time. Control drum meshes may be stitched to other hexagonal assemblies to create a core configuration. Additional mesh generators were developed that wrap around the hexagonal meshing capabilities and utilize “extra element integer” ID values on each element. In regular Cartesian or hexagonal assemblies or cores, the bookkeeping of element groups for both material assignment and output reporting can now be automated through assignment of pin, assembly, core, axial and depletion id values stored as extra element integers. The extra element tags on the mesh greatly speed the reactor analyst’s efforts to map materials to meshes, track depletion zones, and parse output such as axial pin power distributions. At the highest level, pin, assembly, and core mesh generators (with this reactor terminology) have also been developed to easily generate regular Cartesian and hexagonal cores, including axial extrusion. These reactor geometry builders call upon the previously mentioned capabilities to produce analysis-ready 3D meshes including material assignments. Open source mesh triangulation capabilities were also investigated for integration into the MOOSE framework to address the need for meshing the core periphery region which extends from the irregular outer assembly border to a cylindrical boundary. Options are limited due to licensing constraints, and the recommendation is pursue building a native MOOSE Delaunay triangulator routine with full functionality. Finally, a series of verification problems were performed with NEAMS physics tools. All developed capabilities will be available in the new open-source “Reactor” module of the MOOSE framework, which is accessible to any MOOSE-based NEAMS physics tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Evanescent and inertial-like waves in rigidly rotating odd viscous liquids

Three-dimensional non-rotating odd viscous liquids give rise to Taylor columns and support axisymmetric inertial-like waves ( J. Fluid Mech ., vol. 973, 2023, A30). When an odd viscous liquid is subjected to rigid-body rotation however, there arise in addition a plethora of other phenomena that need to be clarified. In this paper, we show that three-dimensional incompressible or two-dimensional compressible odd viscous liquids, rotating rigidly with angular velocity 𝛺, give rise to both oscillatory and evanescent inertial-like waves or a combination thereof (which we call of mixed type) that can be non-axisymmetric. By evanescent, we mean that along the radial direction, typically when moving away from a solid boundary, the velocity field decreases exponentially. These waves precess in a prograde or retrograde manner with respect to the rotating frame. The oscillatory and evanescent waves resemble respectively the body and wall-modes observed in (non-odd) rotating Rayleigh–Bénard convection ( J. Fluid Mech ., vol. 248, 1993, pp. 583–604). We show that the three types of waves (wall, body or mixed) can be classified with respect to pairs of planar wavenumbers 𝜅 which are complex, real or a combination, respectively. Experimentally, by observing the precession rate of the patterns, it would be possible to determine the largely unknown values of the odd viscosity coefficients. This formulation recovers as special cases recent studies of equatorial or topological waves in two-dimensional odd viscous liquids which provided examples of the bulk–interface correspondence at frequencies 𝜔 < 2⁢𝛺. We finally point out that the two- and three-dimensional problems are formally equivalent. Their difference then lies in the way data propagate along characteristic rays in three dimensions, which we demonstrate by classifying the resulting Poincaré–Cartan equations.

Mechanics↗