Spelling suggestions: "subject:"convergence diagnostics"" "subject:"konvergence diagnostics""
1 |
Development and implementation of convergence diagnostics and acceleration methodologies in Monte Carlo criticality simulationsShi, Bo 12 December 2011 (has links)
Because of the accuracy and ease of implementation, the Monte Carlo methodology is widely used in the analysis of nuclear systems. The estimated effective multiplication factor (keff) and flux distribution are statistical by their natures. In eigenvalue problems, however, neutron histories are not independent but are correlated through subsequent generations. Therefore, it is necessary to ensure that only the converged data are used for further analysis. Discarding a larger amount of initial histories would reduce the risk of contaminating the results by non-converged data, but increase the computational expense. This issue is amplified for large nuclear systems with slow convergence. One solution would be to use the convergence of keff or the flux distribution as the criterion for initiating accumulation of data. Although several approaches have been developed aimed at identifying convergence, these methods are not always reliable, especially for slow converging problems. This dissertation has attacked this difficulty by developing two independent but related methodologies. One aims to find a more reliable and robust way to assess convergence by statistically analyzing the local flux change. The other forms a basis to increase the convergence rate and thus reduce the computational expense. Eventually, these two topics will contribute to the ultimate goal of improving the reliability and efficiency of the Monte Carlo criticality calculations.
|
2 |
Monitoring and Improving Markov Chain Monte Carlo Convergence by PartitioningVanDerwerken, Douglas January 2015 (has links)
<p>Since Bayes' Theorem was first published in 1762, many have argued for the Bayesian paradigm on purely philosophical grounds. For much of this time, however, practical implementation of Bayesian methods was limited to a relatively small class of "conjugate" or otherwise computationally tractable problems. With the development of Markov chain Monte Carlo (MCMC) and improvements in computers over the last few decades, the number of problems amenable to Bayesian analysis has increased dramatically. The ensuing spread of Bayesian modeling has led to new computational challenges as models become more complex and higher-dimensional, and both parameter sets and data sets become orders of magnitude larger. This dissertation introduces methodological improvements to deal with these challenges. These include methods for enhanced convergence assessment, for parallelization of MCMC, for estimation of the convergence rate, and for estimation of normalizing constants. A recurring theme across these methods is the utilization of one or more chain-dependent partitions of the state space.</p> / Dissertation
|
3 |
Dimension reduction of streaming data via random projectionsCosma, Ioana Ada January 2009 (has links)
A data stream is a transiently observed sequence of data elements that arrive unordered, with repetitions, and at very high rate of transmission. Examples include Internet traffic data, networks of banking and credit transactions, and radar derived meteorological data. Computer science and engineering communities have developed randomised, probabilistic algorithms to estimate statistics of interest over streaming data on the fly, with small computational complexity and storage requirements, by constructing low dimensional representations of the stream known as data sketches. This thesis combines techniques of statistical inference with algorithmic approaches, such as hashing and random projections, to derive efficient estimators for cardinality, l_{alpha} distance and quasi-distance, and entropy over streaming data. I demonstrate an unexpected connection between two approaches to cardinality estimation that involve indirect record keeping: the first using pseudo-random variates and storing selected order statistics, and the second using random projections. I show that l_{alpha} distances and quasi-distances between data streams, and entropy, can be recovered from random projections that exploit properties of alpha-stable distributions with full statistical efficiency. This is achieved by the method of L-estimation in a single-pass algorithm with modest computational requirements. The proposed estimators have good small sample performance, improved by the methods of trimming and winsorising; in other words, the value of these summary statistics can be approximated with high accuracy from data sketches of low dimension. Finally, I consider the problem of convergence assessment of Markov Chain Monte Carlo methods for simulating from complex, high dimensional, discrete distributions. I argue that online, fast, and efficient computation of summary statistics such as cardinality, entropy, and l_{alpha} distances may be a useful qualitative tool for detecting lack of convergence, and illustrate this with simulations of the posterior distribution of a decomposable Gaussian graphical model via the Metropolis-Hastings algorithm.
|
Page generated in 0.0751 seconds