加载中…
Dick proved that all order digital nets satisfy optimal upper bounds of the -discrepancy. We give an alternative proof for this fact using Haar bases. Furthermore, we prove that all digital nets satisfy optimal upper bounds of the -discrepancy for a certain parameter range and enlarge that range for order digitals nets. -, - and -discrepancy is considered as well.

生成讲解博客的中文版本

生成AI智能校验的中文版本