Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915645689430016 |
|---|---|
| author | Suzuki, Kosuke Yoshiki, Takehito |
| author_facet | Suzuki, Kosuke Yoshiki, Takehito |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1612_05342 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes Suzuki, Kosuke Yoshiki, Takehito Numerical Analysis 11P21, 11Y16, 65D30, 65D32 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$. |
| title | Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes |
| topic | Numerical Analysis 11P21, 11Y16, 65D30, 65D32 |
| url | https://arxiv.org/abs/1612.05342 |