A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules
arXiv:1207.5275h-index: 32
Originality Incremental advance
AI Analysis
For researchers in numerical integration and lattice rules, this method provides an efficient algorithm to compute key properties that were previously computationally expensive.
The paper introduces a fast Fourier transform method to compute the weight enumerator polynomial and trigonometric degree of lattice rules, achieving significant computational speedups.
A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules is introduced.