Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothed boundary method”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Smoothed boundary method for simulating incompressible flow in complex geometries

Simulating flow through porous media with explicit considerations of complex microstructures is very challenging using conventional sharp-interface methods because of the difficulties in generating meshes conformal to complex geometries. In this work, a diffuse interface embedded boundary method known as the Smoothed Boundary Method (SBM) is utilized to facilitate simulations of fluid dynamics involving complex geometries. In diffuse-interface methods, the geometry is described by a domain parameter. The SBM allows the straightforward reformulation of the time-dependent Navier-Stokes equations in terms of this domain parameter, using only algebraic identities. Thus, enforcing the appropriate boundary conditions at the irregular embedded boundary is greatly simplified. Adaptive mesh refinement is used to increase the accuracy of the diffuse interface method by allowing thinner interfacial thickness to be used in the domain parameter. Here, the SBM-formulated Navier-Stokes equations are solved with the Finite Difference Method on refined mesh systems. Sharp-interface Finite Element Method simulations using the commercial software COMSOL on body-conforming meshes are also provided for comparison. Favorable agreement between the two methods is observed. Since it is no longer necessary for the mesh to conform to the complex geometry, the grid system for the SBM simulations can be generated rapidly and without additional manual interventions, making the entire simulation process more expedient.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Simulating hindered grain boundary diffusion using the smoothed boundary method

Abstract Grain boundaries can greatly affect the transport properties of polycrystalline materials, particularly when the grain size approaches the nanoscale. While grain boundaries often enhance diffusion by providing a fast pathway for chemical transport, some material systems, such as those of solid oxide fuel cells and battery cathode particles, exhibit the opposite behavior, where grain boundaries act to hinder diffusion. To facilitate the study of systems with hindered grain boundary diffusion, we propose a model that utilizes the smoothed boundary method to simulate the dynamic concentration evolution in polycrystalline systems. The model employs domain parameters with diffuse interfaces to describe the grains, thereby enabling solutions with explicit consideration of their complex geometries. The intrinsic error arising from the diffuse interface approach employed in our proposed model is explored by comparing the results against a sharp interface model for a variety of parameter sets. Finally, two case studies are considered to demonstrate potential applications of the model. First, a nanocrystalline yttria-stabilized zirconia solid oxide fuel cell system is investigated, and the effective diffusivities are extracted from the simulation results and are compared to the values obtained through mean-field approximations. Second, the concentration evolution during lithiation of a polycrystalline battery cathode particle is simulated to demonstrate the method’s capability.

Materials Science↗
DOE OSTI2022

Calculating the grain boundary inclination of voxelated grain structures using a smoothing algorithm

We have developed a flexible method for calculating the grain boundary (GB) inclinations of voxelated grain structure data using smoothing algorithms. We compared the performance of four algorithms: the linear interpolation, Allen–Cahn, level-set, and vertex algorithms. We assessed their accuracy using 2D and 3D cases with known inclinations. The vertex algorithm provided the best balance between accuracy and efficiency for 2D structures while the linear interpolation algorithm provided the best balance for 3D structures. We compared the GB inclinations calculated using our smoothing method on a 3D high energy X-ray diffraction microscopy (HEDM) dataset to those determined by meshing the GBs. The two approaches determined similar GB plane distributions, though they varied significantly at triple junctions. In conclusion, the smoothing method was demonstrated for two sources of 3D voxelated grain structures: HEDM data and results from Monte Carlo Potts grain growth simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2022

High Performance Equilibrium Solvers for Integrated Magnetic Fusion Simulations

With the funding provided by this award, we developed numerical codes for the study of magnetically confined plasmas for fusion applications. Accordingly, our work can be divided into two separate categories: 1) the design and analysis of novel numerical methods providing high accuracy and high efficiency; 2) the study of the equilibrium and stability of magnetically confined plasmas with some of these numerical codes, as well as the study of the nature of the turbulent behavior which may arise in the presence of instabilities. We first developed new numerical schemes based on integral equation methods for the computation of steady-state magnetic configurations in fusion experiments, providing high accuracy for the magnetic field and its derivatives, which are required for stability and turbulence calculations. We employed different integral formulations depending on the application of interest: axisymmetric or non-axisymmetric equilibria, force-free or magnetohydrodynamic equilibria, fixed-boundary equilibria or free-boundary equilibria. While efficient, these methods do not yet apply to plasma boundaries which are not smooth, a situation which is fairly common in magnetic confinement experiments. To address this temporary weakness, we also constructed a new steady-state solver based on the Hybridizable Discontinuous Galerkin (HDG) method, which provides full geometric flexibility. In addition to these numerical tools focused on steady-states, we also contributed to the improvement of the speed and accuracy of codes simulating the plasma dynamics of fusion plasmas, by developing a novel velocity space representation for the efficient solution of kinetic equations, which most accurately describe the time evolution of hot plasmas in fusion experiments. Using the tools discussed above, we studied several questions pertaining to the equilibrium and stability of magnetically confined plasmas. In particular, we derived a new simple model for axisymmetric devices called tokamaks, to predict how elongated a fusion plasma can be before it becomes unstable and collapses. We also looked at the effect of the shape of the outer plasma surface on key properties of the steady-state magnetic configurations, and how these properties impact turbulence in fusion plasmas, and the corresponding transport of momentum. Likewise, we studied the role of large localized flows on the steady-state magnetic configurations, and how they may influence plasma stability and turbulence. Non-axisymmetric steady-state magnetic configurations are inherently more complex than axisymmetric steady-state configurations, and the subject of ongoing controversies regarding the regularity of the equations determining such steady-states, and their solutions. Implementing an existing NYU code in a new geometry, we studied the nature of the singularity of the solutions observed in the code, and methods to eliminate them. Our main conclusion is that by appropriately tailoring the plasma boundary, it is possible to eliminate the singularities otherwise appearing in our simulations, and to obtain steady-states which appear to be smooth. To gain further insights on incompletely understood turbulence phenomena, we proposed a new reduced model capturing most of these phenomena, which is simple enough to not require expensive numerical simulations on massive supercomputers to investigate them. We demonstrated the strong similarity between our simulations and published results obtained from computationally expensive simulations, and plan to rely on our reduced model to identify the key mechanisms determining the evolution and strength turbulent driven transport in fusion plasmas. Finally, we proposed a new framework for tokamak reactor design studies, enabling us to consider the relative merits of steady-state versus pulsed fusion reactors. We found that pulsed fusion reactors may benefit most from recent advances in magnet technology, and the availability of very high field magnets. As such, they may become more desirable than steady-state tokamak reactors for cost efficient electricity generation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Improved Data Interpretation through Identification of Time Series Periodicity Changes

Analysis and interpretation of time series data is easiest when the data values occur at uniform intervals in time, but actual data may have differing data sampling frequencies, such as monthly and daily readings. Applying data analysis techniques, such as smoothing, to such a data set may not give a representative result between time segments. The ability to automatically distinguish time segments of differing data frequency would provide a means for applying data analysis independently to each segment, though a suitable blending at segment boundaries would be required. A method for detecting frequency changes was developed and applied to Gaussian and median smoothing of hydraulic head data from groundwater wells at the U.S. Department of Energy Hanford Site in southeastern Washington state. The process identifies time segments of high-frequency (daily) or low-frequency (greater than daily) data using adjusted-bandwidth Gaussian kernel density estimation and a threshold value, which are further refined to address small blocks of low-frequency data within larger blocks of high-frequency data. User-selectable levels of smoothing are then applied independently to the time segments prior to combining the segment results for a single smoothed data set. This time segment identification approach provides effective low- and high-frequency data separation, which provides a method to apply data analysis independently to each time segment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Error analysis of numerical methods for thick diffusive neutron transport problems on Shishkin mesh

A thin layer will develop at the boundary if the incoming angular flux is anisotropic in thick diffusive neutron transport problems. Solving such singularly perturbed problems, which have non-smooth solutions with singularity near the boundary, is computationally challenging. Standard finite difference schemes on a uniform mesh cannot yield ε-uniform convergence, where ε is a small parameter, while it can be achieved on a suitable piecewise-uniform Shishkin mesh. We present a formal error analysis of the diamond difference (DD) method and step difference (SD) method for solving the S{sub N} neutron transport equation. The analysis can be extended to other finite difference methods. Numerical results are presented to confirm the error estimates and the advantages of the Shishkin mesh. (author)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Efficient generalized boundary detection

Fast, efficient, and robust compression-based methods for detecting boundaries in arbitrary datasets, including sequences (1D datasets), are desired. The methods, each employing three simple algorithms, approximate the information distance between two adjacent sliding windows within a dataset. One of the algorithms calculates an initial ordered list of subsequences; while a second algorithm updates the ordered list of subsequences by dropping a first entry and appending a last entry rather than calculating completely new ordered lists with each iteration. Large values in the distance metric are indicative of boundary locations. A smoothed z-score or a wavelet-based algorithm may then be used to locate peaks in the distance metric, thereby identifying boundary locations. An adaptive version of the method employs a collection of window sizes and corresponding weighting functions, making it more amenable to real datasets with unknown, complex, and changing structures.

Ting, Christina↗
DOE OSTI2023

Direct Numerical Simulation of Transitional and Turbulent Flows Over Multi-Scale Surface Roughness—Part II: The Effect of Roughness on the Performance of a High-Pressure Turbine Blade

Abstract Turbine blades generally present surface roughness introduced in the manufacturing process or caused by in-service degradation, which can have a significant impact on aero-thermal performance. A better understanding of the fundamental physical mechanisms arising from the interaction between the roughness and the turbine flow at engine-relevant conditions can provide insights for the design of blades with improved efficiency and longer operational life. To this end, a high-fidelity numerical framework combining a well-validated solver for direct numerical simulation and a second-order accurate immersed boundary method is employed to predict roughness-induced aero-thermal effects on an LS89 high-pressure turbine (HPT) blade at engine-relevant conditions. Different amplitudes and distributions of surface roughness are investigated and a reference smooth-blade simulation under the same flow conditions is conducted for comparison. Roughness of increasing amplitude progressively shifts the blade suction side boundary layer transition upstream, producing larger values of the turbulent kinetic energy and higher total wake losses. The on-surface data-capturing capabilities of the numerical framework provide direct measurements of the heat flux and the skin friction coefficient, hence offering quantitative information between the surface topology and engineering-relevant performance parameters. This work may provide a benchmark for future numerical studies of turbomachinery flows with roughness.

Engineering↗
DOE OSTI2022

A Moving Embedded Boundary Approach for the Compressible Navier-Stokes Equations in a Block-Structured Adaptive Refinement Framework

A computational technique has been developed to perform compressible flow simulations involving moving boundaries using an embedded boundary approach within the block-structured adaptive mesh refinement (SAMR) framework of AMReX [1], [91], [92]. We leverage the SAMR capability to obtain quantitatively accurate results whilst using robust, second-order finite volume schemes. A conservative, unsplit, cut-cell approach is utilized and a ghost-cell approach is developed for computing the flux on the moving, embedded boundary faces. A third-order least-squares formulation has been developed to compute the wall velocity gradients, and was found to significantly improve the performance of the solver in terms of the quantitative comparison of surface quantities such as the skin friction coefficient. Various test cases are performed to validate the method, and compared with analytical, experimental, and other numerical results in literature. Inviscid and viscous test cases are performed that span a wide regime of flow speeds - acoustic (harmonically pulsating sphere), smooth flows (expansion fan created by a receding piston) and flows with shocks (shock-cylinder interaction, shock-wedge interaction, pitching NACA 0012 airfoil and shock-cone interaction). A closed system with moving boundaries - an oscillating piston in a cylinder, showed that the percentage error in mass within the system decreases with refinement, demonstrating that the numerical scheme is conservative with grid refinement, but is not discretely conservative. Viscous test cases involve that of a horizontally moving cylinder at Re = 40, an inline oscillating cylinder at Re = 100, and a transversely oscillating cylinder at Re = 185. The judicious use of adaptive mesh refinement with appropriate refinement criteria to capture the regions of interest leads to well-resolved flow features, and good quantitative comparison is observed with the results available in literature.

adaptive refinement↗
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 OSTI2021

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Impact of the plastic deformation microstructure in metals on the kinetics of recrystallization: A phase-field study

The sensitivity of recrystallization kinetics in metals to the heterogeneity of microstructure and deformation history is a widely accepted experimental fact. However, most of the available recrystallization models employ either a mean field approach or use grain-averaged parameters, and thus neglecting the mesoscopic heterogeneity induced by prior deformation. Here in the present study, we investigate the impact of deformation-induced dislocation (subgrain) structure on the kinetics of recrystallization in metals using the phase-field approach. The primary focus here is upon the role of dislocation cell boundaries. The free energy formulation of the phase-field model accounts for the heterogeneity of the microstructure by assigning localized energy to the resulting dislocation microstructure realizations generated from experimental data. These microstructure realizations are created using the universal scaling laws for the spacing and the misorientation angles of both the geometrically necessary and incidental dislocation boundaries. The resulting free energy is used into an Allen-Cahn based model of recrystallization kinetics, which are solved using the finite element method. The solutions thus obtained shed light on the critical role of the spatial heterogeneity of deformation in the non-smooth growth of recrystallization nuclei and on the final grain structure. The results showed that, in agreement with experiment, the morphology of recrystallization front exhibits protrusions and retrusions. By resolving the subgrain structure, the presented algorithm paves the way for developing predictive kinetic models that fully account for the deformed state of recrystallizing metals.

36 MATERIALS SCIENCE↗
DOE OSTI2023

A Minkowski difference-based advancing front packing technique for generating convex noncircular particles in complex domains

In this work, a Minkowski difference-based advancing front approach is proposed to generate convex and non-circular particles in a predefined computational domain. Two specific algorithms are developed to handle the contact conformity of generated particles with the boundaries of the computational domain. The first, called the open form, is used to handle the smooth contact of generated particles with (external) boundaries, while the other, called the closed form, is proposed to handle the internal boundaries of a computational domain with a complex cavity. The Gilbert-Johnson-Keerthi (GJK) method is used to efficiently solve the contact detection between the newly generated particle at the front and existing particles. Furthermore, the problem of one-sided particle lifting, which can cause some defects in the packing structure in existing advancing front methods during packing generation, is highlighted and an effective solution is developed. Several examples of increasing complexity are used to demonstrate the efficiency and applicability of the proposed packing generation approach. The numerical results show that the generated packing is not only more uniform, but also achieves a higher packing density than existing advancing front methods.

42 ENGINEERING↗
DOE OSTI2023

Recipes for when physics fails: recovering robust learning of physics informed neural networks

Abstract Physics-informed neural networks (PINNs) have been shown to be effective in solving partial differential equations by capturing the physics induced constraints as a part of the training loss function. This paper shows that a PINN can be sensitive to errors in training data and overfit itself in dynamically propagating these errors over the domain of the solution of the PDE. It also shows how physical regularizations based on continuity criteria and conservation laws fail to address this issue and rather introduce problems of their own causing the deep network to converge to a physics-obeying local minimum instead of the global minimum. We introduce Gaussian process (GP) based smoothing that recovers the performance of a PINN and promises a robust architecture against noise/errors in measurements. Additionally, we illustrate an inexpensive method of quantifying the evolution of uncertainty based on the variance estimation of GPs on boundary data. Robust PINN performance is also shown to be achievable by choice of sparse sets of inducing points based on sparsely induced GPs. We demonstrate the performance of our proposed methods and compare the results from existing benchmark models in literature for time-dependent Schrödinger and Burgers’ equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Comparison of machine learning and electrical resistivity arrays to inverse modeling for locating and characterizing subsurface targets

Here, this study evaluates the performance of multiple machine learning (ML) algorithms and electrical resistivity (ER) arrays for inversion with comparison to a conventional Gauss-Newton numerical inversion method. Four different ML models and four arrays were used for the estimation of only six variables for locating and characterizing hypothetical subsurface targets. The combination of dipole-dipole with Multilayer Perceptron Neural Network (MLP-NN) had the highest accuracy. Evaluation showed that both MLP-NN and Gauss-Newton methods performed well for estimating the matrix resistivity while target resistivity accuracy was lower, and MLP-NN produced sharper contrast at target boundaries for the field and hypothetical data. Both methods exhibited comparable target characterization performance, whereas MLP-NN had increased accuracy compared to Gauss-Newton in prediction of target width and height, which was attributed to numerical smoothing present in the Gauss-Newton approach. MLP-NN was also applied to a field dataset acquired at U.S. DOE Hanford site.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

First-passage time statistics on surfaces of general shape: Surface PDE solvers using Generalized Moving Least Squares (GMLS)

Here, we develop numerical methods for computing statistics of stochastic processes on surfaces of general shape with drift-diffusion dynamics d X t = a (X t ) dt + b(X t ) d W t . We formulate descriptions of Brownian motion and general drift-diffusion processes on surfaces. We consider statistics of the form u (x) = E x [$∫^{τ}_{0}$ g (X t ) dt ] + E x [ f (X τ )] for a domain Ω and the exit stopping time τ = inf t { t >0 | X i Ω}, where f , g are general smooth functions. For computing these statistics, we develop high-order Generalized Moving Least Squares (GMLS) solvers for associated surface PDE boundary-value problems based on Backward- Kolmogorov equations. We focus particularly on the mean First Passage Times (FPTs) given by the case f = 0, g = 1 where u (x) = E x [τ]. We perform studies for a variety of shapes showing our methods converge with high-order accuracy both in capturing the geometry and the surface PDE solutions. We then perform studies showing how statistics are influenced by the surface geometry, drift dynamics, and spatially dependent diffusivities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Non-conformal interface-cohesive modeling with the shifted boundary method

The accurate simulation of boundary- and interface-dominated problems on complex geometries remains challenging when boundary- or interface-fitted meshes are difficult to generate, particularly for curved boundaries, polycrystalline microstructures, and dense interface networks. The Shifted Boundary Method (SBM) alleviates this meshing burden by shifting the enforcement of boundary conditions from the true boundary to a nearby surrogate boundary and recovering the effect of the true boundary through geometric correction terms, thereby enabling standard finite element spaces on non-boundary-fitted meshes. In this report, we develop a general shiftedboundary and shifted-interface framework within the open-source MOOSE framework. We first present a general SBM implementation for complex geometries on non-boundary-fitted meshes. We then adopt the Shifted Interface Method (SIM) for internal interfaces and develop a unified shifted-interface treatment in which the interface law is enforced on a surrogate interface and the effect of the true interface is recovered through shifted jumps, fluxes, and tractions. This perspective brings scalar thermal-contact and vector-valued cohesive-zone mechanics into a single framework, the latter realized as the Shifted Cohesive Zone Method (SCZM) and coupled with history-dependent constitutive models from NEML2. We further extend the MOOSE mesh infrastructure to support cohesive-zone calculations on distributed meshes. The framework is verified and demonstrated through three progressive studies: Poisson’s equation on a smoothed starshaped domain, a manufactured thermal-contact problem on a non-interface-fitted mesh, and a two-dimensional polycrystalline representative volume element combining crystal plasticity with cohesive grain-boundary interfaces. Across these studies, the shifted formulations reproduce boundary- and interface-fitted reference solutions with high fidelity, indicating that the proposed framework provides an accurate and efficient route to boundary- and interface-dominated simulations on arbitrary geometries without requiring fitted meshes.

Yang, Cheng-Hau↗