基于$b$的平面网构造算法
Construction algorithms for plane nets in base $b$
摘要：
在基$b$中的$(0,m,s)$ -网类已经由Niederreiter作为具有优良均匀分布性质的$s$维单位立方体中的点集的例子而引入。特别是这种蚊帐已被证明具有非常低的差异。这个性质对于在数值积分的拟蒙特卡罗方法规则中使用网是必不可少的。本文提出了在基~ $b$中构造平面$(0,m,2)$ -网的两个算法。
英文摘要：
The class of $(0,m,s)$-nets in base $b$ has been introduced by Niederreiter as examples of point sets in the $s$-dimensional unit cube with excellent uniform distribution properties. In particular such nets have been proved to have very low discrepancy. This property is essential for the use of nets in quasi-Monte Carlo rules for numerical integration. In this short note we propose two algorithms for the construction of plane $(0,m,2)$-nets in base~$b$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
