首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Three- and four-dimensional -optimal lattice rules of moderate trigonometric degree
Authors:Ronald Cools  James N Lyness
Institution:Department of Computer Science, K. U. Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium ; Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois 60439 and School of Mathematics, University of New South Wales, Sydney 2052 Australia
Abstract:

A systematic search for optimal lattice rules of specified trigonometric degree $d$ over the hypercube $0,1)^s$ has been undertaken. The search is restricted to a population $K(s,\delta)$ of lattice rules $Q(\Lambda )$. This includes those where the dual lattice $\Lambda ^\perp$may be generated by $s$ points $\bf h$ for each of which $\vert{\bf h} \vert = \delta =d+1$. The underlying theory, which suggests that such a restriction might be helpful, is presented. The general character of the search is described, and, for $s=3$, $d \leq 29$ and $s=4$, $d \leq 23$, a list of $K$-optimal rules is given. It is not known whether these are also optimal rules in the general sense; this matter is discussed.

Keywords:
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号