arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.0168math.NAcs.NA
收藏

Walsh 指数用于数字网格:一种易于计算的高阶收敛QMC度量

Walsh Figure of Merit for Digital Nets: An Easy Measure for Higher Order Convergent QMC

Graduate School of Sciences, Hiroshima University(广岛大学研究生院);Fujitsu Laboratories Ltd.(富士通实验室有限公司)

Makoto Matsumoto, Ryuichi Ohori

AI总结:

本文提出Walsh指数作为评估QMC点集收敛性的指标,通过实验验证其在四维和八维积分中的高阶收敛性。

摘要:

本文提出Walsh指数作为评估QMC点集收敛性的指标,通过实验验证其在四维和八维积分中的高阶收敛性。

英文摘要:

Fix an integer $s$. Let $f:[0,1)^s \to \mathbb R$ be an integrable function. Let $P\subset [0,1]^s$ be a finite point set. Quasi-Monte Carlo integration of $f$ by $P$ is the average value of $f$ over $P$ that approximates the integration of $f$ over the $s$-dimensional cube. Koksma-Hlawka inequality tells that, by a smart choice of $P$, one may expect that the error decreases roughly $O(N^{-1}(\log N)^s)$. For any $α\geq 1$, J.\ Dick gave a construction of point sets such that for $α$-smooth $f$, convergence rate $O(N^{-α}(\log N)^{sα})$ is assured. As a coarse version of his theory, M-Saito-Matoba introduced Walsh figure of Merit (WAFOM), which gives the convergence rate $O(N^{-C\log N/s})$. WAFOM is efficiently computable. By a brute-force search of low WAFOM point sets, we observe a convergence rate of order $N^{-α}$ with $α>1$, for several test integrands for $s=4$ and $8$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑