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 181 records · Page 10

The analysis of space-time structure in QCD vacuum II: Dynamics of polarization and absolute X-distribution

Highlights: > We propose a method to compute the polarization for a multi-dimensional random distribution. > We apply the method to the eigenemodes of the Dirac operator in pure glue QCD. > We compute the chiral polarization for these modes and study its scale dependence. > We find that in a finite volume there is a scale where the polarization tendency changes. > We study the continuum limit of this chiral polarization scale. - Abstract: We propose a framework for quantitative evaluation of dynamical tendency for polarization in an arbitrary random variable that can be decomposed into a pair of orthogonal subspaces. The method uses measures based on comparisons of given dynamics to its counterpart with statistically independent components. The formalism of previously considered X-distributions is used to express the aforementioned comparisons, in effect putting the former approach on solid footing. Our analysis leads to the definition of a suitable correlation coefficient with clear statistical meaning. We apply the method to the dynamics induced by pure-glue lattice QCD in local left-right components of overlap Dirac eigenmodes. It is found that, in finite physical volume, there exists a non-zero physical scale in the spectrum of eigenvalues such that eigenmodes at smaller (fixed) eigenvalues exhibit convex X-distribution (positive correlation), while at larger eigenvalues the distribution is concave (negative correlation). This chiral polarization scale thus separates a regime where dynamics enhances chirality relative to statistical independence from a regime where it suppresses it, and gives an objective definition to the notion of 'low' and 'high' Dirac eigenmode. We propose to investigate whether the polarization scale remains non-zero in the infinite volume limit, in which case it would represent a new kind of low energy scale in QCD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

COSMIC MICROWAVE BACKGROUND LIKELIHOOD APPROXIMATION FOR BANDED PROBABILITY DISTRIBUTIONS

We investigate sets of random variables that can be arranged sequentially such that a given variable only depends conditionally on its immediate predecessor. For such sets, we show that the full joint probability distribution may be expressed exclusively in terms of uni- and bivariate marginals. Under the assumption that the cosmic microwave background (CMB) power spectrum likelihood only exhibits correlations within a banded multipole range, Δl{sub C}, we apply this expression to two outstanding problems in CMB likelihood analysis. First, we derive a statistically well-defined hybrid likelihood estimator, merging two independent (e.g., low- and high-l) likelihoods into a single expression that properly accounts for correlations between the two. Applying this expression to the Wilkinson Microwave Anisotropy Probe (WMAP) likelihood, we verify that the effect of correlations on cosmological parameters in the transition region is negligible in terms of cosmological parameters for WMAP; the largest relative shift seen for any parameter is 0.06σ. However, because this may not hold for other experimental setups (e.g., for different instrumental noise properties or analysis masks), but must rather be verified on a case-by-case basis, we recommend our new hybridization scheme for future experiments for statistical self-consistency reasons. Second, we use the same expression to improve the convergence rate of the Blackwell-Rao likelihood estimator, reducing the required number of Monte Carlo samples by several orders of magnitude, and thereby extend it to high-l applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantification of modeling uncertainty in the Rayleigh damping model

Understanding and accurately characterizing energy dissipation mechanisms in civil structures during earthquakes is an important element of seismic assessment and design. The most commonly used model is attributed to Rayleigh. This paper proposes a systematic approach to quantify the uncertainty associated with Rayleigh's damping model. Bayesian calibration with embedded model error is employed to treat the coefficients of the Rayleigh model as random variables using modal damping ratios. Through a numerical example, we illustrate how this approach works and how the calibrated model can address modeling uncertainty associated with the Rayleigh damping model.

42 ENGINEERING↗

Order priors for Bayesian network discovery with an application to malware phylogeny

Here, Bayesian networks have been used extensively to model and discover dependency relationships among sets of random variables. We learn Bayesian network structure with a combination of human knowledge about the partial ordering of variables and statistical inference of conditional dependencies from observed data. Our approach leverages complementary information from human knowledge and inference from observed data to produce networks that reflect human beliefs about the system as well as to fit the observed data. Applying prior beliefs about partial orderings of variables is an approach distinctly different from existing methods that incorporate prior beliefs about direct dependencies (or edges) in a Bayesian network. We provide an efficient implementation of the partial-order prior in a Bayesian structure discovery learning algorithm, as well as an edge prior, showing that both priors meet the local modularity requirement necessary for an efficient Bayesian discovery algorithm. In benchmark studies, the partial-order prior improves the accuracy of Bayesian network structure learning as well as the edge prior, even though order priors are more general. Our primary motivation is in characterizing the evolution of families of malware to aid cyber security analysts. For the problem of malware phylogeny discovery, we find that our algorithm, compared to existing malware phylogeny algorithms, more accurately discovers true dependencies that are missed by other algorithms.

97 MATHEMATICS AND COMPUTING↗

Sequential Image Recovery Using Joint Hierarchical Bayesian Learning

Abstract Recovering temporal image sequences (videos) based on indirect, noisy, or incomplete data is an essential yet challenging task. We specifically consider the case where each data set is missing vital information, which prevents the accurate recovery of the individual images. Although some recent (variational) methods have demonstrated high-resolution image recovery based on jointly recovering sequential images, there remain robustness issues due to parameter tuning and restrictions on the type of sequential images. Here, we present a method based on hierarchical Bayesian learning for the joint recovery of sequential images that incorporates prior intra- and inter-image information. Our method restores the missing information in each image by “borrowing” it from the other images. More precisely, we couple sequential images by penalizing their pixel-wise difference. The corresponding penalty terms (one for each pixel and pair of subsequent images) are treated as weakly-informative random variables that favor small pixel-wise differences but allow occasional outliers. As a result, all of the individual reconstructions yield improved accuracy. Our method can be used for various data acquisitions and allows for uncertainty quantification. Some preliminary results indicate its potential use for sequential deblurring and magnetic resonance imaging.

Xiao, Yao↗

Statistics of Point Vortex Turbulence in Non-neutral Flows and in Flows with Translational and Rotational Symmetries

A theory (Esler and Ashbee in J Fluid Mech 779:275–308, 2015) describing the statistics of N freely-evolving point vortices in a bounded two-dimensional domain is extended. First, the case of a non-neutral vortex gas is addressed, and it is shown that the density of states function can be identified with the probability density function of an infinite sum of independent non-central chi-squared random variables, the details of which depend only on the shape of the domain. Equations for the equilibrium energy spectrum and other statistical quantities follow, the validity of which are verified against direct numerical simulations of the equations of motion. Second, domains with additional conserved quantities associated with a symmetry (e.g., circle, periodic channel) are investigated, and it is shown that the treatment of the non-neutral case can be modified to account for the additional constraint.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A state estimation approach based on stochastic expansions

This paper presents a new approach for state estimation problems. It is based on the representation of random variables using stochastic functions. Its main idea is to expand the state variables in terms of the noise variables of the system, and then estimate the unnoisy value of the state variables by taking the mean value of the stochastic expansion. Moreover, it was shown that in some situations, the proposed approach may be adapted to the determination of the probability distribution of the state noise. For the determination of the coefficients of the expansions, we present three approaches: moment matching (MM), collocation (COL) and variational (VAR). In the numerical analysis section, three examples are analyzed including a discrete linear system, the Influenza in a boarding school and the state estimation problem in the Hodgkin–Huxley’s model. In all these examples, the proposed approach was able to estimate the values of the state variables with precision, i.e., with very low RMS values.

97 MATHEMATICS AND COMPUTING↗

On the Feynman-alpha method for reflected fissile assemblies

The Feynman-alpha method is a neutron noise technique that is used to estimate the prompt neutron period of fissile assemblies. The method and quantity are of widespread interest including in applications such as nuclear criticality safety, safeguards and nonproliferation, and stockpile stewardship; the prompt neutron period may also be used to infer the k eff multiplication factor. The Feynman-alpha method is predicated on time-correlated neutron detections that deviate from a Poisson random variable due to multiplication. Traditionally, such measurements are diagnosed with one-region point kinetics, but two-region models are required when the fissile assembly is reflected. This paper presents a derivation of the two-region point kinetics Feynman-alpha equations based on a double integration of the Rossi-alpha equations, develops novel propagation of measurement uncertainty, and validates the theory. Validation is achieved with organic scintillator measurements of weapons-grade plutonium reflected by various amounts of copper to achieve k eff values of 0.83–0.94 and prompt periods of 5–75 ns. The results demonstrate that Feynman-alpha measurements should use the two-region model instead of the one-region model. The simplified one-region model deviates from the validated two-region models by as much as 10% in the estimate of the prompt neutron period, and the two-region model reduces to the one-region model for small amounts of reflector. The Feynman-alpha estimates of the prompt neutron period are compared to those of the Rossi-alpha approach. The comparative results demonstrate that the Feynman-alpha method is more precise than the Rossi-alpha method and more accurate for k eff < 0.92, whereas the Rossi-alpha method is generally more accurate for higher multiplications. Here, the uncertainty propagation developed in this work should be used for all Feynman-alpha measurements and will therein improve fitting accuracy and appropriate precision estimates.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Characterization of the quantumness of unsteerable tripartite correlations

Quantumness for a bipartite unsteerable quantum correlation is operationally characterized by the notion of super-unsteerability. Super-unsteerability refers to the requirement of a larger dimension of the random variable that the steering party has to preshare with the party to be steered in the classical simulation protocol to generate an unsteerable correlation than the local Hilbert space dimension of the quantum states (reproducing the given unsteerable correlation) at the steering party’s side. In the present study, this concept of super-unsteerability is generalized by defining the notion of super-bi-unsteerability for tripartite correlations, which is unsteerable across a bipartite cut. Genuine super-bi-unsteerability is defined as the occurrence of super-bi-unsteerability across all possible bipartite cuts. Specific example of genuine super-bi-unsteerability for tripartite correlations has been presented. This study provides a tool to characterize the genuine quantumness of tripartite quantum correlations which are unsteerable across every bipartite cut.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LABQ3: Bayesian method for quantification of mineral compositions and nano-scale elemental mapping of 3D synchrotron XCT data

Quantitative analysis of mineral compositions is essential in understanding geochemical, mineralogical and environmental processes. Fine-resolution 3D imaging is widely done using synchrotron X-ray computed tomography (XCT), but existing analyses are limited to visualization and segmentation. This paper presents a new method, Linear Attenuation Bayesian Quantitative 3D-mapper (LABQ3), based on the linearity of X-ray attenuation with respect to elemental concentrations. To address the random variability in attenuation measurements, LABQ3 employs Bayesian decision theory to minimize classification error, using reference attenuation distributions from scans of pure mineral standards. To demonstrate LABQ3 and test its performance, we studied precipitated carbonate samples. XCT scans were done at multiple energies using the transmission X-ray microscope (TXM) at beamline 32-ID-C of the Advanced Photon Source at Argonne National Laboratory. The reconstructed 3D images have a voxel size of 20 nm. Analyses revealed rich nano-scale compositional heterogeneity within individual particles. A mixture of calcium and cadmium produced an overall stoichiometric composition of (Ca 0.78 ,Cd 0.22 )CO 3 , with some voxels containing nearly pure CdCO 3 . The addition of zinc led to an overall stoichiometric composition of 33% Ca, 28% Cd, 39% Zn, with a nearly pure CaCO 3 core and compositional zonation through the rim. These compositional gradients are related to temporal sequences of carbonate mineral formation where Cd precipitated at the beginning in (Ca,Cd)CO 3 , while Cd and Zn precipitated at the end in (Ca, Cd,Zn)CO 3 . Results differ from bulk analyses using Inductively Coupled Plasma-Mass Spectrometry (ICP-MS), showing that LABQ3 provides particle-specific insights. LABQ3 distinguishes itself by quantifying chemical compositions along a continuum, making it different from XCT analyses based on segmentation. LABQ3 allows simultaneous acquisition of morphology and chemical composition in 3D, facilitating the interpretation of chemical gradients of trace elements, quantification of solid solution compositions, inferences about temporal sequences of mineral precipitation, and addressing other concerns about solid-phase chemistry.

58 GEOSCIENCES↗

Asynchronous space–time domain decomposition method with localized uncertainty quantification

The computational cost associated with uncertainty quantification of engineering problems featuring localized phenomenon can be reduced by confining the random variability of the model parameters within a region of interest. Here in this case, a localized treatment of mesh and time resolutions is required to capture the effect of the confined material uncertainty on the global response. We present a computational approach for localized uncertainty quantification with the capability of asynchronous treatment of mesh and time resolutions. In particular, we allow each subdomain to have its local uncertainty representation and the corresponding mesh and time resolutions. As a result, computing resources can be directed toward a small region of interest where a model with high spatial and temporal resolutions is required. To verify the numerical implementation, we consider elastic wave propagation in an axially loaded beam. Moreover, we perform convergence studies with respect to the spatial and temporal discretizations as well as the size of an uncertain subdomain. A projectile impacting a composite sandwich plate is considered as an engineering application for the proposed method.

42 ENGINEERING↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Propagating uncertainties in large-scale hemodynamics models via network uncertainty quantification and reduced-order modeling

Numerical simulations of the cardiovascular system are affected by uncertainties arising from a substantial lack of data related to the boundary conditions and the physical parameters of the mathematical models. Quantifying the impact of this uncertainty on the numerical results along the circulatory network is challenged by the complexity of both the morphology of the domain and the local dynamics. Here, we propose to integrate (i) the Transverse Enriched Pipe Element Methods (TEPEM) as a reduced-order model for effectively computing the 3D local hemodynamics; and (ii) a combination of uncertainty quantification via Polynomial Chaos Expansion and classical relaxation methods – called network uncertainty quantification (NetUQ) – for effectively propagating random variables that encode uncertainties throughout the networks. The findings demonstrate the computational effectiveness of computing the propagation of uncertainties in networks with nontrivial topology, including portions of the cerebral and the coronary systems.

97 MATHEMATICS AND COMPUTING↗

Time-series machine-learning error models for approximate solutions to parameterized dynamical systems

This work proposes a machine-learning framework for modeling the error incurred by approximate solutions to parameterized dynamical systems. In particular, we extend the machine-learning error models (MLEM) framework proposed in Ref. Freno and Carlberg (2019) to dynamical systems. The proposed Time-Series Machine-Learning Error Modeling (T-MLEM) method constructs a regression model that maps features – which comprise error indicators that are derived from standard a posteriori error-quantification techniques – to a random variable for the approximate-solution error at each time instance. The proposed framework considers a wide range of candidate features, regression methods, and additive noise models. We consider primarily recursive regression techniques developed for time-series modeling, including both classical time-series models (e.g., autoregressive models) and recurrent neural networks (RNNs), but also analyze standard non-recursive regression techniques (e.g., feed-forward neural networks) for comparative purposes. Finally, numerical experiments conducted on multiple benchmark problems illustrate that the long short-term memory (LSTM) neural network, which is a type of RNN, outperforms other methods and yields substantial improvements in error predictions over traditional approaches.

42 ENGINEERING↗

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

Stochastic modeling and statistical calibration with model error and scarce data

This paper introduces a procedure to assess the predictive accuracy of stochastic models subject to model error and sparse data. Model error is introduced as uncertainty on the coefficients of appropriate polynomial chaos expansions (PCE). The error associated with finite sample size allows us to conceive of these coefficients as statistics of the data that we describe as random variables whose influence on output quantities of interest is evaluated through the extended polynomial chaos expansion (EPCE). A Bayesian data assimilation scheme is introduced to update these expansions by considering the resulting nested chaos expansion as a hierarchical probabilistic model. Stochastic models of quantities of interest (QoI) are thus constructed and efficiently evaluated. Here, the Metropolis–Hastings Markov chain Monte Carlo procedure is used to sample the posterior. Two illustrative analytical and numerical problems are used to demonstrate the proposed approach.

Bayesian inference↗