Efficient construction method for phase diagrams using uncertainty sampling
نویسندگان
چکیده
منابع مشابه
Uncertainty Quantification in Rothermel’s Model Using an Efficient Sampling Method
111 Abstract—The purpose of the present work is to quantify parametric uncertainty in Rothermel’s wildland fire spread model (implemented in software such as BehavePlus3 and FARSITE), which is undoubtedly among the most widely used fire spread models in the United States. This model consists of a nonlinear system of equations that relates environmental variables (input parameter groups) such as...
متن کاملEfficient sampling techniques for uncertainty
5 The Markov Chain Monte Carlo (MCMC) is a rigorous sampling method to quan6 tify uncertainty in subsurface characterization. However, the MCMC usually requires 7 many flow and transport simulations in evaluating the posterior distribution and can be 8 computationally expensive for fine-scale geological models. We propose a methodology 9 that combines coarseand fine-scale information to improve...
متن کاملAn Efficient Sampling Algorithm for Influence Diagrams
We describe an efficient sampling algorithm for solving influence diagrams that achieves its efficiency by reusing samples for each of the decision strategies. Our algorithm is exhaustive in the sense of computing the expected utility of each of the possible decision strategies. We show how by a parallel evaluation of all strategies we not only save a significant amount of computation but also ...
متن کاملMolecular crystal global phase diagrams. I. Method of construction.
A method is described to produce global phase diagrams for single-component molecular crystals with separable internal and external modes. The phase diagrams present the equilibrium crystalline phase as a function of the coefficients of a general intermolecular potential based on rotational symmetry-adapted basis functions. It is assumed that phase transitions are driven by orientational orderi...
متن کاملI/O-Efficient Construction of Voronoi Diagrams∗
We consider the problems of computing 2and 3-d Voronoi diagrams for large data sets efficiently. We describe a cache-oblivious distribution data structure (buffer tree) that is the basis for the cache oblivious implementation of a random incremental construction for geometric problems. We then apply this to the construction of 2and 3-d Voronoi diagrams. We also describe a very simple variant of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Materials
سال: 2019
ISSN: 2475-9953
DOI: 10.1103/physrevmaterials.3.033802