Search NASA⌕ Search

SEARCH · Search NASA

Results for “Proving”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Dilute Pd-in-Au alloy RCT-SiO 2 catalysts for enhanced oxidative methanol coupling

Dilute alloy catalysts have the potential to enhance selectivity and activity for large-scale reactions. Highly dilute Pd-in-Au nanoparticle alloys partially embedded in porous silica (“raspberry colloid templated” (RCT)-SiO 2 ) prove to be robust and selective catalysts for oxidative coupling of methanol. Palladium concentrations in the bimetallic nanoparticles as low as ~3.4 at.% catalyze the production of methyl formate with a selectivity of ~95% at conversions of ~55%, whereas conversions are low (<10%) for ~1.7 at.% Pd-in-Au nanoparticle and pure Au nanoparticle catalysts. Fractional reaction orders for both CH 3 OH and O 2 measured for ~3.4 at.% Pd-in-Au nanoparticles supported on RCT-SiO 2 indicated a complex mechanism in which the sites for O 2 dissociation are not saturated. Optimal methyl formate production was found for an equimolar mixture. There is no conversion of methanol in the absence of O 2 between 360 and 450 K. Finally, all observations are consistent with a mechanism derived from model studies, requiring that clusters of Pd be available on the catalyst for O 2 dissociation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Identification and evolution of active sites in isomorphously substituted Fe-ZSM-5 catalysts for methane dehydroaromatization (MDA)

Methane dehydroaromatization (MDA) enables the catalytic conversion of methane into aromatics, mainly benzene, along with hydrogen, in a single-step process under non-oxidative conditions. In this study, we prepared a series of isomorphously substituted Fe-ZSM-5 catalysts with exclusively isolated or low-oligomerized sites up to 3.2% Fe weight loading by adding ethylenediaminetetraacetic acid (EDTA) to the crystallization gel. These catalysts exhibit no induction/activation period and a significantly higher maximum product yield compared to Fe/ZSM-5 catalysts prepared by the incipient wetness impregnation method and containing extensively aggregated FeOx. This investigation focuses on the evolution of Fe sites during the post-synthetic treatments. Most importantly, we demonstrate the quantitative relation between Fe site isolation and catalytic activity, proving that isolated or low-oligomerized Fe species at the exchange sites formed during post-synthetic retreatment are the active sites for methane activation.

02 PETROLEUM↗
DOE OSTI2023

Amorphous 1-D nanowires of calcium phosphate/pyrophosphate: A demonstration of oriented self-growth of amorphous minerals

Amorphous inorganic solids are traditionally isotropic, thus, it is believed that they only grow in a non-preferential way without the assistance of regulators, leading to the morphologies of nanospheres or irregular aggregates of nanoparticles. However, in the presence of (ortho)phosphate (Pi) and pyrophosphate ions (PPi) which have synergistic roles in biomineralization, the highly elongated amorphous nanowires (denoted ACPPNs) form in a regulator-free aqueous solution (without templates, additives, organics, etc). Based on thorough characterization and tracking of the formation process (e.g., Cryo-TEM, spherical aberration correction high resolution TEM, solid state NMR, high energy resolution monochromated STEM-EELS), the microstructure and its preferential growth behavior are elucidated. In ACPPNs, amorphous calcium orthophosphate and amorphous calcium pyrophosphate are distributed at separated but close sites. The ACPPNs grow via either the preferential attachment of ~2 nm nanoclusters in a 1-dimension way, or the transformation of bigger nanoparticles, indicating an inherent driving force-governed process. Here, we propose that the anisotropy of ACPPNs microstructure, which is corroborated experimentally, causes their oriented growth. This study proves that, unlike the conventional view, amorphous minerals can form via oriented growth without external regulation, demonstrating a novel insight into the structures and growth behaviors of amorphous minerals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗
DOE OSTI2020

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Maximum bound principle preserving integrating factor Runge–Kutta methods for semilinear parabolic equations

A large class of semilinear parabolic equations satisfy the maximum bound principle (MBP) in the sense that the time-dependent solution preserves for any time a uniform pointwise bound imposed by its initial and boundary conditions. Here, the MBP plays a crucial role in understanding the physical meaning and the well-posedness of the mathematical model. Investigation on numerical algorithms with preservation of the MBP has attracted increasingly attentions in recent years, especially for the temporal discretizations, since the violation of MBP may lead to nonphysical solutions or even blow-ups of the algorithms. In this paper, we study high-order MBP-preserving time integration schemes by means of the integrating factor Runge-Kutta (IFRK) method. Beginning with the space-discrete system of semilinear parabolic equations, we present the IFRK method in general form and derive the sufficient conditions for the method to preserve the MBP. In particular, we show that the classic four-stage, fourth-order IFRK scheme is MBP preserving for some typical semilinear systems although not strong stability preserving, which can be instantly applied to the Allen-Cahn type of equations. To our best knowledge, this is the first time to present a fourth-order linear numerical method preserving the MBP. In addition, convergence of these numerical schemes is proved theoretically and verified numerically, as well as their efficiency by simulations of 2D and 3D long-time evolutional behaviors. Numerical experiments are also carried out for a model which is not a typical gradient flow as the Allen-Cahn type of equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A short note on the accuracy of the discontinuous Galerkin method with reentrant faces

In this work, we study the convergence of the discontinuous Galerkin (DG) method applied to the advection–reaction equation on meshes with reentrant faces. On such meshes, the upwind numerical flux is not smooth, and so the numerical integration of the resulting face terms can only be expected to be first-order accurate. Despite this inexact integration, we prove that the DG method converges with order $\mathscr{O}$(h p+1/2 ), which is the same rate as in the case of exact integration. Consequently, specialized quadrature rules that accurately integrate the non-smooth numerical fluxes are not required for high-order accuracy. These results are numerically corroborated on examples of linear advection and discrete ordinates transport equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A deterministic verification strategy for electrostatic particle-in-cell algorithms in arbitrary spatial dimensions using the method of manufactured solutions

As simulations of kinetic plasmas continue to increase in scope and complexity, a rigorous and straightforward method for verifying particle-in-cell (PIC) implementations is necessary to ensure their correctness. Here, in this paper, we present a deterministic method for the rigorous verification of multidimensional, multispecies, electrostatic particle-in-cell codes based on the method of manufactured solutions. Specifically, we prove that rigorous verification is possible through the exclusive examination of errors of grid quantities (i.e., moments and/or fields), allowing for a very light-weight and non-intrusive implementation in existing PIC codes. This is a marked improvement over earlier PIC verification approaches (only demonstrated with one species in 1D-1V), which rely on the comparison of cumulative distribution functions, and are invasive on the code base, introduce additional stochastic noise, are significantly more computationally expensive, and lack rigorous convergence properties. Interestingly, we show that different grid quantities feature different rates of convergence with the number of particles and mesh size, impacting the verification process. These theoretical results are confirmed numerically with a multi-species 2D-2V particle-in-cell code, including the ability of the method to detect order reduction due to an incorrect implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

An explicitly solvable energy-conserving algorithm for pitch-angle scattering in magnetized plasmas

In this work, we develop an Explicitly Solvable Energy-Conserving (ESEC) algorithm for the Stochastic Differential Equation (SDE) describing the pitch-angle scattering process in magnetized plasmas. The Cayley transform is used to calculate both the deterministic gyromotion and stochastic scattering, affording the algorithm to be explicitly solvable and exactly energy conserving. An unusual property of the SDE for pitch-angle scattering is that its coefficients diverge at the zero velocity and do not satisfy the global Lipschitz condition. Consequently, when standard numerical methods, such as the Euler-Maruyama (EM), are applied, numerical convergence is difficult to establish. For the proposed ESEC algorithm, its energy-preserving property enables us to overcome this obstacle. We rigorously prove that the ESEC algorithm is order 1/2 strongly convergent. This result is confirmed by detailed numerical studies. For the case of pitch-angle scattering in a magnetized plasma with a constant magnetic field, the numerical solution is benchmarked against the analytical solution, and excellent agreements are found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Dynamic calibration of differential equations using machine learning, with application to turbulence models

We present a methodology for calibration of parametric ordinary and partial differential equation models, using off-the-shelf software for back-propagation in Neural Networks (NN). As a prototypical example, we consider calibration of a Reynolds-averaged Navier-Stokes (RANS) turbulence closure model, against ground truth data from direct numerical simulations (DNS) of two different turbulent flows. Numerical time integration is represented as a custom NN, where only the RANS model parameters are trainable. A loss function is defined to quantify the mismatch between the NN prediction and the ground truth over a predefined, finite time integration window. This loss function is then minimized using a gradient descent method utilizing the back-propagation algorithm. Furthermore, this dynamic approach to training is to be contrasted with a static approach, wherein a least square regression estimate for parameters is obtained in the limit of an infinitesimal time integration window. In a first test of static and dynamic approaches against ground truth data generated by the model, the former proves to be significantly faster and more accurate than the latter at recovering the parameters. When both calibration approaches are tested against DNS data, for which it is known that the model cannot achieve a perfect fit, the static approach yields a good prediction only for short times, while the dynamic approach results in physical and stable predictions over the entire integration window. After optimization of the dynamic approach for time step, spatial resolution, stability, and physics-based constraints, we obtain a 50% improvement of outcomes over those obtained from the existing, manually calibrated set of parameters, demonstrating the merits of this systematic and automated procedure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Constraint energy minimizing generalized multiscale finite element method for multi-continuum Richards equations

In fluid flow simulation, the multi-continuum model is a useful strategy. When the heterogeneity and contrast of coefficients are high, the system becomes multiscale, and some kinds of reduced order methods are demanded. Combining these techniques with nonlinearity, we will consider in this paper a dual-continuum model which is generalized as a multi-continuum model for a coupled system of nonlinear Richards equations as unsaturated flows, in complex heterogeneous fractured porous media; and we will solve it by a novel multiscale approach utilizing the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM). In particular, such a nonlinear system will be discretized in time and then linearized by Picard iteration (whose global convergence is proved theoretically). Subsequently, we tackle the resulting linearized equations by the CEM-GMsFEM and obtain proper offline multiscale basis functions to span the multiscale space (which contains the pressure solution). More specifically, we first introduce two new sources of samples, and the GMsFEM is used over each coarse block to build local auxiliary multiscale basis functions via solving local spectral problems, that are crucial for detecting high-contrast channels. Second, per oversampled coarse region, local multiscale basis functions are created through the CEM as constrainedly minimizing an energy functional. Various numerical tests for our approach reveal that the error converges with the coarse-grid size and that only few oversampling layers as well as basis functions are needed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Implicit-explicit Runge-Kutta for radiation hydrodynamics I: Gray diffusion

Radiation hydrodynamics are a challenging multiscale and multiphysics set of equations. To capture the relevant physics of interest, one typically must time step on the hydrodynamics timescale, making explicit integration the obvious choice. On the other hand, the coupled radiation equations have a scaling such that implicit integration is effectively necessary in non-relativistic regimes. A first-order Lie-Trotter-like operator split is the most common time integration scheme used in practice, alternating between an explicit hydrodynamics step and an implicit radiation solve and energy deposition step. However, such a scheme is limited to first-order accuracy, and nonlinear coupling between the radiation and hydrodynamics equations makes a more general additive partitioning of the equations non-trivial. Here, we develop a new formulation and partitioning of radiation hydrodynamics with gray diffusion that allows us to apply (linearly) implicit-explicit Runge-Kutta time integration schemes. In conclusion, we prove conservation of total energy in the new framework, and demonstrate 2nd-order convergence in time on multiple radiative shock problems, achieving error 3–5 orders of magnitude smaller than the first-order Lie-Trotter operator split at the hydrodynamic CFL, even when Lie-Trotter applies a 3rd-order TVD Runge-Kutta scheme to the hydrodynamics equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗
DOE OSTI2025

Local conservation of energy in fully implicit PIC algorithms

We consider the issue of strict, fully discrete local energy conservation for a whole class of fully implicit local-charge- and global-energy-conserving particle-in-cell (PIC) algorithms. Earlier studies demonstrated these algorithms feature strict global energy conservation. However, whether a local energy conservation theorem exists (in which the local energy update is governed by a flux balance equation at every mesh cell) for these schemes is unclear. In this study, we show that a local energy conservation theorem indeed exists. We begin our analysis with the 1D electrostatic PIC model without orbit-averaging, and then generalize our conclusions to account for orbit averaging, multiple dimensions, and electromagnetic models (Darwin). In all cases, a temporally, spatially, and particle-discrete local energy conservation theorem is shown to exist, proving that these formulations (as originally proposed in the literature), in addition to being locally charge conserving and globally energy conserving, are strictly locally energy conserving as well. In contrast to earlier proofs of local conservation in the literature, which only considered continuum time, our result is valid for the fully implicit time-discrete version of all models considered, including important features such as orbit averaging. We demonstrate the local-energy-conservation property numerically with a paradigmatic numerical example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A variational mimetic finite difference method for elliptic interface problems on non-matching polytopal meshes with geometric interface inconsistencies

A new variational mimetic finite difference method for elliptic interface problems with perfect and imperfect thermal contacts on non-matching polytopal meshes with geometric interface inconsistencies is developed and analyzed theoretically and numerically. The method is defined on multiple non-matching submeshes with gaps and overlaps along their interfaces. The discrete equations are derived from a minimization problem for the augmented Dirichlet functional. For a perfect thermal contact, the functional uses a modified mimetic gradient with extended stencil which couples unknowns from both sides of an interface, as well as penalty terms to enforce weak continuity of temperature across the interface. The method leads to a symmetric positive definite matrix for any scaling of the penalty terms. For an imperfect thermal contact, the Dirichlet functional is supplemented with a quadratic jump term along the interface related to the interface thermal resistance. We prove that the method conserves the total heat flux across each interface. In conclusion, the obtained results are verified with numerical experiments showing convergence in the discrete L 2 and L ∞ norms.

97 MATHEMATICS AND COMPUTING↗