Good low degree rank-1 lattice rules of high dimension
From MaRDI portal
Publication:2796020
DOI10.1090/mcom3047zbMath1335.65005OpenAlexW1969766104MaRDI QIDQ2796020
Publication date: 23 March 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom3047
Monte Carlo methods (65C05) Trigonometric approximation (42A10) Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zur angenäherten Berechnung mehrfacher Integrale
- Tables of good lattices in four and five dimensions
- Lattice methods for multiple integration
- Theorems in the additive theory of numbers
- A search program for finding optimal integration lattices
- An algorithm for finding optimal integration lattices of composite order
- Kubaturformeln mit minimaler Knotenzahl
- A table of good lattice points in three dimensions
- Five- and six-dimensional lattice rules generated by structured matrices
- Three- and four-dimensional 𝐾-optimal lattice rules of moderate trigonometric degree
- Component-by-component construction of good lattice rules
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Solving a linear equation in a set of integers I
- Four-dimensional lattice rules generated by skew-circulant matrices
- Minimal cubature formulae of trigonometric degree
- Five-dimensional $K$-optimal lattice rules
- An inequality for B2-sequences
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
This page was built for publication: Good low degree rank-1 lattice rules of high dimension
