Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic Partial”

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.

26 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Structural Aspects of Neutron Survival Probabilities

The neutron survival probability (and related quantities including probabilities of extinction and initiation) is a central element of the broader stochastic theory of neutron populations and finds application in fields including reactor start-up, analysis of reactor power bursts and criticality accidents, and safeguards. In a full neutron transport formulation, the equation governing the single-neutron survival probability is a backward or adjoint-like integro-partial differential equation with the added complexity of being highly nonlinear. Analogous formulations of this equation exist in the context of many approximate theories of neutron transport, with the point kinetics formulation having received significant theoretical attention since the 1940s. This work continues this tradition by providing a novel analysis of the single-neutron survival probability equation using the tools of boundary layer theory. The analysis reveals that the “fully dynamic” solution of the single-neutron survival probability equation—and some key probability distributions derived from it—may be cast as a singular perturbation around the underlying quasi-static single-neutron probability of initiation. In this perturbation solution, the expansion parameter is the ratio of the neutron generation time to a macroscopic time scale characterizing the overall system evolution; this interpretation illuminates some of the fundamental structural aspects of neutron survival phenomena.

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

Simulating Atmospheric Processes in Earth System Models and Quantifying Uncertainties With Deep Learning Multi‐Member and Stochastic Parameterizations

Abstract Deep learning is a powerful tool to represent subgrid processes in climate models, but many application cases have so far used idealized settings and deterministic approaches. Here, we develop stochastic parameterizations with calibrated uncertainty quantification to learn subgrid convective and turbulent processes and surface radiative fluxes of a superparameterization embedded in an Earth System Model (ESM). We explore three methods to construct stochastic parameterizations: (a) a single Deep Neural Network (DNN) with Monte Carlo Dropout; (b) a multi‐member parameterization; and (c) a Variational Encoder Decoder with latent space perturbation. We show that the multi‐member parameterization improves the representation of convective processes, especially in the planetary boundary layer, compared to individual DNNs. The respective uncertainty quantification illustrates that methods (b) and (c) are advantageous compared to a dropout‐based DNN parameterization regarding the spread of convective processes. Hybrid simulations with our best‐performing multi‐member parameterizations remained challenging and crash within the first days. Therefore, we develop a pragmatic partial coupling strategy relying on the superparameterization for condensate emulation. Partial coupling reduces the computational efficiency of hybrid Earth‐like simulations but enables model stability over 5 months with our multi‐member parameterizations. However, our hybrid simulations exhibit biases in thermodynamic fields and differences in precipitation patterns. Despite this, the multi‐member parameterizations enable improvements in reproducing tropical extreme precipitation compared to a traditional convection parameterization. Despite these challenges, our results indicate the potential of a new generation of multi‐member machine learning parameterizations leveraging uncertainty quantification to improve the representation of stochasticity of subgrid effects.

Behrens, Gunnar [Deutsches Zentrum für Luft‐ und R↗
DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2025

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗
DOE OSTI2026

Is the Matrix Completion of Reduced Density Matrices Unique?

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics , 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.

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

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
DOE OSTI2025

Fundamental Interactions of Bimetallic Cu x Pd y ( x + y = 4) Clusters Supported on the α-WC(0001) Surface and Their Performance for CO 2 Adsorption and Dissociation

The tungsten carbide α-WC(0001) surface, an active system for the activation of H 2 and important hydrogenation processes involving unsaturated hydrocarbons, can serve as a support of bimetallic clusters to produce materials with unique catalytic properties, opening routes for a wide range of technical applications. In particular, Cu x Pd y clusters are of particular interest because they combine metals with different properties. A stochastic method was applied to obtain the geometry of Cu x Pd y (x + y = 4) bare clusters, evaluating thousands of possibilities to obtain stable structures, yielding one isomer for Cu 4 , Cu 2 Pd 2 , Cu 1 Pd 3 , and Pd 4 and two isomers for Cu 3 Pd 1 . These clusters were supported on C and W terminations of the tungsten carbide (0001) surface, exploring all of the binding possibilities. The adsorption energies on the C and W terminations are in the ranges from −2.51 to −3.02 eV and from −2.26 to −3.30 eV, respectively. The strongest and weakest binding was seen for monometallic Cu 4 and Pd 4 clusters on both C and W terminations, while the Cu-Pd bimetallics have intermediate adsorption energies but lack a clear trend in terms of composition. The location of Cu x Pd y clusters over the (0001) surface induces a decrease in the work function relative to the pristine surface, while the cluster-surface Bader charge transfer and variations in the partial density of states point to changes in the electronic structure of the carbide atoms upon binding of the metallic clusters. The d-band center of the Cu x Pd y deposited on WC(0001) indicates an intermediate reactivity among Cu(111) and Pd(111) surfaces, modulating the reactivity with small numbers of Cu and Pd atoms, i.e., atom economy in catalyst design. The likelihood of existence of the most stable Cu x Pd y (x + y = 4) clusters in the temperature range of 298-400 K is 100%. The composite Cu x Pd y /α-WC(0001) (x + y = 4), is a nontrivial system since 22 isomers are needed to completely describe its structural properties. Among the isomers, seven structures are necessary to represent Cu 3 Pd 1 /α-WC(0001), five for Pd 4 /α-WC(0001), two for Cu 4 /α-WC(0001), and four for Cu 2 Pd 2 /α-WC(0001) and Cu 1 Pd 3 /α-WC(0001). The large number of cluster isomers supported on the tungsten carbide surface opens the door for several applications in the heterogeneous catalysis of the Cu x Pd y /α-WC(0001) composite, with the possibility of modulating the geometric, electronic, and chemical properties according to a desired application. Test studies for the adsorption of CO 2 indicate that the Cu x Pd y /α-WC(0001) composites are highly active for the adsorption and decomposition of the molecule, with bimetallic and admetal-carbide interactions playing a key role in the binding performance. In conclusion, this high activity indicates that these systems should be useful as catalysts for the conversion of CO 2 to oxygenates or light alkanes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗