Search NASA⌕ Search

SEARCH · Search NASA

Results for “Burgers”

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

Quantifying and visualizing the microscopic degrees of freedom of grain boundaries in the Wigner–Seitz cell of the displacement-shift-complete lattice

Here we introduce a grain boundary (GB) translation vector, t ws , to describe and quantify the domain of the microscopic degrees of freedom of GBs. It has long been recognized that for fixed macroscopic degrees of freedom of a GB there exists a large multiplicity of states characterized by different relative grain translations. More recently another degree of freedom, [n], the number of GB atoms, has emerged and is now recognized as an equally important component of GB structural multiplicity. In this work, we show that all GB microstates can be uniquely characterized by their value of t ws , which is located within the Wigner–Seitz (WS) cell of the Displacement-Shift-Complete lattice (DSCL) of the GB. The GB translation vector captures information about both the translation state and the number of GB atoms. We show that the density of GB microstates inside the WS cell of the DSCL is not uniform and can form clusters that correspond to different GB phases. Further, the vectors connecting the centers of the clusters correspond to the Burgers vectors of GB phase junctions, which can be predicted without building the junctions. Using t ws , we quantify GB excess shear and argue that it is defined up to a DSCL vector, which has implications for thermodynamic equilibrium conditions. Additionally, this work generalizes the definition of the number of GB atoms [n] to asymmetric boundaries.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Temperature and dose effects on dislocation loops in self-ion irradiated high-purity iron

Body-centered cubic (BCC) Fe-based alloys are promising candidate materials for advanced nuclear reactors. However, a detailed understanding of irradiation induced dislocation loop microstructure development remains unresolved. It is a widespread belief that 〈001〉 loops become increasingly favorable over ½〈111〉 loops as irradiation temperature rises above ∼300 C. Unfortunately, the temperature effects on 〈001〉 loop have been primarily examined in in-situ irradiation on TEM thin foils but poorly explored on bulk Fe due to exceedingly limited experimental studies on bulk specimens, raising concerns about the potential influence of TEM thin foil artifacts on observed results. Here, in this study, we conducted experiments on ultra-high purity BCC Fe specimens irradiated with 6.7–8 MeV Fe ions over a wide temperature range on bulk samples. We investigated the effects of temperature (T irr = 250–500 °C), dose rate (10⁻⁵ to 10⁻³ dpa/s), and dose (0.35 to 3.5 dpa) on the formation and evolution of 〈001〉 and ½〈111〉 loops as well as cavity (void) formation. Post-irradiation Burgers vector analysis via g•b method on dislocation segments and loops revealed that 〈001〉 loop fraction does not show a monotonic positive correlation with irradiation temperature. Combined with previous and current theoretical as well as experimental findings, we explore the temperature effects on all existing models of 〈001〉 loop formation. We conclude that the prevailing reports regarding the dominance of 〈001〉 loops in Fe at elevated temperatures are mainly attributable to the loss of glissile ½〈111〉 clusters in TEM thin foil experiments.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Nucleation rate controlled grain boundary and lattice creep

Nucleation versus diffusion rate-limited bicrystal and single crystal creep exhibit different scaling dependencies that enable the mechanisms to be isolated when measured as a function of sample size. It has recently been suggested that nucleation rate-limited kinetic models generally describe the non-Newtonian portion of the creep response well, but more direct evidence is required. This work analyzes the grain boundary creep response of UO 2 , a pyrochlore high entropy oxide, silver, and palladium, along with the lattice creep of silver using small-scale in situ loading in the transmission electron microscope. At small sizes, each system exhibits scale dependence associated with nucleation rate-limited kinetics. Fits of the data produce activation volumes on the order of a few Burgers vectors cubed with positive temperature coefficients as expected for nucleation kinetics. The activation enthalpies fall in the range of about 0.4 eV to 1.7 eV, being lower for the metals and higher for the oxides.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Temperature and dose rate effects on dislocation loop formation and decoration in self-ion irradiated high-purity Fe-Cr model alloys

Body-centered cubic (BCC) Fe-based alloys are promising candidate materials for advanced nuclear reactors. A widespread perception is that the addition of Cr favors the formation of ½ <111> dislocation loops. However, the Cr effects on dislocation loop formation/evolution remain unclear due to the limited experimental studies. In this study, we irradiate ultra-high purity bulk BCC Fe-xCr (x = 3, 5, and 8 wt%) with 6.7-8 MeV Fe ions over a wide range of temperatures (Tirr = 250-500 °C) and dose rates (10⁻⁵ to 10⁻³ dpa/s) to two midrange doses (0.35 and 3.5 dpa). The major irradiation-induced microstructures are loop decoration along non-screw dislocation lines at low temperatures and high dose rates as well as self-assembled loops at elevated temperatures. Post-irradiation Burgers vector analysis via g•b method on loops and electron tomography reveals that <001> preponderance is observable in all irradiated Fe-Cr samples at elevated temperature, resulting from stronger elastic energy originating from <001> edge.

Li, Yao [University of Tennessee (UT)]↗
DOE OSTI2021

Solidification texture, variant selection, and phase fraction in a spot-melt electron-beam powder bed fusion processed Ti-6Al-4V

The effect of a spot melt strategy on the solidification texture, variant selection, phase fraction, and their variations along the build height was investigated in comparison to a conventional linear melt strategy. Ti-6Al-4V alloy samples were manufactured by an electron-beam powder bed fusion process using two different melt strategies and characterized using high-energy synchrotron x-ray diffraction. The linear and spot melt cases resulted in β<100> cube and fiber textures, respectively, with the cube/fiber axis nearly parallel to the build direction. The α phase exhibited Burgers orientation relationship (BOR) with the parent β phase for both melt strategies. Although all of the key texture components and the BOR between the α and β phases were consistently observed in both cases along the build height, there were several measurable differences between the two. At the top of the build height, the β<100> build texture intensity was stronger in the linear case. However, the texture intensity in the linear case decreased gradually from the top to near the substrate, whereas the spot melt case did not show this trend. Moreover, the BOR was examined along the build height and the results showed that there is a distinct variant selection in the spot melt case, unlike the linear case. Specifically, the planar variants sharing ($\bar101$) β || (0002) α with [$\bar2\bar2\bar2$]β and [$2\bar22$]β were the most prominent in the spot melt, but no preference was identified in the directional variants. The β phase fraction was slightly lower in the spot melt case compared to the linear case. In both the cases, the β phase fraction decreased moving towards the substrate but remained significantly higher than that of the powder feedstock. Overall, the novel spot melt strategy produced a more homogeneous microstructure in terms of both the phase fraction and texture across the build height.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Forward sensitivity analysis and mode dependent control for closure modeling of Galerkin systems

Model reduction by projection-based approaches is often associated with losing some of the important features that contribute towards the dynamics of the retained scales. As a result, a mismatch occurs between the predicted trajectories of the original system and the truncated one. We put forth a framework to apply a continuous time control signal in the latent space of the reduced order model (ROM) to account for the effect of truncation. We set the control input using parameterized models by following energy transfer principles. Our methodology relies on observing the system behavior in the physical space and using the projection operator to restrict the feedback signal into the latent space. Then, we leverage the forward sensitivity method (FSM) to derive relationships between the feedback and the desired mode-dependent control. We test the performance of the proposed approach using two test cases, corresponding to viscous Burgers and vortex merger problems at high Reynolds number. Results show that the ROM trajectory with the applied FSM control closely matches its target values in both the data-dense and data-sparse regimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PPINN: Parareal physics-informed neural network for time-dependent PDEs

Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time–space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speed-up for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion–reaction equation. Furthermore, our results demonstrate that PPINNs converge in a few iterations with significant speed-ups proportional to the number of time-subdomains employed.

42 ENGINEERING↗
DOE OSTI2020

Data-driven variational multiscale reduced order models

We propose a new data-driven reduced order model (ROM) framework that centers around the hierarchical structure of the variational multiscale (VMS) methodology and utilizes data to increase the ROM accuracy at a modest computational cost. The VMS methodology is a natural fit for the hierarchical structure of the ROM basis: In the first step, we use the ROM projection to separate the scales into three categories: (i) resolved large scales, (ii) resolved small scales, and (iii) unresolved scales. In the second step, we explicitly identify the VMS–ROM closure terms, i.e., the terms representing the interactions among the three types of scales. In the third step, we use available data to model the VMS–ROM closure terms. Thus, instead of phenomenological models used in VMS for standard numerical discretizations (e.g., eddy viscosity models), we utilize available data to construct new structural VMS–ROM closure models. Specifically, we build ROM operators (vectors, matrices, and tensors) that are closest to the true ROM closure terms evaluated with the available data. We test the new data-driven VMS–ROM in the numerical simulation of four test cases: (i) the 1D Burgers equation with viscosity coefficient v = 10 -3 ; (ii) a 2D flow past a circular cylinder at Reynolds numbers, Re = 100, Re = 500, and Re= 1000; (iii) the quasi-geostrophic equations at Reynolds number Re = 450 and Rossby number Ro = 0.0036; and (iv) a 2D flow over a backward facing step at Reynolds number Re = 1000. The numerical results show that the data-driven VMS–ROM is significantly more accurate than standard ROMs.

42 ENGINEERING↗
DOE OSTI2022

LaSDI: Parametric Latent Space Dynamics Identification

Enabling fast and accurate physical simulations with data has become an important area of computational physics to aid in inverse problems, design-optimization, uncertainty quantification, and other various decision-making applications. This paper presents a data-driven framework for parametric latent space dynamics identification procedure that enables fast and accurate simulations. The parametric model is achieved by building a set of local latent space model and designing an interaction among them. An individual local latent space dynamics model achieves accurate solution in a trust region. By letting the set of trust region to cover the whole parameter space, our model shows an increase in accuracy with an increase in training data. Herein we introduce two different types of interaction mechanisms, i.e., point-wise and region-based approach. Both linear and nonlinear data compression techniques are used. We illustrate the framework of Latent Space Dynamics Identification (LaSDI) enable a fast and accurate solution process on various partial differential equations, i.e., Burgers’ equations, radial advection problem, and nonlinear heat conduction problem, achieving 0 (100)x speed-up and 0 (1)% relative error with respect to the corresponding full order models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A multifidelity deep operator network approach to closure for multiscale systems

Projection-based reduced order models (PROMs) have shown promise in representing the behavior of multiscale systems using a small set of generalized (or latent) variables. Despite their success, PROMs can be susceptible to inaccuracies, even instabilities, due to the improper accounting of the interaction between the resolved and unresolved scales of the multiscale system (known as the closure problem). In the current work, we interpret closure as a multifidelity problem and use a multifidelity deep operator network (DeepONet) framework to address it. In addition, to enhance the stability and/or accuracy of the multifidelity-based closure, we employ the recently developed ``in-the-loop" training approach from the literature on coupling physics and machine learning models. The resulting approach is tested on shock advection for the one-dimensional viscous Burgers equation and vortex merging for the two-dimensional Navier-Stokes equations. Furthermore, the numerical experiments show significant improvement of the predictive ability of the closure-corrected PROM over the un-corrected one both in the interpolative and the extrapolative regimes.

42 ENGINEERING↗
DOE OSTI2023

$\text{GPLaSDI}$: Gaussian Process-based interpretable Latent Space Dynamics Identification through deep autoencoder

Numerically solving partial differential equations (PDEs) can be challenging and computationally expensive. This has led to the development of reduced-order models (ROMs) that are accurate but faster than full order models (FOMs). Recently, machine learning advances have enabled the creation of non-linear projection methods, such as Latent Space Dynamics Identification (LaSDI). LaSDI maps full-order PDE solutions to a latent space using autoencoders and learns the system of ODEs governing the latent space dynamics. By interpolating and solving the ODE system in the reduced latent space, fast and accurate ROM predictions can be made by feeding the predicted latent space dynamics into the decoder. In this paper, we introduce GPLaSDI, a novel LaSDI-based framework that relies on Gaussian process (GP) for latent space ODE interpolations. Using GPs offers two significant advantages. First, it enables the quantification of uncertainty over the ROM predictions. Second, leveraging this prediction uncertainty allows for efficient adaptive training through a greedy selection of additional training data points. This approach does not require prior knowledge of the underlying PDEs. Consequently, GPLaSDI is inherently non-intrusive and can be applied to problems without a known PDE or its residual. Here we demonstrate the effectiveness of our approach on the Burgers equation, Vlasov equation for plasma physics, and a rising thermal bubble problem. Our proposed method achieves between 200 and 100,000 times speed-up, with up to 7% relative error.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗
DOE OSTI2025

Nonintrusive projection-based reduced order modeling using stable learned differential operators

Nonintrusive projection-based reduced order models (ROMs) are essential for dynamics prediction in multi-query applications where underlying governing equations are known but the access to the source of the underlying full order model (FOM) is unavailable; that is, FOM is a glass-box. This article proposes a learn-then-project approach for nonintrusive model reduction. In the first step of this approach, high-dimensional stable sparse learned differential operators (S-LDOs) are determined using the generated data. In the second step, the ordinary differential equations, comprising these S-LDOs, are used with suitable dimensionality reduction and low-dimensional subspace projection methods to provide equations for the evolution of reduced states. This approach allows easy integration into the existing intrusive ROM framework to enable nonintrusive model reduction while allowing the use of Petrov–Galerkin projections. The applicability of the proposed approach is demonstrated for Galerkin and LSPG projection-based ROMs through four numerical experiments: 1-D scalar advection, 1-D Burgers, 2-D scalar advection and 1-D scalar advection–diffusion–reaction equations. In conclusion, the results indicate that the proposed nonintrusive ROM strategy provides accurate and stable dynamics prediction.

42 ENGINEERING↗
DOE OSTI2025

Non-intrusive reduced-order modeling for dynamical systems with spatially localized features

This work presents a non-intrusive reduced-order modeling framework for dynamical systems with spatially localized features characterized by slow singular value decay. The proposed approach builds upon two existing methodologies for reduced and full-order non-intrusive modeling, namely Operator Inference (OpInf) and sparse Full-Order Model (sFOM) inference. We decompose the domain into two complementary subdomains that exhibit fast and slow singular value decay. The dynamics of the subdomain exhibiting slow singular value decay are learned with sFOM while the dynamics with intrinsically low dimensionality on the complementary subdomain are learned with OpInf. The resulting, coupled OpInf-sFOM formulation leverages the computational efficiency of OpInf and the high resolution of sFOM, and thus enables fast non-intrusive predictions for conditions beyond those sampled in the training data set. A novel regularization technique with a closed-form solution based on the Gershgorin disk theorem is introduced to promote stable sFOM and OpInf models. We also provide a data-driven indicator for subdomain selection and ensure solution smoothness over the interface via a post-processing interpolation step. We evaluate the efficiency of the approach in terms of offline and online speedup through a quantitative, parametric computational cost analysis. We demonstrate the coupled OpInf-sFOM formulation for two test cases: a one-dimensional Burgers’ model for which accurate predictions beyond the span of the training snapshots are presented, and a two-dimensional parametric model for the Pine Island Glacier ice thickness dynamics, for which the OpInf-sFOM model achieves an average prediction error on the order of 1% with an online speedup factor of approximately 8$\times$ compared to the numerical simulation.

42 ENGINEERING↗
DOE OSTI2025

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

ECCI analysis of shear accommodations at grain boundaries in commercially pure alpha titanium

This study uses a novel approach that couples electron channeling contrast imaging (ECCI) with controlled removal of surface material to investigate the slip system/grain boundary interactions by assessing the geometry of slip planes and grain boundaries as a function of depth. The comparison of spacing, relative distributions, and correlations of slip bands across grain boundaries reveals surface biasing on the slip band behavior in the grain boundary region. Furthermore, using analysis of the compatibility factor m’, the Schmid factor of each slip system, and the angles θ between slip planes, a more comprehensive understanding of the details of the mechanisms of strain transfer and heterogeneous deformation is developed. In general, the misalignment of primary slip systems on the grain boundary planes necessitates the activation of secondary accommodating slip systems close to the grain boundary area that are better aligned (higher m’ and lower θ) with respect to the incoming slip system across the grain boundary. Such systems have the same Burgers vector as the primary slip systems within the respective grains, but are typically on low mobility slip planes.

59 BASIC BIOLOGICAL SCIENCES↗