Spatial vs ensemble statistics for spatial simulation algorithms

被引:0
|
作者
Myers, DE [1 ]
机构
[1] Univ Arizona, Dept Math, Tucson, AZ 85721 USA
关键词
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Spatial simulation algorithms are designed to generate realizations of random functions and to reproduce statistical characteristics of the random function. In practice only a small number of realizations are generated and hence the characteristics of the realizations are more important than those of the random function. Most algorithms reproduce the statistical characteristics, such as the covariance function, mean and univariate distribution, only in an average sense. At least second order stationarity is an implicit assumption in using the algorithms. Empirical and theoretical results for convergence are given for several of the commonly used algorithms such as LU, Sequential Gaussian and Turning Bands. Simulated Annealing is an algorithm where each realization reproduces the statistical properties with large probability.
引用
收藏
页码:42 / 51
页数:10
相关论文
共 50 条