Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Monte Carlo Sampling”

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 721 records · Page 40

A comparison of cosmological models using strong gravitational lensing galaxies

Strongly gravitationally lensed quasar-galaxy systems allow us to compare competing cosmologies as long as one can be reasonably sure of the mass distribution within the intervening lens. In this paper, we assemble a catalog of 69 such systems from the Sloan Lens ACS and Lens Structure and Dynamics surveys suitable for this analysis, and carry out a one-on-one comparison between the standard model, ΛCDM, and the R{sub h}=ct universe, which has thus far been favored by the application of model selection tools to other kinds of data. We find that both models account for the lens observations quite well, though the precision of these measurements does not appear to be good enough to favor one model over the other. Part of the reason is the so-called bulge-halo conspiracy that, on average, results in a baryonic velocity dispersion within a fraction of the optical effective radius virtually identical to that expected for the whole luminous-dark matter distribution modeled as a singular isothermal ellipsoid, though with some scatter among individual sources. Future work can greatly improve the precision of these measurements by focusing on lensing systems with galaxies as close as possible to the background sources. Given the limitations of doing precision cosmological testing using the current sample, we also carry out Monte Carlo simulations based on the current lens measurements to estimate how large the source catalog would have to be in order to rule out either model at a ∼99.7% confidence level. We find that if the real cosmology is ΛCDM, a sample of ∼200 strong gravitational lenses would be sufficient to rule out R{sub h}=ct at this level of accuracy, while ∼300 strong gravitational lenses would be required to rule out ΛCDM if the real universe were instead R{sub h}=ct. The difference in required sample size reflects the greater number of free parameters available to fit the data with ΛCDM. We point out that, should the R{sub h}=ct universe eventually emerge as the correct cosmology, its lack of any free parameters for this kind of work will provide a remarkably powerful probe of the mass structure in lensing galaxies, and a means of better understanding the origin of the bulge-halo conspiracy.

79 ASTRONOMY AND ASTROPHYSICS↗

Annealed Importance Sampling Reversible Jump MCMC algorithms

It will soon be 20 years since reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithms have been proposed. They have significantly extended the scope of Markov chain Monte Carlo simulation methods, offering the promise to be able to routinely tackle transdimensional sampling problems, as encountered in Bayesian model selection problems for example, in a principled and flexible fashion. Their practical efficient implementation, however, still remains a challenge. A particular difficulty encountered in practice is in the choice of the dimension matching variables (both their nature and their distribution) and the reversible transformations which allow one to define the one-to-one mappings underpinning the design of these algorithms. Indeed, even seemingly sensible choices can lead to algorithms with very poor performance. The focus of this paper is the development and performance evaluation of a method, annealed importance sampling RJ-MCMC (aisRJ), which addresses this problem by mitigating the sensitivity of RJ-MCMC algorithms to the aforementioned poor design. As we shall see the algorithm can be understood as being an “exact approximation” of an idealized MCMC algorithm that would sample from the model probabilities directly in a model selection set-up. Such an idealized algorithm may have good theoretical convergence properties, but typically cannot be implemented, and our algorithms can approximate the performance of such idealized algorithms to an arbitrary degree while not introducing any bias for any degree of approximation. Our approach combines the dimension matching ideas of RJ-MCMC with annealed importance sampling and its Markov chain Monte Carlo implementation. We illustrate the performance of the algorithm with numerical simulations which indicate that, although the approach may at first appear computationally involved, it is in fact competitive.

annealed importance sampling↗

Error Convergence Characterization for Stochastic Transport Methods

There has been increased interest in reliably and efficiently solving engineering systems involving uncertainty in recent years. Characterization of the convergence of errors within the problem, including statistical and bias errors, increases confidence that chosen solution methods are appropriate for a particular problem and quantity of interest (QoI), that implementation errors have not been made, and can aid users or algorithms in solving problems within a tolerance efficiently. We demonstrate a method for characterizing error convergence in a simple stochastic transport problem. Though the approach is applicable to problems with more complicated physics, our simple problem enables analytic QoI solutions so that error convergence behavior and the identification of limiting errors can be presented with high precision. A one-dimensional, two-material, neutral-particle, and absorption-only transport problem involving uniformly distributed uncertain total cross sections is presented. Random sampling (RS) and stochastic collocation (SC) are used as stochastic solvers which sample from the uncertain space and Monte Carlo (MC) transport is employed to solve transport results on the resulting realizations. Probability density functions (PDFs) are created using either RS solutions or samples taken from a polynomial chaos expansion (PCE) constructed with SC solutions. The convergence of each solver is characterized with respect to the QoI against analytic solutions, convergence behavior is used to efficiently solve a QoI within a tolerance, and convergence plots are used to identify dominant solution errors.

42 ENGINEERING↗

Tensor train continuous time solver for quantum impurity models

The simulation of strongly correlated quantum impurity models is a significant challenge in modern condensed matter physics that has multiple important applications. Thus far, the most successful methods for approaching this challenge involve Monte Carlo techniques that accurately and reliably sample perturbative expansions to any order. However, the cost of obtaining high precision through these methods is high. Recently, tensor train decomposition techniques have been developed as an alternative to Monte Carlo integration. In this study, we apply these techniques to the single-impurity Anderson model at equilibrium by calculating the systematic expansion in power of the hybridization of the impurity with the bath. Furthermore, we demonstrate the performance of the method in a paradigmatic application, examining the first-order phase transition on the infinite-dimensional Bethe lattice, which can be mapped to an impurity model through dynamical mean field theory. Our results indicate that using tensor train decomposition schemes allows the calculation of finite-temperature Green's functions and thermodynamic observables with unprecedented accuracy. The methodology holds promise for future applications to frustrated multiorbital systems, using a combination of partially summed series with other techniques pioneered in diagrammatic and continuous time quantum Monte Carlo.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

TU-AB-BRC-11: Moving a GPU-OpenCL-Based Monte Carlo (MC) Dose Engine Towards Routine Clinical Use: Automatic Beam Commissioning and Efficient Source Sampling

Purpose: We have previously developed a GPU-OpenCL-based MC dose engine named goMC with built-in analytical linac beam model. To move goMC towards routine clinical use, we have developed an automatic beam-commissioning method, and an efficient source sampling strategy to facilitate dose calculations for real treatment plans. Methods: Our commissioning method is to automatically adjust the relative weights among the sub-sources, through an optimization process minimizing the discrepancies between calculated dose and measurements. Six models built for Varian Truebeam linac photon beams (6MV, 10MV, 15MV, 18MV, 6MVFFF, 10MVFFF) were commissioned using measurement data acquired at our institution. To facilitate dose calculations for real treatment plans, we employed inverse sampling method to efficiently incorporate MLC leaf-sequencing into source sampling. Specifically, instead of sampling source particles control-point by control-point and rejecting the particles blocked by MLC, we assigned a control-point index to each sampled source particle, according to MLC leaf-open duration of each control-point at the pixel where the particle intersects the iso-center plane. Results: Our auto-commissioning method decreased distance-to-agreement (DTA) of depth dose at build-up regions by 36.2% averagely, making it within 1mm. Lateral profiles were better matched for all beams, with biggest improvement found at 15MV for which root-mean-square difference was reduced from 1.44% to 0.50%. Maximum differences of output factors were reduced to less than 0.7% for all beams, with largest decrease being from1.70% to 0.37% found at 10FFF. Our new sampling strategy was tested on a Head&Neck VMAT patient case. Achieving clinically acceptable accuracy, the new strategy could reduce the required history number by a factor of ∼2.8 given a statistical uncertainty level and hence achieve a similar speed-up factor. Conclusion: Our studies have demonstrated the feasibility and effectiveness of our auto-commissioning approach and new efficient source sampling strategy, implying the potential of our GPU-based MC dose engine goMC for routine clinical use.

61 RADIATION PROTECTION AND DOSIMETRY↗

Data–driven model reduction for the Bayesian solution of inverse problems

One of the prime challenges in the Bayesian solution of inverse problems governed by partial differential equations (PDEs) is the computational cost of repeatedly evaluating numerical PDE models, as required by Markov chain Monte Carlo (MCMC) methods for posterior sampling. This paper presents a data-driven projection-based model reduction technique to reduce this computational cost. The proposed technique has two distinctive features. To begin, the model reduction strategy is tailored to inverse problems: the snapshots used to construct the reduced-order model are computed adaptively from the posterior distribution. Posterior exploration and model reduction are thus pursued simultaneously. Second, to avoid repeated evaluations of the full-scale numerical model as in a standard MCMC method, we couple the full-scale model and the reduced-order model together in the MCMC algorithm. This maintains accurate inference while reducing its overall computational cost. In numerical experiments considering steady-state flow in a porous medium, the data-driven reduced-order model achieves better accuracy than a reduced-order model constructed using the classical approach. It also improves posterior sampling efficiency by several orders of magnitude compared with a standard MCMC method.

97 MATHEMATICS AND COMPUTING↗

Influence of substrate pattern on the adsorption of HP lattice proteins

With the highly simplified hydrophobic-polar model representation of a protein, we can study essential qualitative physics without an unnecessarily large computational overhead. Using Wang-Landau sampling in conjunction with a set of efficient Monte Carlo trial moves, we studied the adsorption of short HP lattice proteins on various simple patterned substrates and in particular for checkered patterned surfaces. In this work, a set of single-site mutated HP proteins is used to investigate the role of hydrophobicity of a protein chain and surface pattern for substrates with various pattern cell sizes relative to the protein’s native configuration. For most cases, we found that the adsorption transition occurs at a lower temperature, while the hydrophobic core formation is less affected. Additionally, the flattening procedure after the HP protein is adsorbed is more sensitive to the change in surface patterns and single-site mutations. These observations stay valid for both strongly and weakly attractive surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving a mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.

97 MATHEMATICS AND COMPUTING↗

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗

Fuel temperature reactivity coefficient calculation by Monte Carlo perturbation techniques

We present an efficient method to estimate the fuel temperature reactivity coefficient (FTC) by the Monte Carlo adjoint-weighted correlated sampling method. In this method, a fuel temperature change is regarded as variations of the microscopic cross sections and the temperature in the free gas model which is adopted to correct the asymptotic double differential scattering kernel. The effectiveness of the new method is examined through the continuous energy MC neutronics calculations for PWR pin cell problems. The isotope-wise and reaction-type-wise contributions to the FTCs are investigated for two free gas models - the constant scattering cross section model and the exact model. It is shown that the proposed method can efficiently predict the reactivity change due to the fuel temperature variation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Sampling Speeds from a Relativistic Maxwell Distribution

Monte Carlo calculations in astrophysics or other fields of physics involving hot ionized gases may require sarmpling from a relativistic Maxwellian distribution. Winslow 4 described a previously unpublished technique attributed to Von Neumann for such sampling. The technique, based on an approxir.,ation to the relativistic equation, seems adequate 2 for temperatures up to about 1/4 the rest energy (i.e., kT$\sim\atop{<}$ $\frac{mc^2}{4}$) except for inherent inaccuracies in the high energy tail. For much higher temperatures, the approximation is clearly in error. It is the purpose of this paper to give a method for sampling from a relativistic Maxwellian distribution which is mathematically exact and valid for all temperatures. Most (or all) the mathematics involved is scattered through the literature on probability theory. But since many of the arguments are perhaps new to the prospective Monte Carlo user, we have included, for the sake of completeness, a good deal of mathematical rigor in the report.

97 MATHEMATICS AND COMPUTING↗

Stochastic, real-space, imaginary-time evaluation of third-order Feynman–Goldstone diagrams

A new, alternative set of interpretation rules of Feynman–Goldstone diagrams for many-body perturbation theory is proposed, which translates diagrams into algebraic expressions suitable for direct Monte Carlo integrations. A vertex of a diagram is associated with a Coulomb interaction (rather than a two-electron integral) and an edge with the trace of a Green's function in real space and imaginary time. With these, 12 diagrams of third-order many-body perturbation (MP3) theory are converted into 20-dimensional integrals, which are then evaluated by a Monte Carlo method. It uses redundant walkers for convergence acceleration and a weight function for importance sampling in conjunction with the Metropolis algorithm. The resulting Monte Carlo MP3 method has low-rank polynomial size dependence of the operation cost, a negligible memory cost, and a naturally parallel computational kernel, while reproducing the correct correlation energies of small molecules within a few mE{sub h} after 10{sup 6} Monte Carlo steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SUNYAEV-ZEL'DOVICH EFFECT OBSERVATIONS OF STRONG LENSING GALAXY CLUSTERS: PROBING THE OVERCONCENTRATION PROBLEM

We have measured the Sunyaev-Zel'dovich (SZ) effect for a sample of 10 strong lensing selected galaxy clusters using the Sunyaev-Zel'dovich Array (SZA). The SZA is sensitive to structures on spatial scales of a few arcminutes, while the strong lensing mass modeling constrains the mass at small scales (typically <30''). Combining the two provides information about the projected concentrations of the strong lensing clusters. The Einstein radii we measure are twice as large as expected given the masses inferred from SZ scaling relations. A Monte Carlo simulation indicates that a sample randomly drawn from the expected distribution would have a larger median Einstein radius than the observed clusters about 3% of the time. The implied overconcentration has been noted in previous studies and persists for this sample, even when we take into account that we are selecting large Einstein radius systems, suggesting that the theoretical models still do not fully describe the observed properties of strong lensing clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Aleatoric and epistemic uncertainties in sampling based nuclear data uncertainty and sensitivity analyses

Sampling based uncertainty and sensitivity analyses due to epistemic input uncertainties, i.e. to an incomplete knowledge of uncertain input parameters, can be performed with arbitrary application programs to solve the physical problem under consideration. For the description of steady-state particle transport, direct simulations of the microscopic processes with Monte Carlo codes are often used. This introduces an additional source of uncertainty, the aleatoric sampling uncertainty, which is due to the randomness of the simulation process performed by sampling, and which adds to the total combined output sampling uncertainty. So far, this aleatoric part of uncertainty is minimized by running a sufficiently large number of Monte Carlo histories for each sample calculation, thus making its impact negligible as compared to the impact from sampling the epistemic uncertainties. Obviously, this process may cause high computational costs. The present paper shows that in many applications reliable epistemic uncertainty results can also be obtained with substantially lower computational effort by performing and analyzing two appropriately generated series of samples with much smaller number of Monte Carlo histories each. The method is applied along with the nuclear data uncertainty and sensitivity code package XSUSA in combination with the Monte Carlo transport code KENO-Va to various critical assemblies and a full scale reactor calculation. It is shown that the proposed method yields output uncertainties and sensitivities equivalent to the traditional approach, with a high reduction of computing time by factors of the magnitude of 100. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO{sub 2}(110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

First-epoch VLBA imaging of 20 new TeV blazars

We present Very Long Baseline Array (VLBA) images of 20 TeV blazars not previously well studied on the parsec scale. All 20 of these sources are high-frequency peaked BL Lac objects (HBLs). Observations were made between August and December of 2013 at a frequency of 8.4 GHz. These observations represent the first epoch of a VLBA monitoring campaign on these blazars, and they significantly increase the fraction of TeV HBLs studied with high-resolution imaging. The peak very long baseline interferometry (VLBI) flux densities of these sources range from ∼10 to ∼100 mJy bm{sup –1}, and parsec-scale jet structure is detected in all sources. About half of the VLBI cores are resolved, with brightness temperature upper limits of a few times 10{sup 10} K, and we find that a brightness temperature of ∼2 × 10{sup 10} K is consistent with the VLBI data for all but one of the sources. Such brightness temperatures do not require any relativistic beaming to reduce the observed value below commonly invoked intrinsic limits; however, the lack of detection of counterjets does place a modest limit on the bulk Lorentz factor of γ ≳ 2. These data are thus consistent with a picture where weak-jet sources like the TeV HBLs develop significant velocity structures on parsec scales. We also extend consideration to the full sample of TeV HBLs by combining the new VLBI data with VLBI and gamma-ray data from the literature. By comparing measured VLBI and TeV fluxes to samples with intrinsically uncorrelated luminosities generated by Monte Carlo simulations, we find a marginally significant correlation between the VLBI and TeV fluxes for the full TeV HBL sample.

79 ASTRONOMY AND ASTROPHYSICS↗

Cosmic ray sampling of a clumpy interstellar medium

How cosmic rays sample the multi-phase interstellar medium (ISM) in starburst galaxies has important implications for many science goals, including evaluating the cosmic ray calorimeter model for these systems, predicting their neutrino fluxes, and modeling their winds. Here, we use Monte Carlo simulations to study cosmic ray sampling of a simple, two-phase ISM under conditions similar to those of the prototypical starburst galaxy M82. The assumption that cosmic rays sample the mean density of the ISM in the starburst region is assessed over a multi-dimensional parameter space where we vary the number of molecular clouds, the galactic wind speed, the extent to which the magnetic field is tangled, and the cosmic ray injection mechanism. We evaluate the ratio of the emissivity from pion production in molecular clouds to the emissivity that would be observed if the cosmic rays sampled the mean density, and seek areas of parameter space where this ratio differs significantly from unity. The assumption that cosmic rays sample the mean density holds over much of parameter space; however, this assumption begins to break down for high cloud density, injection close to the clouds, and a very tangled magnetic field. We conclude by evaluating the extent to which our simulated starburst region behaves as a proton calorimeter and constructing the time-dependent spectrum of a burst of cosmic rays.

79 ASTRONOMY AND ASTROPHYSICS↗

Estimating the Rate of Occurrence of Renal Stones in Astronauts

Changes in urine chemistry, during and post flight, potentially increases the risk of renal stones in astronauts. Although much is known about the effects of space flight on urine chemistry, no inflight incidence of renal stones in US astronauts exists and the question "How much does this risk change with space flight?" remains difficult to accurately quantify. In this discussion, we tackle this question utilizing a combination of deterministic and probabilistic modeling that implements the physics behind free stone growth and agglomeration, speciation of urine chemistry and published observations of population renal stone incidences to estimate changes in the rate of renal stone presentation. The modeling process utilizes a Population Balance Equation based model developed in the companion IWS abstract by Kassemi et al. (2016) to evaluate the maximum growth and agglomeration potential from a specified set of urine chemistry values. Changes in renal stone occurrence rates are obtained from this model in a probabilistic simulation that interrogates the range of possible urine chemistries using Monte Carlo techniques. Subsequently, each randomly sampled urine chemistry undergoes speciation analysis using the well-established Joint Expert Speciation System (JESS) code to calculate critical values, such as ionic strength and relative supersaturation. The Kassemi model utilizes this information to predict the mean and maximum stone size. We close the assessment loop by using a transfer function that estimates the rate of stone formation from combining the relative supersaturation and both the mean and maximum free stone growth sizes. The transfer function is established by a simulation analysis which combines population stone formation rates and Poisson regression. Training this transfer function requires using the output of the aforementioned assessment steps with inputs from known non-stone-former and known stone-former urine chemistries. Established in a Monte Carlo system, the entire renal stone analysis model produces a probability distribution of the stone formation rate and an expected uncertainty in the estimate. The utility of this analysis will be demonstrated by showing the change in renal stone occurrence predicted by this method using urine chemistry distributions published in Whitson et al. 2009. A comparison to the model predictions to previous assessments of renal stone risk will be used to illustrate initial validation of the model.

gravitational physiology↗