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, δ) of lattice rules Q(Λ). This includes those where the dual lattice Λ ⊥ may be generated by s points h for each of which |h | = δ = 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 ≤ 29 and s =4,d ≤ 21, 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. 1
AbstractWe consider lattice rules (i.e. cubature formulas with equal coefficients whose nodes lie on...
Abstract For periodic integrands with unit period in each variable certain error bounds for lattic...
AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice ...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
AbstractWe describe the results of a computer-based search for five and six-dimensional lattice rule...
AbstractAn elementary introduction to lattices, integration lattices and lattice rules is followed b...
We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for t...
AbstractWe describe the results of a computer-based search for five and six-dimensional lattice rule...
Lattice rules are a type of integration rules designed for periodic multivariate functions on a unit...
We introduce a criterion for the evaluation of multidimensional quadrature, or cu-bature, rules for ...
AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice ...
The search for cost-effective lattice rules is a time-consuming and difficult process. After a brief...
AbstractAn elementary introduction to lattices, integration lattices and lattice rules is followed b...
Lattice rules are quasi-Monte Carlo methods for numerical multiple integration that are based on the...
AbstractWe consider lattice rules (i.e. cubature formulas with equal coefficients whose nodes lie on...
Abstract For periodic integrands with unit period in each variable certain error bounds for lattic...
AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice ...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
AbstractWe describe the results of a computer-based search for five and six-dimensional lattice rule...
AbstractAn elementary introduction to lattices, integration lattices and lattice rules is followed b...
We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for t...
AbstractWe describe the results of a computer-based search for five and six-dimensional lattice rule...
Lattice rules are a type of integration rules designed for periodic multivariate functions on a unit...
We introduce a criterion for the evaluation of multidimensional quadrature, or cu-bature, rules for ...
AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice ...
The search for cost-effective lattice rules is a time-consuming and difficult process. After a brief...
AbstractAn elementary introduction to lattices, integration lattices and lattice rules is followed b...
Lattice rules are quasi-Monte Carlo methods for numerical multiple integration that are based on the...
AbstractWe consider lattice rules (i.e. cubature formulas with equal coefficients whose nodes lie on...
Abstract For periodic integrands with unit period in each variable certain error bounds for lattic...
AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice ...