Sorting methods and convergence rates for Array-RQMC: Some empirical comparisons.

Mathematics and Computers in Simulation(2018)

引用 21|浏览45
暂无评分
摘要
We review the Array-RQMC method, its variants, sorting strategies, and convergence results. We are interested in the convergence rate of measures of discrepancy of the states at a given step of the chain, as a function of the sample size n, and also the convergence rate of the variance of the sample average of a (cost) function of the state at a given step, viewed as an estimator of the expected cost. We summarize known convergence rate results and show empirical results that suggest much better convergence rates than those that are proved. We also compare different types of multivariate sorts to match the chains with the RQMC points, including a sort based on a Hilbert curve.
更多
查看译文
关键词
Low discrepancy,Quasi-Monte Carlo,Markov chain,Variance reduction,Array-RQMC
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要