A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules
Josef Dick
TL;DR
This paper introduces a fast Fourier transform method to efficiently compute the weight enumerator polynomial and trigonometric degree of lattice rules, enhancing computational speed and accuracy.
Contribution
The paper presents a novel FFT-based approach specifically designed for calculating key properties of lattice rules, improving upon existing methods.
Findings
Significantly reduces computation time for weight enumerator polynomial
Accurately determines the trigonometric degree of lattice rules
Demonstrates efficiency over traditional algorithms
Abstract
A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules is introduced.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Mathematical functions and polynomials · Digital Image Processing Techniques