Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical differentiation”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

A sensitivity equation approach to shape optimization in fluid flows

A sensitivity equation method to shape optimization problems is applied. An algorithm is developed and tested on a problem of designing optimal forebody simulators for a 2D, inviscid supersonic flow. The algorithm uses a BFGS/Trust Region optimization scheme with sensitivities computed by numerically approximating the linear partial differential equations that determine the flow sensitivities. Numerical examples are presented to illustrate the method.

Borggaard, Jeff↗
DOE OSTI2023

Temporal Subsampling Diminishes Small Spatial Scales in Recurrent Neural Network Emulators of Geophysical Turbulence

The immense computational cost of traditional numerical weather and climate models has sparked the development of machine learning (ML) based emulators. Because ML methods benefit from long records of training data, it is common to use data sets that are temporally subsampled relative to the time steps required for the numerical integration of differential equations. Here, we investigate how this often overlooked processing step affects the quality of an emulator's predictions. We implement two ML architectures from a class of methods called reservoir computing: (a) a form of Nonlinear Vector Autoregression (NVAR), and (b) an Echo State Network (ESN). Despite their simplicity, it is well documented that these architectures excel at predicting low dimensional chaotic dynamics. We are therefore motivated to test these architectures in an idealized setting of predicting high dimensional geophysical turbulence as represented by Surface Quasi-Geostrophic dynamics. In all cases, subsampling the training data consistently leads to an increased bias at small spatial scales that resembles numerical diffusion. Interestingly, the NVAR architecture becomes unstable when the temporal resolution is increased, indicating that the polynomial based interactions are insufficient at capturing the detailed nonlinearities of the turbulent flow. The ESN architecture is found to be more robust, suggesting a benefit to the more expensive but more general structure. Spectral errors are reduced by including a penalty on the kinetic energy density spectrum during training, although the subsampling related errors persist. Future work is warranted to understand how the temporal resolution of training data affects other ML architectures.

58 GEOSCIENCES↗
DOE OSTI2020

Understanding machine learning approaches for partial differential equations

Recent works in computational physics have been successful in the super-resolution of numerical solutions of partial differential equations (PDEs) via neural networks. In this paper we explore the possibilities and limitations of the data-driven discretization approach implemented by Bar-Sinai et. al., while contrasting it with a simpler yet weaker approach utilizing the nangs Python library. The results demonstrate what neural network parameters optimize accuracy and performance, as well as what conditions on PDEs are necessary to maintain convergence.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Nozzle flow with vibrational nonequilibrium

This research concerns the modeling and numerical solutions of the coupled system of compressible Navier-Stokes equations in cylindrical coordinates under conditions of equilibrium and nonequilibrium thermodynamics. The problem considered was the modeling of a high temperature diatomic gas N2 flowing through a converging-diverging high expansion nozzle. The problem was modeled in two ways. The first model uses a single temperature with variable specific heats as functions of this temperature. For the second model we assume that the various degrees of freedom all have a Boltzmann distribution and that there is a continuous redistribution of energy among the various degrees of freedom as the gas passes through the nozzle. Each degree of freedom is assumed to have its own temperature and, consequently, each system state can be characterized by these temperatures. This suggests that formulation of a second model with a vibrational degree of freedom along with a rotational-translation degree of freedom, each degree of freedom having its own temperature. Initially the vibrational degree of freedom is excited by heating the gas to a high temperature. As the high temperature gas passes through the nozzle throat there is a sudden drop in temperature along with a relaxation time for the vibrational degree of freedom to achieve equilibrium with the rotational-translation degree of freedom. That is, we assume that the temperature change upon passing through the throat is so great that the changes in the vibrational degree of freedom occur at a much slower pace and consequently lags behind the rotational-translational energy changes. This lag results in a finite relaxation time. In this context the term nonequilibrium is used to denote the fact that the energy content of the various degrees of freedom are characterized by two temperatures. We neglect any chemical reactions which could also add nonequilibrium effects. We develop the energy equations for the nonequilibrium model from first principles. The resulting equations, which model the nozzle flow, can be expressed in various forms. In most forms the resulting equations are coupled systems of nonlinear partial differential equations subject to certain boundary conditions. To solve the resulting coupled system of nonlinear partial differential equations, several numerical techniques were investigated: (1) the explicit MacCormack method, (2) the explicit-implicit MacCormack method, (3) the method of operator splitting, (4) factorization schemes, and (5) the Steger-Warming scheme.

Heinbockel, J. H.↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2025

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗
DOE OSTI2022

Temperature distribution in a laser-heated diamond anvil cell as described by finite element analysis

Finite element analysis (FEA) is a powerful tool for numerically solving partial differential equations over complex geometries and is thus useful for analyzing heat transport in laser-heated diamond anvil cell (LHDAC) experiments. Our models expand on previously published simulations by calculating the volume-averaged temperatures of both the sample and insulation/pressure media under steady-state heating to determine the thermal pressure of the hot sample. Our goal is to produce an accurate relationship between the measured surface temperature of the absorbing sample and the temperature of the transparent insulating media, which is used to determine thermal pressure but susceptible to steep temperature gradients. We find that in doing so, our FEA models of temperature within the pressure/insulation media can differ from simplified estimates of temperature gradients by more than a factor of 2. We also explore temperature-dependent and temperature-independent thermal conductivity models and find that the volume-averaged temperatures differ by up to a factor of 1.3, forcing the predicted thermal pressures determined to also differ by up to a factor of 1.5 at a temperature of 2000 K at 50 GPa for neon. Higher temperatures exacerbate this difference. We also find that unintentional asymmetric sample insertion and sample heating, which are common in LHDAC experiments, do not have a first-order effect on volume-averaged temperatures. The FEA models, available in both Python and FlexPDE, are versatile across different sample geometries, materials, and heat source laser shapes.

Farah, Frederick↗
DOE OSTI2025

Mass-Energy Compensation Effect of 3$\alpha$ Hamiltonian

The 3α phenomenological model describes the structure of the carbon-12 nucleus as a cluster of three alpha particles. This model includes a pairwise α–α interaction and a three-body force. To fit the three-body potential, the 12 C data are used, while ensuring that the pair potential reproduces the α–α scattering data. Alternatively, the mass-energy compensation (MEC) effect can be used to simulate the effect of the three-body potential by adjusting the mass of the α particle within the effective-mass approach. We demonstrate the MEC effect for the 3α ground state by numerically solving the differential Faddeev equation, in which the α–α interaction is described by the Ali-Bodmer potential. The effective masses of α particles are evaluated for the ground and excited 0 + and bound 2 + states. Here, we demonstrate a coupling between the ground and first excited 0 + states, indicated by an anti-crossing of these energy levels in the energy–mass coordinates. A correspondence between the effective mass and a three-body potential is demonstrated. We discuss the results of the 0$^{+}_{2}$ calculations for various models of the α–α interaction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Accelerating FEM-Based Corrosion Predictions Using Machine Learning

Atmospheric corrosion of metallic parts is a widespread materials degradation phenomena that is challenging to predict given its dependence on many factors (e.g. environmental, physiochemical, and part geometry). For materials with long expected service lives, accurately predicting the degree to which corrosion will degrade part performance is especially difficult due to the stochastic nature of corrosion damage spread across years or decades of service. The Finite Element Method (FEM) is a computational technique capable of providing accurate estimates of corrosion rate by numerically solving complex differential Eqs. characterizing this phenomena. Nevertheless, given the iterative nature of FEM and the computational expense required to solve these complex equations, FEM is ill-equipped for an efficient exploration of the design space to identify factors that accelerate or deter corrosion, despite its accuracy. In this work, a machine learning based surrogate model capable of providing accurate predictions of corrosion with significant computational savings is introduced. Specifically, this work leverages AdaBoosted Decision trees to provide an accurate estimate of corrosion current per width given different values of temperature, water layer thickness, molarity of the solution, and the length of the cathode for a galvanic couple of aluminum and stainless steel.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Regression Based Approach for Robust Finite Element Analysis on Arbitrary Grids. LDRD Final Report

This report summarizes the work performed under a one-year LDRD project aiming to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. In this project, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality. At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5x improvement in accuracy and allows for taking an 8x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method. The report concludes with a brief summary of ongoing projects and collaborations that utilize or extend the products of this work.

97 MATHEMATICS AND COMPUTING↗