Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random variables”

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 325 records · Page 18

Acceleration of diffusive molecular dynamics simulations through mean field approximation and subcycling time integration

Highlights: • Two numerical methods are presented to accelerate DMD simulations. • The methods greatly reduce the computation time without much loss of accuracy. • The accelerated DMD model is capable of simulating long-term mass transport at atomistic length scales. • Demonstrated for the propagation of an atomically sharp phase boundary over 30 seconds. - Abstract: Diffusive Molecular Dynamics (DMD) is a class of recently developed computational models for the simulation of long-term diffusive mass transport at atomistic length scales. Compared to previous atomistic models, e.g., transition state theory based accelerated molecular dynamics, DMD allows the use of larger time-step sizes, but has a higher computational complexity at each time-step due to the need to solve a nonlinear optimization problem at every time-step. This paper presents two numerical methods to accelerate DMD based simulations. First, we show that when a many-body potential function, e.g., embedded atom method (EAM), is employed, the cost of DMD is dominated by the computation of the mean of the potential function and its derivatives, which are high-dimensional random variables. To reduce the cost, we explore both first- and second-order mean field approximations. Specifically, we show that the first-order approximation, which uses a point estimate to calculate the mean, can reduce the cost by two to three orders of magnitude, but may introduce relatively large error in the solution. We show that adding an approximate second-order correction term can significantly reduce the error without much increase in computational cost. Second, we show that DMD can be significantly accelerated through subcycling time integration, as the cost of integrating the empirical diffusion equation is much lower than that of the optimization solver. To assess the DMD model and the numerical approximation methods, we present two groups of numerical experiments that simulate the diffusion of hydrogen in palladium nanoparticles. In particular, we show that the computational framework is capable of capturing the propagation of an atomically sharp phase boundary over a time window of more than 30 seconds. The effects of the proposed numerical methods on solution accuracy and computation time are also assessed quantitatively.

36 MATERIALS SCIENCE↗

Gaussian wave packet transform based numerical scheme for the semi-classical Schrödinger equation with random inputs

In this work, we study the semi-classical limit of the Schrödinger equation with random inputs, and show that the semi-classical Schrödinger equation produces O(ε) oscillations in the random variable space. With the Gaussian wave packet transform, the original Schrödinger equation is mapped to an ordinary differential equation (ODE) system for the wave packet parameters coupled with a partial differential equation (PDE) for the quantity w in rescaled variables. Further, we show that the w equation does not produce ε dependent oscillations, and thus it is more amenable for numerical simulations. We propose multi-level sampling strategy in implementing the Gaussian wave packet transform, where in the most costly part, i.e. simulating the w equation, it is sufficient to use ε independent samples. We also provide extensive numerical tests as well as meaningful numerical experiments to justify the properties of the numerical algorithm, and hopefully shed light on possible future directions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ensemble variational Fokker-Planck methods for data assimilation

Particle flow filters solve Bayesian inference problems by smoothly transforming a set of particles into samples from the posterior distribution. Particles move in state space under the flow of an McKean-Vlasov-Itˆo process. This work introduces the Variational Fokker-Planck (VFP) framework for data assimilation, a general approach that includes previously known particle flow filters as special cases. The McKean-Vlasov-Itˆo process that transforms particles is defined via an optimal drift that depends on the selected diffusion term. It is established that the underlying probability density - sampled by the ensemble of particles - converges to the Bayesian posterior probability density. For a finite number of particles the optimal drift contains a regularization term that nudges particles toward becoming independent random variables. Based on this analysis, we derive computationally-feasible approximate regularization approaches that penalize the mutual information between pairs of particles, and avoid particle collapse. Moreover, the diffusion plays a role akin to a particle rejuvenation approach that aims to alleviate particle collapse. The VFP framework is very flexible. Different assumptions on prior and intermediate probability distributions can be used to implement the optimal drift, and localization and covariance shrinkage can be applied to alleviate the curse of dimensionality. A robust implicit-explicit method is discussed for the efficient integration of stiff McKean- Vlasov-Itˆo processes. Here, the effectiveness of the VFP framework is demonstrated on three progressively more challenging test problems, namely the Lorenz ’63, Lorenz ’96 and the quasi-geostrophic equations.

97 MATHEMATICS AND COMPUTING↗

Effective and asymptotic criticality of structurally disordered magnets

Changes in magnetic critical behaviour of quenched structurally-disordered magnets are usually exemplified in experiments and in MC simulations by diluted systems consisting of magnetic and non-magnetic components. In our study we aim to show that similar effects can be observed not only for diluted magnets with non-magnetic impurities but may be implemented, e.g., by the presence of two (and more) chemically different magnetic components as well. Therefore we consider a model of the structurally-disordered quenched magnet where all lattice sites are occupied by Ising-like spins of different lengths L. In such a random spin length Ising model, the length L of each spin is a random variable governed by the distribution function p (L). We demonstrate that this model belongs to the universality class of the site-diluted Ising model. This proves that both models are described by the same values of asymptotic critical exponents. However, their effective critical behaviour differs. As a case study, we consider a quenched mixture of two different magnets with values of elementary magnetic moments L 1 = 1 and L 2 = s, and of concentration c and 1 - c, correspondingly. We apply field-theoretical renormalization group approach to analyse the renormalization group flow for different initial conditions, triggered by s and c, and to calculate effective critical exponents further away from the fixed points of the renormalization group transformation. We show how the effective exponents are governed by difference in properties of the magnetic components.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inexact fuzzy-stochastic constraint-softened programming - A case study for waste management

In this study, an inexact fuzzy-stochastic constraint-softened programming method is developed for municipal solid waste (MSW) management under uncertainty. The developed method can deal with multiple uncertainties presented in terms of fuzzy sets, interval values and random variables. Moreover, a number of violation levels for the system constraints are allowed. This is realized through introduction of violation variables to soften system constraints, such that the model's decision space can be expanded under demanding conditions. This can help generate a range of decision alternatives under various conditions, allowing in-depth analyses of tradeoffs among economic objective, satisfaction degree, and constraint-violation risk. The developed method is applied to a case study of planning a MSW management system. The uncertain and dynamic information can be incorporated within a multi-layer scenario tree; revised decisions are permitted in each time period based on the realized values of uncertain events. Solutions associated with different satisfaction degree levels have been generated, corresponding to different constraint-violation risks. They are useful for supporting decisions of waste flow allocation and system-capacity expansion within a multistage context.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Scattering of radiofrequency waves by randomly modulated density interfaces in the edge of fusion plasmas

In the scrape-off layer and the edge region of a tokamak, the plasma is strongly turbulent and scatters the radiofrequency (RF) electromagnetic waves that propagate through this region. It is important to know the spectral properties of these scattered RF waves, whether used for diagnostics or for heating and current drive. The spectral changes influence the interpretation of the obtained diagnostic data, and the current and heating profiles. A full-wave, three-dimensional (3-D) electromagnetic code ScaRF has been developed for studying the RF wave propagation through turbulent plasma. ScaRF is a finite-difference frequency-domain (FDFD) method used for solving Maxwell's equations. The magnetized plasma is defined through the cold plasma by the anisotropic permittivity tensor. As a result, ScaRF can be used to study the scattering of any cold plasma RF wave. It can also be used for the study of the scattering of electron cyclotron waves in ITER-type and medium-sized tokamaks such as TCV, ASDEX-U and DIII-D. For the case of medium-sized tokamaks, there is experimental evidence that drift waves and rippling modes are present in the edge region. Hence, we have studied the scattering of RF waves by periodic density interfaces (plasma gratings) in the form of a superposition of spatial modes with varying periodicity and random amplitudes. The power reflection coefficient (a random variable) is calculated for different realizations of the density interface. In this work, the uncertainty of the power reflection coefficient is rigorously quantified by use of the Polynomial Chaos Expansion method in conjunction with the Smolyak sparse-grid integration, which is known as the PCE-SG method. The PCE-SG method is proven to be accurate and more efficient compared with alternative methods such as the Monte Carlo (MC) approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Volcanic suppression of Nile summer flooding triggers revolt and constrains interstate conflict in ancient Egypt

Volcanic eruptions provide tests of human and natural system sensitivity to abrupt shocks because their repeated occurrence allows the identification of systematic relationships in the presence of random variability. Here we show a suppression of Nile summer flooding via the radiative and dynamical impacts of explosive volcanism on the African monsoon, using climate model output, ice-core-based volcanic forcing data, Nilometer measurements, and ancient Egyptian writings. We then examine the response of Ptolemaic Egypt (305–30 BCE), one of the best-documented ancient superpowers, to volcanically induced Nile suppression. Eruptions are associated with revolt onset against elite rule, and the cessation of Ptolemaic state warfare with their great rival, the Seleukid Empire. Eruptions are also followed by socioeconomic stress with increased hereditary land sales, and the issuance of priestly decrees to reinforce elite authority. Ptolemaic vulnerability to volcanic eruptions offers a caution for all monsoon-dependent agricultural regions, presently including 70% of world population.

54 ENVIRONMENTAL SCIENCES↗

Data-Driven Benchmarking of Building Energy Efficiency Utilizing Statistical Frontier Models

Frontier methods quantify the energy efficiency of buildings by forming an efficient frontier (best-practice technology) and by comparing all buildings against that frontier. Because energy consumption fluctuates over time, the efficiency scores are stochastic random variables. Existing applications of frontier methods in energy efficiency either treat efficiency scores as deterministic values or estimate their uncertainty by resampling from one set of measurements. Availability of smart meter data (repeated measurements of energy consumption of buildings) enables using actual data to estimate the uncertainty in efficiency scores. Additionally, existing applications assume a linear form for an efficient frontier; i.e.,they assume that the best-practice technology scales up and down proportionally with building characteristics. However, previous research shows that buildings are nonlinear systems. This paper proposes a statistical method called stochastic energy efficiency frontier (SEEF) to estimate a bias-corrected efficiency score and its confidence intervals from measured data. The paper proposes an algorithm to specify the functional form of the frontier, identify the probability distribution of the efficiency score of each building using measured data, and rank buildings based on their energy efficiency. To illustrate the power of SEEF, this paper presents the results from applying SEEF on a smart meter data set of 307 residential buildings in the United States. SEEF efficiency scores are used to rank individual buildings based on energy efficiency, to compare subpopulations of buildings, and to identify irregular behavior of buildings across different time-of-use periods. SEEF is an improvement to the energy-intensity method (comparing kWh/sq.ft.): whereas SEEF identifies efficient buildings across the entire spectrum of building sizes, the energy-intensity method showed bias toward smaller buildings. The results of this research are expected to assist researchers and practitioners compare and rank (i.e.,benchmark) buildings more robustly and over a wider range of building types and sizes. Eventually, doing so is expected to result in improved resource allocation in energy-efficiency programs.

Kavousian, A↗

Broken ergodicity in two-dimensional homogeneous magnetohydrodynamic turbulence

Two-dimensional (2D) homogeneous magnetohydrodynamic (MHD) turbulence has many of the same qualitative features as three-dimensional (3D) homogeneous MHD turbulence. These features include several ideal (i.e., nondissipative) invariants along with the phenomenon of broken ergodicity (defined as nonergodic behavior over a very long time). Broken ergodicity appears when certain modes act like random variables with mean values that are large compared to their standard deviations, indicating a coherent structure or dynamo. Recently, the origin of broken ergodicity in 3D MHD turbulence that is manifest in the lowest wavenumbers was found. Here, we study the origin of broken ergodicity in 2D MHD turbulence. It will be seen that broken ergodicity in ideal 2D MHD turbulence can be manifest in the lowest wavenumbers of a finite numerical model for certain initial conditions or in the highest wavenumbers for another set of initial conditions. The origins of broken ergodicity in an ideal 2D homogeneous MHD turbulence are found through an eigenanalysis of the covariance matrices of the probability density function and by an examination of the associated entropy functional. When the values of ideal invariants are kept fixed and grid size increases, it will be shown that the energy in a few large modes remains constant, while the energy in any other mode is inversely proportional to grid size. Also, as grid size increases, we find that broken ergodicity becomes manifest at more and more wavenumbers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Prediction of atomization energy using graph kernel and active learning

Data-driven prediction of molecular properties presents unique challenges to the design of machine learning methods concerning data structure/dimensionality, symmetry adaption, and confidence management. In this paper, we present a kernel-based pipeline that can learn and predict the atomization energy of molecules with high accuracy. The framework employs Gaussian process regression to perform predictions based on the similarity between molecules, which is computed using the marginalized graph kernel. To apply the marginalized graph kernel, a spatial adjacency rule is first employed to convert molecules into graphs whose vertices and edges are labeled by elements and interatomic distances, respectively. We then derive formulas for the efficient evaluation of the kernel. Specific functional components for the marginalized graph kernel are proposed, while the effects of the associated hyperparameters on accuracy and predictive confidence are examined. We show that the graph kernel is particularly suitable for predicting extensive properties because its convolutional structure coincides with that of the covariance formula between sums of random variables. Using an active learning procedure, we demonstrate that the proposed method can achieve a mean absolute error of 0.62 ± 0.01 kcal/mol using as few as 2000 training samples on the QM7 dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

MODELING OF THE INITIAL MASS FUNCTION USING THE METROPOLIS-HASTINGS ALGORITHM

A stochastic model has been developed for the hierarchical fragmentation of a molecular cloud. Here, the number of fragments, time between successive fragmentation steps, and mass of a fragment are considered as random variables, and fragment masses are generated using the Metropolis-Hastings algorithm. The resulting mass spectra, computed at different projected distances and taking opacity into consideration, show a signature of mass segregation. The critical mass, mass spectrum, and mass segregation are consistent with the observations of young massive clusters in our Galaxy as well as in external galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Cosmic topology. Part IIa. Eigenmodes, correlation matrices, and detectability of orientable Euclidean manifolds

Abstract If the Universe has non-trivial spatial topology, observables depend on both the parameters of the spatial manifold and the position and orientation of the observer. In infinite Euclidean space, most cosmological observables arise from the amplitudes of Fourier modes of primordial scalar curvature perturbations. Topological boundary conditions replace the full set of Fourier modes with specific linear combinations of selected Fourier modes as the eigenmodes of the scalar Laplacian. We present formulas for eigenmodes in orientable Euclidean manifolds with the topologiesE 1 –E 6 ,E 11 ,E 12 ,E 16 , andE 18 that encompass the full range of manifold parameters and observer positions, generalizing previous treatments. Under the assumption that the amplitudes of primordial scalar curvature eigenmodes are independent random variables, for each topology we obtain the correlation matrices of Fourier-mode amplitudes (of scalar fields linearly related to the scalar curvature) and the correlation matrices of spherical-harmonic coefficients of such fields sampled on a sphere, such as the temperature of the cosmic microwave background (CMB). We evaluate the detectability of these correlations given the cosmic variance of the observed CMB sky. We find that topologies where the distance to our nearest clone is less than about 1.2 times the diameter of the last scattering surface of the CMB give a correlation signal that is larger than cosmic variance noise in the CMB. This implies that if cosmic topology is the explanation of large-angle anomalies in the CMB, then the distance to our nearest clone is not much larger than the diameter of the last scattering surface. We argue that the topological information is likely to be better preserved in three-dimensional data, such as will eventually be available from large-scale structure surveys.

Astronomy & Astrophysics↗

Refining fast calorimeter simulations with a Schrödinger Bridge

Machine learning-based simulations, especially calorimeter simulations, are promising tools for approximating the precision of classical high energy physics simulations with a fraction of the generation time. Nearly all methods proposed so far learn neural networks that map a random variable with a known probability density, like a Gaussian, to realistic-looking events. In many cases, physics events are not close to Gaussian and so these neural networks have to learn a highly complex function. We study an alternative approach: Schrödinger bridge Quality Improvement via Refinement of Existing Lightweight Simulations (SQuIRELS). SQuIRELS leverages the power of diffusion-based neural networks and Schrödinger bridges to map between samples where the probability density is not known explicitly. We apply SQuIRELS to the task of refining a classical fast simulation to approximate a full classical simulation. On simulated calorimeter events, we find that SQuIRELS is able to reproduce highly non-trivial features of the full simulation with a fraction of the generation time.

Calorimeter methods↗

The reproduction number and its probability distribution for stochastic viral dynamics

We consider stochastic models of individual infected cells. The reproduction number, R, is understood as a random variable representing the number of new cells infected by one initial infected cell in an otherwise susceptible (target cell) population. Variability in R results partly from heterogeneity in the viral burst size (the number of viral progeny generated from an infected cell during its lifetime), which depends on the distribution of cellular lifetimes and on the mechanism of virion release. We analyse viral dynamics models with an eclipse phase: the period of time after a cell is infected but before it is capable of releasing virions. The duration of the eclipse, or the subsequent infectious, phase is non-exponential, but composed of stages. We derive the probability distribution of the reproduction number for these viral dynamics models, and show it is a negative binomial distribution in the case of constant viral release from infectious cells, and under the assumption of an excess of target cells. In a deterministic model, the ultimate in-host establishment or extinction of the viral infection depends entirely on whether the mean reproduction number is greater than, or less than, one, respectively. Here, the probability of extinction is determined by the probability distribution of R, not simply its mean value. In particular, we show that in some cases the probability of infection is not an increasing function of the mean reproduction number.

59 BASIC BIOLOGICAL SCIENCES↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Demand Response Under Stochastic, Price-Dependent User Behavior

This letter focuses on price-based demand response (DR) implemented through dynamic adjustments of electricity prices. It extends existing DR models to a stochastic framework in which customer response is represented by price-dependent random variables, leveraging models and tools from the theory of stochastic optimization with decision-dependent distributions. The inherent epistemic uncertainty in the customers' responses renders open-loop, model-based DR strategies impractical. We propose a stochastic, feedback-based pricing strategy to compensate for estimation errors and uncertainty in customer response, establish theoretical results demonstrating the stability and near-optimality of the proposed approach, and validate its effectiveness through numerical simulations.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Corrective Control to Handle Forecast Uncertainty: A Chance Constrained Optimal Power Flow

Higher shares of electricity generation from renewable energy sources and market liberalization is increasing uncertainty in power systems operation. At the same time, operation is becoming more flexible with improved control systems and new technology such as phase shifting transformers (PSTs) and high voltage direct current connections (HVDC). Previous studies have shown that the use of corrective control in response to outages contributes to a reduction in operating cost, while maintaining N-1 security. In this work, we propose a method to extend the use of corrective control of PSTs and HVDCs to react to uncertainty. We characterize the uncertainty as continuous random variables, and define the corrective control actions through affine control policies. This allows us to efficiently model control reactions to a large number of uncertainty sources. The control policies are then included in a chance constrained optimal power flow formulation, which guarantees that the system constraints are enforced with a desired probability. Lastly, by applying an analytical reformulation of the chance constraints, we obtain a second-order cone problem for which we develop an efficient solution algorithm. In a case study for the IEEE 118 bus system, we show that corrective control for uncertainty leads to a decrease in operational cost, while maintaining system security. Further, we demonstrate the scalability of the method by solving the problem for the IEEE 300 bus and the Polish system test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Topology Estimation using Graphical Models in Multi-Phase Power Distribution Grids

Power distribution grids are structurally operated radially, such that energized lines form a collection of trees with a substation at the root of each tree. The operational topology may change from time to time, however tracking these changes, even though important for the distribution grid operation and control, is hindered by limited real-time monitoring. This work develops a learning framework to reconstruct the radial operational structure of the distribution grid from synchronized voltage measurements. To detect operational lines our learning algorithm uses conditional independence tests for continuous random variables that is applicable to a wide class of probability distributions and Gaussian injections in particular. Furthermore, our algorithm applies to the practical case of unbalanced three-phase power flow. The performance is validated on AC power flow simulations over three phase IEEE distribution grid test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗