Search NASA⌕ Search

SEARCH · Search NASA

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 109 records · Page 6

Creep anisotropy modeling and uncertainty quantification of an additively manufactured Ni-based superalloy

The advantages offered by additive manufacturing over traditional processes has driven a great deal of industrial and academic interest in recent years. However, the process is relatively new and requires additional investigation to become sufficiently mature for wide scale industrial adoption. Electron beam melting powder bed fusion is one technology that has shown promise for fabricating high temperature resistant materials such as nickel based superalloys. The resulting microstructures typically exhibit a strong fiber texture in the build direction giving rise to anisotropic time-dependent deformation behavior. In order to accelerate the qualification of these materials for industrial adoption accurate numerical models are needed for simulating their behavior. In this work a crystal plasticity model including non-Schmid effects is presented for capturing creep anisotropy observed in additively manufactured IN738LC. The model is calibrated via a probabilistic framework where model parameters are treated as random variables. An iterative sequential design strategy is utilized to efficiently identify the probability density of the unknown model parameters. As a case study the model is utilized to investigate the behavior of randomly oriented equiaxed grain clusters sometimes observed embedded in the additively manufactured columnar structure. A synthetic realization is simulated and uncertainty is propagated through to the full-field response. Results indicate that these features are the source of significant creep relaxation and strain accumulation which partially explains observed grain boundary decohesion at these locations.

36 MATERIALS SCIENCE↗

A least-squares approximation of partial differential equations with high-dimensional random inputs

Uncertainty quantification schemes based on stochastic Galerkin projections, with global or local basis functions, and also stochastic collocation methods in their conventional form, suffer from the so called curse of dimensionality: the associated computational cost grows exponentially as a function of the number of random variables defining the underlying probability space of the problem. In this paper, to overcome the curse of dimensionality, a low-rank separated approximation of the solution of a stochastic partial differential (SPDE) with high-dimensional random input data is obtained using an alternating least-squares (ALS) scheme. It will be shown that, in theory, the computational cost of the proposed algorithm grows linearly with respect to the dimension of the underlying probability space of the system. For the case of an elliptic SPDE, an a priori error analysis of the algorithm is derived. Finally, different aspects of the proposed methodology are explored through its application to some numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Universality in dissipative Landau-Zener transitions

We introduce a random-variable approach to investigate the dynamics of a dissipative two-state system. Based on an exact functional integral description, our method reformulates the problem as that of the time evolution of a quantum state vector subject to a Hamiltonian containing random noise fields. This numerically exact, nonperturbative formalism is particularly well suited in the context of time-dependent Hamiltonians, at both zero and finite temperature. As an important example, we consider the renowned Landau-Zener problem in the presence of an Ohmic environment with a large cutoff frequency at finite temperature. We investigate the ''scaling'' limit of the problem at intermediate times, where the decay of the upper-spin-state population is universal. Such a dissipative situation may be implemented using a cold-atom bosonic setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic-learning-based stochastic surrogate model from small incomplete datasets for nonlinear dynamical systems

We consider a high-dimensional nonlinear computational model of a dynamical system, parameterized by a vector-valued control parameter, in the presence of uncertainties represented by an uncontrolled parameter modeled by a vector-valued random variable, and possibly with stochastic excitation. The objective is to construct a statistical surrogate model where the input is any deterministic value of the control parameter, and the output is a vector-valued observation of the computational model, which is a random vector whose probability measure is updated using a target dataset. To construct this statistical surrogate model, the stochastic response of the computational model must be built, which is a vector-valued time-discretized stochastic process in high dimension, depending on the control parameter. It is assumed that the computational cost of a single evaluation of the deterministic model is high. For the probabilistic updating, we consider a subset of the components of the observation of the computational model, defined as the “identification observation” of the computational model, for which a small target dataset is available. Therefore, the target dataset is associated with partial observability, corresponding to an incomplete data case. Given a prior probability model of the random control and uncontrolled parameters, a training dataset is constructed, consisting of realizations of the random triplet composed of the stochastic response, the random identification observation, and the random control parameter. Since the computational cost of a single evaluation of the deterministic model is assumed to be large, the training dataset is also of small size. The main challenges in this problem are the high dimensionality, partial observability leading to incomplete data in the target dataset for the identification observation of the computational model (which is not sufficient to identify the computational stochastic responses), and the availability of a small training dataset. To address these challenges, we propose a methodology based on statistical methods for constructing necessary reduced representations, direct probabilistic learning under constraints using probabilistic learning on manifolds (PLoM) constrained by the target dataset, and the use of a weak formulation of the Fourier transform of probability measures. Statistical conditioning is also employed to explore the learned dataset. The constructed predictive statistical surrogate model can be implemented in the context of online computation. Here, we apply this approach to a problem of nonlinear stochastic dynamics in high dimensions within the framework of deformable solids mechanics.

Engineering↗

Learning Planar Ising Models Software

Learning Planar Ising Models is a software package written in Matlab for learning relationships among variable in a dataset using graphical models. The software package implements a generally-applicable algorithm for learning planar Ising models from any multivariate dataset. The code provides an algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. The software includes demonstrations of the algorithm in simulations and for applications on publicly available datasets. Details of the algorithm, demonstration simulations, and applications are given in Johnson, et al; 2016. Reference: Johnson, J. K., Oyen, D., Chertkov, M., and Netrapalli, P. (2016). Learning planar Ising models. Journal of Machine Learning Research.

Oyen, Diane↗

Investigation of advanced UQ for CRUD prediction with VIPRE.

This document summarizes the results from a level 3 milestone study within the CASL VUQ effort. It demonstrates the application of 'advanced UQ,' in particular dimension-adaptive p-refinement for polynomial chaos and stochastic collocation. The study calculates statistics for several quantities of interest that are indicators for the formation of CRUD (Chalk River unidentified deposit), which can lead to CIPS (CRUD induced power shift). Stochastic expansion methods are attractive methods for uncertainty quantification due to their fast convergence properties. For smooth functions (i.e., analytic, infinitely-differentiable) in L{sup 2} (i.e., possessing finite variance), exponential convergence rates can be obtained under order refinement for integrated statistical quantities of interest such as mean, variance, and probability. Two stochastic expansion methods are of interest: nonintrusive polynomial chaos expansion (PCE), which computes coefficients for a known basis of multivariate orthogonal polynomials, and stochastic collocation (SC), which forms multivariate interpolation polynomials for known coefficients. Within the DAKOTA project, recent research in stochastic expansion methods has focused on automated polynomial order refinement ('p-refinement') of expansions to support scalability to higher dimensional random input spaces [4, 3]. By preferentially refining only in the most important dimensions of the input space, the applicability of these methods can be extended from O(10{sup 0})-O(10{sup 1}) random variables to O(10{sup 2}) and beyond, depending on the degree of anisotropy (i.e., the extent to which randominput variables have differing degrees of influence on the statistical quantities of interest (QOIs)). Thus, the purpose of this study is to investigate the application of these adaptive stochastic expansion methods to the analysis of CRUD using the VIPRE simulation tools for two different plant models of differing random dimension, anisotropy, and smoothness.

99 GENERAL AND MISCELLANEOUS↗

Probabilistic Based Design Methodology for Solid Oxide Fuel Cell Stacks

A probabilistic-based component design methodology is developed for solid oxide fuel cell (SOFC) stack. This method takes into account the randomness in SOFC material properties as well as the stresses arising from different manufacturing and operating conditions. The purpose of this work is to provide the SOFC designers a design methodology such that desired level of component reliability can be achieved with deterministic design functions using an equivalent safety factor to account for the uncertainties in material properties and structural stresses. Multi-physics-based finite element analyses were used to predict the electrochemical and thermal mechanical responses of SOFC stacks with different geometric variations and under different operating conditions. Failures in the anode and the seal were used as design examples. The predicted maximum principal stresses in the anode and the seal were compared with the experimentally determined strength characteristics for the anode and the seal respectively. Component failure probabilities for the current design were then calculated under different operating conditions. It was found that anode failure probability is very low under all conditions examined. The seal failure probability is relatively high, particularly for high fuel utilization rate under low average cell temperature. Next, the procedures for calculating the equivalent safety factors for anode and seal were demonstrated such that uniform failure probability of the anode and seal can be achieved. Analysis procedures were also included for non-normal distributed random variables such that more realistic distributions of strength and stress can be analyzed using the proposed design methodology.

30 DIRECT ENERGY CONVERSION↗

Quantum correlations and dynamics from classical random fields valued in complex Hilbert spaces

One of the crucial differences between mathematical models of classical and quantum mechanics (QM) is the use of the tensor product of the state spaces of subsystems as the state space of the corresponding composite system. (To describe an ensemble of classical composite systems, one uses random variables taking values in the Cartesian product of the state spaces of subsystems.) We show that, nevertheless, it is possible to establish a natural correspondence between the classical and the quantum probabilistic descriptions of composite systems. Quantum averages for composite systems (including entangled) can be represented as averages with respect to classical random fields. It is essentially what Albert Einstein dreamed of. QM is represented as classical statistical mechanics with infinite-dimensional phase space. While the mathematical construction is completely rigorous, its physical interpretation is a complicated problem. We present the basic physical interpretation of prequantum classical statistical field theory in Sec. II. However, this is only the first step toward real physical theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Correlation properties of entangled multiphoton states and Bernstein's paradox

A normally ordered characteristic function (NOCF) of Bose operators is calculated for a number of discrete-variable entangled states (Greenberger-Horne-Zeilinger (GHZ) and Werner (W) qubit states and a cluster state). It is shown that such NOCFs contain visual information on two types of correlations: pseudoclassical and quantum correlations. The latter manifest themselves in the interference terms of the NOCFs and lead to quantum paradoxes, whereas the pseudoclassical correlations of photons and their cumulants satisfy the relations for classical random variables. Three- and four-qubit states are analyzed in detail. An implementation of an analog of Bernstein's paradox on discrete quantum variables is discussed. A measure of quantumness of an entangled state is introduced that is not related to the entropy approach. It is established that the maximum of the degree of quantumness substantiates the numerical values of the coefficients in multiqubit vector states derived from intuitive considerations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299–2361, 2012). It was proved that when the degrees obey a power law with exponent τ∈(3,4), the sequence of clusters ordered in decreasing size and multiplied through by n{sup −(τ−2)/(τ−1)} converges as n→∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237–269, 2001) for the Erdős–Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Arak’s Inequalities for the Generalized Arithmetic Progressions

In 1980s, Arak has obtained powerful inequalities for the concentration functions of sums of independent random variables. Using these results, he has solved an old problem stated by Kolmogorov. In this paper, one of Arak’s results is modified to include generalized arithmetic progressions in the statement.

97 MATHEMATICS AND COMPUTING↗

Joint probabilities and quantum cognition

In this paper we discuss the existence of joint probability distributions for quantumlike response computations in the brain. We do so by focusing on a contextual neural-oscillator model shown to reproduce the main features of behavioral stimulus-response theory. We then exhibit a simple example of contextual random variables not having a joint probability distribution, and describe how such variables can be obtained from neural oscillators, but not from a quantum observable algebra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification of microstructural properties due to variability in measured pole figures

Experimental pole figures are an important input for microstructure homogenization models. In this paper, we derive an exact analytical formulation to quantify the uncertainties in homogenized properties due to uncertainty in the experimentally measured pole figures. The pole figures are acquired from a set of Ti-7Al alloy samples. These samples were obtained from the same process: by compressing a beta forged ingot at room temperature followed by annealing. The samples were taken from different regions of the original ingot, and this created variability in the resulting pole figures. The joint multivariate probability distributions of the computed orientation distribution function (ODF) is then found using the method of characteristic functions based on a Gaussian model of the pole figures. Engineering properties such as elastic modulus can be obtained by volume averaging over the ODF. We also show that uncertainty in elastic properties can be analytically obtained using direct transformation of random variables in the homogenization approach.

36 MATERIALS SCIENCE↗

Control design and robustness analysis of a ball and plate system by using polynomial chaos

In this paper, we present a mathematical model of a ball and plate system, a control law and analyze its robustness properties by using the polynomial chaos method. The ball rolls without slipping. There is an auxiliary robot vision system that determines the bodies' positions and velocities, and is used for control purposes. The actuators are to orthogonal DC motors, that changes the plate's angles with the ground. The model is a extension of the ball and beam system and is highly nonlinear. The system is decoupled in two independent equations for coordinates x and y. Finally, the resulting nonlinear closed loop systems are analyzed by the polynomial chaos methodology, which considers that some system parameters are random variables, and generates statistical data that can be used in the robustness analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterization of intermittency in renewal processes: Application to earthquakes

We construct a one-dimensional piecewise linear intermittent map from the interevent time distribution for a given renewal process. Then, we characterize intermittency by the asymptotic behavior near the indifferent fixed point in the piecewise linear intermittent map. Thus, we provide a framework to understand a unified characterization of intermittency and also present the Lyapunov exponent for renewal processes. This method is applied to the occurrence of earthquakes using the Japan Meteorological Agency and the National Earthquake Information Center catalog. By analyzing the return map of interevent times, we find that interevent times are not independent and identically distributed random variables but that the conditional probability distribution functions in the tail obey the Weibull distribution.

58 GEOSCIENCES↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗