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

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Adaptive Uncertainty Quantification for Stochastic Hyperbolic Conservation Laws

Here, we propose a predictor-corrector adaptive method for the study of hyperbolic partial differential equations (PDEs) under uncertainty. Constructed around the framework of stochastic finite volume (SFV) methods, our approach circumvents sampling schemes or simulation ensembles while also preserving fundamental properties, in particular hyperbolicity of the resulting systems and conservation of the discrete solutions. Furthermore, we augment the existing SFV theory with a priori convergence results for statistical quantities, in particular push-forward densities, which we demonstrate through numerical experiments. By linking refinement indicators to regions of the physical and stochastic spaces, we drive anisotropic refinements of the discretizations, introducing new degrees of freedom where deemed profitable. To illustrate our proposed method, we consider a series of numerical examples for nonlinear hyperbolic PDEs based on Burgers’ and Euler’s equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Latent Space Dynamics Identification

LaSDI is a data-driven physical simulation software that forms a latent space for a given high-fidelity model and discovers a set of ordinary differential equations for the latent space dynamics. It allows a fast and accurate solution process, which is useful for multi-query decision making applications, such as design optimization and uncertainty quantification. The performance of the LaSDI framework is demonstrated on four different problems, i.e., 1D and 2D Burgers equations, nonlinear heat conduction, and radial advection problems. Both linear and nonlinear compression techniques, such as neural network and proper orthogonal decomposition, are used to form a latent space. A concept of local dynamics identification procedure is introduced to enable a parametric model, which enhances the accuracy level over a given parameter space.

Fries, William↗
DOE OSTI2024

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗
DOE OSTI2025

AutoDiffSVDCompression [SWR-25-162]

This software contains the code and results for the paper Reducing Memory Usage of Reverse Mode AD by Compression. In particular, the code includes implementation of the necessary structures and functions for using the Singular Value Decomposition (SVD) to compress forward pass values needed for reverse mode AD as well as the necessary numerical solvers for Burgers’ Equation and numerical solution of a control problem. In addition to the code, the repository also contains the scripts, results, and logs used in the aforementioned publication. This repository is meant to enable the reproducibility of the results in the publication.

Maack, Jonathan [National Renewable Energy Laborat↗
DOE OSTI2022

Sweep-tracing algorithm: in silico slip crystallography and tension-compression asymmetry in BCC metals

Abstract Direct Molecular Dynamics (MD) simulations are being increasingly employed to model dislocation-mediated crystal plasticity with atomic resolution. Thanks to the dislocation extraction algorithm (DXA), dislocation lines can be now accurately detected and positioned in space and their Burgers vector unambiguously identified in silico, while the simulation is being performed. However, DXA extracts static snapshots of dislocation configurations that by themselves present no information on dislocation motion. Referred to as a sweep-tracing algorithm (STA), here we introduce a practical computational method to observe dislocation motion and to accurately quantify its important characteristics such as preferential slip planes (slip crystallography). STA reconnects pairs of successive snapshots extracted by DXA and computes elementary slip facets thus precisely tracing the motion of dislocation segments from one snapshot to the next. As a testbed for our new method, we apply STA to the analysis of dislocation motion in large-scale MD simulations of single crystal plasticity in BCC metals. We observe that, when the crystal is subjected to uniaxial deformation along its [001] axis, dislocation slip predominantly occurs on the {112} maximum resolved shear stress plane under tension, while in compression slip is non-crystallographic (pencil) resulting in asymmetric mechanical response. The marked contrast in the observed slip crystallography is attributed to the twinning/anti-twinning asymmetry of shears in the {112} planes relatively favoring dislocation motion in the twinning sense while hindering dislocations from moving in the anti-twinning directions.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Multi-scale experimental study of creep-fatigue failure initiation in a 709 Stainless Steel alloy using high resolution digital image correlation. Final report

This report discusses the efforts made towards the multi-scale study of the creep-fatigue response of stainless steel 709. Multiple experimental techniques, including digital image correlation (DIC) and electron backscatter diffraction (EBSD), were used in assessing the evolution of damage accumulation during fatigue, creep-fatigue, and thermomechanical fatigue of alloy 709. The role of microstructural features, hold times, temperature, and loading profiles were quantified and the interchangeability of temperature and time was investigated. Finally, a thermomechanical fatigue model was shown to predict well the failure of samples with varying loading profiles. Results indicate that strain accumulation in 709 steel happens primarily near grain boundaries (GBs) with the strains around GBs being inversely proportional to their measured residual burgers vector. Furthermore, hot-spots for strain accumulation were shown to be the locations of eventual microcrack nucleation. The introduction of hold times to the periodic loading cycle increases the damage accumulation rate and thus shortens the fatigue life of samples–this was true for both room temperature and high temperature. Thermomechanical cycling was shown to have little effect on the end life of samples, with the damage accumulation rate for in-phase and out-of-phase cycling being similar to isothermal fatigue. The interchangeability of time and temperature was shown to be possible within the studied load, time, and temperature ranges, since deformation mechanisms driving strain accumulation did not change with temperature (up to 650°C). The Neu-Sehitoglu thermomechanical fatigue model, with constants obtained from the literature and in part from our experimental results, was applied to predict failure of isothermal creep-fatigue samples. The main objectives of this work were to:(a) Perform high-resolution digital image correlation measurements (HiDIC) for alloy 709; (b) Quantify and assess damage accumulation at the microstructure under fatigue, TMF, and creep-fatigue conditions of 709; (c) Study of the role of hold times, i.e., adding a creep component, to: Room temperature cycling, High temperature cycling, Failure; (d) Study the mechanisms of thermomechanical fatigue in this alloy; (e) Investigate the existence of a time-temperature interchangeability criterion to aid in accelerated creep-fatigue testing; (f) Establish the validity of a combined creep-fatigue model for life prediction for 709. This report is structured with each subsequent section detailing the efforts, results, and conclusions related to each of the objectives described, mostly in chronological order.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Theoretical Analysis of Fractional Viscoelastic Flow in Circular Pipes: Parametric Study

Pipe flow is one of the most commonly used models to describe fluid dynamics. The concept of fractional derivative has been recently found very useful and much more accurate in predicting dynamics of viscoelastic fluids compared with classic models. In this paper, we capitalize on our previous study and consider space-time dynamics of flow velocity and stress for fractional Maxwell, Zener, and Burgers models. We demonstrate that the behavior of these quantities becomes much more complex (compared to integer-order classical models) when adjusting fractional order and elastic parameters. We investigate mutual influence of fractional orders and consider their limiting value combinations. Finally, we show that the models developed can be reduced to classical ones when appropriate fractional orders are set.

Gritsenko, Dmitry (ORCID:0000000248181512)↗
DOE OSTI2020

Theoretical Analysis of Fractional Viscoelastic Flow in Circular Pipes: General Solutions

Fractional calculus is a relatively old yet emerging field of mathematics with the widest range of engineering and biomedical applications. Despite being an incredibly powerful tool, it, however, requires promotion in the engineering community. Rheology is undoubtedly one of the fields where fractional calculus has become an integral part of cutting-edge research. There exists extensive literature on the theoretical, experimental, and numerical treatment of various fractional viscoelastic flows in constraint geometries. However, the general theoretical approach that unites several most commonly used models is missing. Here we present exact analytical solutions for fractional viscoelastic flow in a circular pipe. We find velocity profiles and shear stresses for fractional Maxwell, Kelvin–Voigt, Zener, Poynting–Thomson, and Burgers models. The dynamics of these quantities are studied with respect to normalized pipe radius, fractional orders, and elastic moduli ratio. Three different types of behavior are identified: monotonic increase, resonant, and aperiodic oscillations. The models developed are applicable in the widest material range and allow for the alteration of the balance between viscous and elastic properties of the materials.

Gritsenko, Dmitry (ORCID:0000000248181512)↗
DOE OSTI2020

Closure Learning for Nonlinear Model Reduction Using Deep Residual Neural Network

Developing accurate, efficient, and robust closure models is essential in the construction of reduced order models (ROMs) for realistic nonlinear systems, which generally require drastic ROM mode truncations. We propose a deep residual neural network (ResNet) closure learning framework for ROMs of nonlinear systems. The novel ResNet-ROM framework consists of two steps: (i) In the first step, we use ROM projection to filter the given nonlinear system and construct a spatially filtered ROM. This filtered ROM is low-dimensional, but is not closed. (ii) In the second step, we use ResNet to close the filtered ROM, i.e., to model the interaction between the resolved and unresolved ROM modes. We emphasize that in the new ResNet-ROM framework, data is used only to complement classical physical modeling (i.e., only in the closure modeling component), not to completely replace it. We also note that the new ResNet-ROM is built on general ideas of spatial filtering and deep learning and is independent of (restrictive) phenomenological arguments, e.g., of eddy viscosity type. The numerical experiments for the 1D Burgers equation show that the ResNet-ROM is significantly more accurate than the standard projection ROM. The new ResNet-ROM is also more accurate and significantly more efficient than other modern ROM closure models.

Xie, Xuping↗
DOE OSTI2022

Augmented Gaussian random field: Theory and computation

We propose the novel augmented Gaussian random field (AGRF), which is a universal framework incorporating the data of observable and derivatives of any order. Rigorous theory is established. We prove that under certain conditions, the observable and its derivatives of any order are governed by a single Gaussian random field, which is the aforementioned AGRF. As a corollary, the statement "the derivative of a Gaussian process remains a Gaussian process" is validated, since the derivative is represented by a part of the AGRF. Moreover, a computational method corresponding to the universal AGRF framework is constructed. Both noiseless and noisy scenarios are considered. Formulas of the posterior distributions are deduced in a nice closed form. A significant advantage of our computational method is that the universal AGRF framework provides a natural way to incorporate arbitrary order derivatives and deal with missing data. We use four numerical examples to demonstrate the effectiveness of the computational method. The numerical examples are composite function, damped harmonic oscillator, Korteweg-De Vries equation, and Burgers' equation.

Mathematics↗
DOE OSTI2025

Stacked networks improve physics-informed training: Applications to neural networks and deep operator networks

Physics-informed neural networks and operator networks have shown promise for effectively solving equations modeling physical systems. However, these networks can happen to be difficult or impossible to train accurately. Here, we present a novel multifidelity framework for stacking physics-informed neural networks and operator networks that facilitates training. We successively build a chain of networks, where the output at one step can act as a low-fidelity input for training a longer chain, gradually increasing the expressivity of the learnt model. The equations imposed at each step of the iterative process can be the same or different (akin to simulated annealing). The iterative (stacking) nature of the proposed method allows us to learn progressively features of a solution which could have been hard to learn directly. Through benchmark problems including a nonlinear pendulum, the wave equation, and the viscous Burgers equation, we show how stacking can be used to improve the accuracy and reduce the required size of physics-informed neural networks and operator networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗
DOE OSTI2021

Variational Autoencoders for Learning Nonlinear Dynamics of Physical Systems

We develop data-driven methods for incorporating physical information for priors to learn parsimonious representations of nonlinear systems arising from parameterized PDEs and mechanics. Our approach is based on Variational Autoencoders (VAEs) for learning nonlinear state space models from observations. We develop ways to incorporate geometric and topological priors through general manifold latent space representations. We investigate the performance of our methods for learning low dimensional representations for the nonlinear Burgers equation and constrained mechanical systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

GPLaSDI: Gaussian Process Latent Space Dynamics Identification

GPLaSDI is a software that introduces 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 reduced order model (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. 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.

Choi, Youngsoo↗
DOE OSTI2021

Experimental and computational investigations of ethane and ethylene kinetics with copper oxide particles for Chemical Looping Combustion

In this work, reaction pathways for the oxidation of methane, ethane, and ethylene with CuO was obtained by ReaxFF Molecular Dynamics (MD) simulations between temperatures of 1000 K and 2000 K. Experiments in a fixed-bed flow reactor were preformed with methane, ethane, and ethylene at temperatures ranging from 500 K to 1000 K with time-dependent species measurements from an Electron-Ionization Molecular Beam Mass Spectrometer (MBMS), and species validation with Gas Chromatography (GC) for detection of complete and intermediate combustion products. The MBMS and GC allow for the detection of oxygenated species and larger species produced from radical reformation. The simulation and experiment agree on the production of such species as CH 3 CHO, CH 2 O, CO, and H 2 O, which allow for the creation of simple C1 and C2 reaction pathways, which can be used in kinetic models of C2 species and larger fuels such as biofuels, which inherently depend on C1 and C2 kinetics and reaction pathway. The simulation and experiment disagree on the formation of C 2 H 2 , CH 3 OH, and CO 2 with large amounts of C 2 H 2 being measured in the ethylene oxidation simulations and CH 3 OH being formed in methane oxidation simulations, while neither species were experimentally found. In the case of CO 2 large amounts of CO 2 are rapidly produced in experiments with C2 fuels at 800 K, while little-to-no CO 2 was observed in simulations. This is believed to be resulting from the extremely short timescale of the simulations, preventing total oxidation of the fuel. Here, the differences in products produced between simulation and experiment allow for the potential to modify the ReaxFF potential functions to more accurately model the experimental products of Cu–H–O–C reaction kinetics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗