Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.5257

Conditional Multilevel Monte Carlo Simulation of Groundwater Flow in the Culebra Dolomite at the Waste Isolation Pilot Plant (WIPP) Site

M. Park·K. A. Cliffe
View original source ↗Read source document ↗Export metadata ↓

Abstract

We extended the multilevel Monte of Carlo (MLMC) approach to simulation of groundwater flow in porous media by incorporating direct measurements of medium properties. Numerical simulations of Waste Isolation Pilot Plant (WIPP) repository in southeastern New Mexico are performed to test the performance of the conditional MLMC technique. The log-transmissivity of WIPP site is modeled as the conditional random fields which honor exact field values at a few locations. The conditional random fields are generated through the modified circulant embedding methods in (Dietrich and Newsam, 1996). We also study effects of a combination of the conditional MLMC accompanied by antithetic variates. The main quantity of interest is the time of radionuclides travelling from the center of repository to the site boundary. Numerical examples are presented to demonstrate the cost-effectiveness of the multilevel approach in comparison to the standard Monte Carlo (MC) simulation.

Explore related subjects

stat.COstat.AP

Keep this discovery

BibTeXRIS

M. Park, K. A. Cliffe. 2014-02-21. Conditional Multilevel Monte Carlo Simulation of Groundwater Flow in the Culebra Dolomite at the Waste Isolation Pilot Plant (WIPP) Site. https://arxiv.org/abs/1402.5257

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗