寻找可扩展的低WAFOM点集
A search for extensible low-WAFOM point sets
摘要:
Matsumoto,Saito和Matoba最近提出了Walsh品质因数(WAFOM),这是一种使用数字网络的拟蒙特卡罗方法点集的可计算准则。已经提出了几种算法来寻找低WAFOM点集。现有的算法中,点的数目是预先固定的,但在某些应用中,可扩展的点集是首选。本文提出了一种可扩展低WAFOM点集的随机搜索算法。为此,我们介绍了一种方法,使用查找表来计算WAFOM更快。数值结果表明,我们的可扩展低WAFOM点集是可比的Niederreiter-Xing序列的一些低维和光滑的检验函数。
英文摘要:
Matsumoto, Saito, and Matoba recently proposed the Walsh figure of merit (WAFOM), which is a computable criterion for quasi-Monte Carlo point sets using digital nets. Several algorithms have been proposed for finding low-WAFOM point sets. In the existing algorithms, the number of points is fixed in advance, but extensible point sets are preferred in some applications. In this paper, we propose a random search algorithm for extensible low-WAFOM point sets. For this, we introduce a method that uses lookup tables to compute WAFOM faster. Numerical results show that our extensible low-WAFOM point sets are comparable with Niederreiter--Xing sequences for some low-dimensional and smooth test functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。