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

Chebyshev-Frolov格点的轴对齐盒子中的计数

Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes

The University of New South Wales(新南威尔士大学)

Kosuke Suzuki, Takehito Yoshiki

AI总结:

本文提出了一种新的算法,用于在d=2^n时高效计数Chebyshev-Frolov格点,以提升立方求积公式的收敛率。

摘要:

对于正整数d,d维Chebyshev-Frolov格点是R^d中的Z-格点,由与d维Chebyshev多项式根相关的Vandermonde矩阵生成。当d=2^n时,对Chebyshev-Frolov格点在轴对齐盒子中的计数非常重要,因为这些点用于Frolov的立方求积公式,该公式在许多具有有界混合导数和紧支撑的空间中实现最优收敛率。Kacwin、Oettershagen和Ullrich现有的此类点计数算法在维度d=16时效率较高。在本文中,我们提出了一种新的计数算法,适用于d=2^n,效率可提升至d=32。

英文摘要:

For a positive integer $d$, the $d$-dimensional Chebyshev-Frolov lattice is the $\mathbb{Z}$-lattice in $\mathbb{R}^d$ generated by the Vandermonde matrix associated to the roots of the $d$-dimensional Chebyshev polynomial. It is important to enumerate the points from the Chebyshev-Frolov lattices in axis-parallel boxes when $d = 2^n$ for a non-negative integer $n$, since the points are used for the nodes of Frolov's cubature formula, which achieves the optimal rate of convergence for many spaces of functions with bounded mixed derivatives and compact support. The existing enumeration algorithm for such points by Kacwin, Oettershagen and Ullrich is efficient up to dimension $d=16$. In this paper we suggest a new enumeration algorithm of such points for $d=2^n$, efficient up to $d=32$.

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

↑