Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probabilities Mathematics”

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 1,369 records · Page 76

Spin-Dependent Stereochemistry: A Nonadiabatic Quantum Dynamics Case Study of S + H 2 → SH + H Reaction

We study the spin-dependent stereodynamics of the S + H 2 → SH + H reaction by using full-dimensional quantum dynamics calculations with zero total nuclear angular momentum along the triplet 3 A" states and singlet 1 A' states. We find that the interplay between the electronic spin direction and the molecular geometry has a measurable influence on the singlet–triplet intersystem crossing reaction probabilities. Our results show that for some incident scattering angles in the body-fixed frame, the relative difference in intersystem crossing reaction probabilities (as determined between spin up and spin down initial states) can be as large as 15%. Furthermore, our findings are an ab initio demonstration of spin-dependent nonadiabatic dynamics, which we hope will shine light as far as understanding the chiral-induced spin selectivity effect.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effects of Size and Shape on the Tolerances for Misalignment and Probabilities for Successful Oriented Attachment of Nanoparticles

Oriented attachment (OA) of nanoparticles is an important pathway of crystal growth, but tools for quantitatively modeling OA are lacking. Here we present several simple models that relate the probability of achieving OA to basic geometric parameters such as particle size, shape, and lattice periodicity. A Moiré-domain model is applied to understand twist-misorientations between parallel surfaces, and it predicts that the range of twist angles yielding perfect OA is inversely related to the width of the contact area. This is confirmed and further developed using a surface functional model, which predicts how crystallographic registration forces drive the emergence of complex orientational energy landscapes. The energy landscapes are predicted to possess local minima that can trap particles in imperfect alignments, and these local minima become deeper and more numerous as the contact area increases, making OA more challenging for large particles. Further, a second set of models is presented to understand the sequence of events by which two crystallographic faces become co-planer after collision. We use a ‘central force approximation’ to quantitatively predict the odds of attaining coalignment between various faces when particles collide with random misalignments, and we show that in the absence of biasing forces, the probability of attaining alignment on a given face is roughly proportional to its solid angle as viewed from the center of the particle. The model predicts that OA is most favorable between well-faceted particles and becomes exceedingly unlikely for large spherical particles that express many microfacets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Applying Shannon's information theory to bacterial and phage genomes and metagenomes

All sequence data contain inherent information that can be measured by Shannon’s uncertainty theory. Such measurement is valuable in evaluating large data sets, such as metagenomic libraries, to prioritize their analysis and annotation, thus saving computational resources. Here, Shannon’s index of complete phage and bacterial genomes was examined. The information content of a genome was found to be highly dependent on the genome length, GC content, and sequence word size. In metagenomic sequences, the amount of information correlated with the number of matches found by comparison to sequence databases. A sequence with more information (higher uncertainty) has a higher probability of being significantly similar to other sequences in the database. Measuring uncertainty may be used for rapid screening for sequences with matches in available database, prioritizing computational resources, and indicating which sequences with no known similarities are likely to be important for more detailed analysis.

59 BASIC BIOLOGICAL SCIENCES↗

Simulations of frustrated Ising Hamiltonians using quantum approximate optimization

Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.

97 MATHEMATICS AND COMPUTING↗

Cluster Sampling Filters for Non-Gaussian Data Assimilation

This paper presents a fully non-Gaussian filter for sequential data assimilation. The filter is named the “cluster sampling filter”, and works by directly sampling the posterior distribution following a Markov Chain Monte-Carlo (MCMC) approach, while the prior distribution is approximated using a Gaussian Mixture Model (GMM). Specifically, a clustering step is introduced after the forecast phase of the filter, and the prior density function is estimated by fitting a GMM to the prior ensemble. Using the data likelihood function, the posterior density is then formulated as a mixture density, and is sampled following an MCMC approach. Four versions of the proposed filter, namely C ℓ MCMC , C ℓ HMC , MC- C ℓ HMC , and MC- C ℓ HMC are presented. C ℓ MCMC uses a Gaussian proposal density to sample the posterior, and C ℓ HMC is an extension to the Hamiltonian Monte-Carlo (HMC) sampling filter. MC- C ℓ MCMC and MC- C ℓ HMC are multi-chain versions of the cluster sampling filters C ℓ MCMC and C ℓ HMC respectively. The multi-chain versions are proposed to guarantee that samples are taken from the vicinities of all probability modes of the formulated posterior. The new methodologies are tested using a simple one-dimensional example, and a quasi-geostrophic (QG) model with double-gyre wind forcing and bi-harmonic friction. Here, numerical results demonstrate the usefulness of using GMMs to relax the Gaussian prior assumption especially in the HMC filtering paradigm.

97 MATHEMATICS AND COMPUTING↗

Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. Here, we use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.

97 MATHEMATICS AND COMPUTING↗

Understanding Pore Filling Processes and Adsorption/Desorption Hysteresis in Nanoporous Metal–Organic Frameworks: Insights from Grand Canonical Monte Carlo Simulations and Free Energy Calculations

Grand canonical Monte Carlo (GCMC) simulations were used to investigate pore filling and hysteresis in nanoporous metal-organic frameworks (MOFs). Adsorption and desorption isotherms were calculated for argon at 87 K in 1866 MOFs from the CoRE MOF database and for short n-alkanes in selected MOFs, keeping the adsorbent structure rigid. Analysis of the molecular configurations showed two different mechanisms and origins of hysteresis: one involving a transition of the adsorbate arrangement in the pores similar to a gas-to-liquid transition associated with a large change in the loading and one more similar to a liquid-to-solid transition associated with a relatively small change in the loading. Our GCMC simulations in MOFs with diverse pore topologies indicate exceptions to an empirical relationship for the minimum diameter of a cylindical pore required for hysteresis as a function of the adsorbate diameter and reduced temperature. The simulations reveal some structures where isotherms exhibit two steps in the adsorption branch and only one step in the desorption branch. Hysteresis loops with a different number of adsorption and desorption steps are not common. Here, to better understand why hysteresis is observed in the GCMC simulations, the concept of the transition probability for observing a step in the adsorption isotherm at a given pressure in a GCMC simulation is introduced. We used two different methods to calculate the transition probabilities and find that these yield comparable results. Furthermore, the transition probability provides a measure for the length of GCMC simulations to yield reliable results.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

Statistical properties of sites visited by independent random walks

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. Here, we consider two independent random walks on hyper-cubic lattices and study ordering probabilities associated with these characteristics. The first is the probability that during the time interval (0, t), the number of sites visited by a walker never exceeds that of another walker. The second is the probability that the sites visited by a walker remain a subset of the sites visited by another walker. Using numerical simulations, we investigate the leading asymptotic behaviors of the ordering probabilities in spatial dimensions d = 1, 2, 3, 4. We also study the time evolution of the number of ties between the number of visited sites. We show analytically that the average number of ties increases as a 1 ln t with a 1 = 0.970 508 in one dimension and as (ln t) 2 in two dimensions.

97 MATHEMATICS AND COMPUTING↗

Neural Network Astronomy as a New Tool for Observing Bright and Compact Objects

We propose a new method for solving an important problem of astronomy that arises in observations with ultrahigh-angular-resolution interferometers. This method is based on the application of the theory of artificial neural networks. We propose and compute a multiparameter model for a celestial object like Sgr A*. For this model we have numerically constructed a number of probable images for neural network training. After neural network training on these images, the quality of its operation has been tested on another series of images from the same model. We have proven that a neural network can recognize and classify celestial objects (also obtained from interferometers) virtually no worse than can be done by a human.

79 ASTRONOMY AND ASTROPHYSICS↗

Second- and Third-Order Anharmonic Effects within the Quantum Many-Body Theory

The paper presents a brief review of the results in the self-consistent theory of the anharmonic effects of the second and third orders in the phonon production amplitude, based on the quantum many-body theory. Numerical (for second-order effects) and theoretical analyses of new, i.e., three- and four-quasiparticle correlations in the ground state (backward-going graphs) in magic nuclei and in nuclei with pairing are given. A formula for the probability of transition between one- and two-phonon states is obtained and compared to the solution of a similar problem within the quasiparticle-phonon model. It is shown that the approach under consideration contains a number of new effects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Classifier-Guided Sampling for Complex Energy System Optimization

This report documents the results of a Laboratory Directed Research and Development (LDRD) effort entitled “Classifier-Guided Sampling for Complex Energy System Optimization” that was conducted during FY 2014 and FY 2015. The goal of this project was to develop, implement, and test major improvements to the classifier-guided sampling (CGS) algorithm. CGS is type of evolutionary algorithm for performing search and optimization over a set of discrete design variables in the face of one or more objective functions. Existing evolutionary algorithms, such as genetic algorithms, may require a large number of objective function evaluations to identify optimal or near-optimal solutions. Reducing the number of evaluations can result in significant time savings, especially if the objective function is computationally expensive. CGS reduces the evaluation count by using a Bayesian network classifier to filter out non-promising candidate designs, prior to evaluation, based on their posterior probabilities. In this project, both the single-objective and multi-objective versions of the CGS are developed and tested on a set of benchmark problems. As a domain-specific case study, CGS is used to design a microgrid for use in islanded mode during an extended bulk power grid outage.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Inequalities to Bound a Performance Probability

A challenging problem encountered in engineering applications is the estimation of a probability-of-failure based on incomplete knowledge of the sources of uncertainty and/or limited sampling. Theories formulated to derive upper probability bounds offer an attractive alternative because first, they avoid postulating the probability laws that are often unknown and second, they substitute numerical optimization for statistical sampling. A critical assessment of one such technique is presented. It derives upper probability bounds from the McDiarmid concentration-of-measure theory, which postulates that fluctuations of a function are more-or-less concentrated about its mean value. Three applications of this theory are presented. The first two applications analyze “toy” polynomial functions defined in two and seventeen dimensions. The upper bounds of probability are calculated and compared to sampling-based estimates of the true-but-unknown probabilities. For these functions, the upper bounds obtained are too broad to be useful. These results are confirmed by conducting a similar analysis on a real engineering system, where upper bounds of probability associated with resonant frequencies of a structural system are estimated. These frequencies are predicted by a high-fidelity finite element model that was previously validated using vibration measurements. In this third application, the uncertainty is introduced by way of material properties and the effective preload of a beam-to-column connection, modeled explicitly. These applications suggest that the theory not only leads to upper bounds that are inefficient but that can also be sub-optimal if their numerical estimation is based on too few model runs. It is concluded that this particular theory, while mathematically attractive, may not be well suited for engineering applications.

Engineering(42)↗

The time-dependent quantum harmonic oscillator revisited: Applications to quantum field theory

In this article, we formulate the study of the unitary time evolution of systems consisting of an infinite number of uncoupled time-dependent harmonic oscillators in mathematically rigorous terms. We base this analysis on the theory of a single one-dimensional time-dependent oscillator, for which we first summarize some basic results concerning the unitary implementability of the dynamics. This is done by employing techniques different from those used so far to derive the Feynman propagator. In particular, we calculate the transition amplitudes for the usual harmonic oscillator eigenstates and define suitable semiclassical states for some physically relevant models. We then explore the possible extension of this study to infinite dimensional dynamical systems. Specifically, we construct Schroedinger functional representations in terms of appropriate probability spaces, analyze the unitarity of the time evolution, and probe the existence of semiclassical states for a wide range of physical systems, particularly, the well-known Minkowskian free scalar fields and Gowdy cosmological models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using ultrasonic attenuation in cortical bone to infer distributions on pore size

Here, in this work we infer the underlying distribution on pore radius in human cortical bone samples using ultrasonic attenuation data. We first discuss how to formulate polydisperse attenuation models using a probabilistic approach and the Waterman Truell model for scattering attenuation. We then compare the Independent Scattering Approximation and the higher-order Waterman Truell models’ forward predictions for total attenuation in polydisperse samples. Following this, we formulate an inverse problem under the Prohorov Metric Framework coupled with variational regularization to stabilize this inverse problem. We then use experimental attenuation data taken from human cadaver samples and solve inverse problems resulting in nonparametric estimates of the probability density function on pore radius. We compare these estimates to the “true” microstructure of the bone samples determined via microCT imaging. We find that our methodology allows us to reliably estimate the underlying microstructure of the bone from attenuation data.

97 MATHEMATICS AND COMPUTING↗

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

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

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

97 MATHEMATICS AND COMPUTING↗

Geometry and quadratic nonlinearity of charge transfer complexes in solution: A theoretical study

In this paper, we have computed the quadratic nonlinear optical (NLO) properties of a class of weak charge transfer (CT) complexes. These weak complexes are formed when the methyl substituted benzenes (donors) are added to strong acceptors like chloranil (CHL) or di-chloro-di-cyano benzoquinone (DDQ) in chloroform or in dichloromethane. The formation of such complexes is manifested by the presence of a broad absorption maximum in the visible range of the spectrum where neither the donor nor the acceptor absorbs. The appearance of this visible band is due to CT interactions, which result in strong NLO responses. We have employed the semiempirical intermediate neglect of differential overlap (INDO/S) Hamiltonian to calculate the energy levels of these CT complexes using single and double configuration interaction (SDCI). The solvent effects are taken into account by using the self-consistent reaction field (SCRF) scheme. The geometry of the complex is obtained by exploring different relative molecular geometries by rotating the acceptor with respect to the fixed donor about three different axes. The theoretical geometry that best fits the experimental energy gaps, {beta}{sub HRS} and macroscopic depolarization ratios is taken to be the most probable geometry of the complex. Our studies show that the most probable geometry of these complexes in solution is the parallel displaced structure with a significant twist in some cases.

36 MATERIALS SCIENCE↗