AbstractFor periodic integrands with unit period in each variable, certain error bounds for lattice rules are conveniently characterised by the figure of merit ρ, which was originally introduced in the context of number theoretic rules. The problem of finding good rules of order N (that is, having N distinct nodes) then becomes that of finding rules with large values of ρ. This paper presents efficient search methods for the discovery of rank 1 rules, and of maximal rank rules of high order, which possess good figures of merit
We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for t...
AbstractWe establish results on the worst-case errors that can be achieved by well-chosen lattice ru...
We introduce a criterion for the evaluation of multidimensional quadrature, or cu-bature, rules for ...
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 ...
Lattice quadrature rules were introduced by Frolov (1977), Sloan (1985) and Sloan and Kachoyan (1987...
The upper class of a lattice rule is a convenient entity for classification and other purposes. The ...
We introduce a new software tool and library named Lattice Builder, written in C++, that implements ...
Lattice rules are quasi-Monte Carlo methods for numerical multiple integration that are based on the...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
We study the problem of constructing good intermediate-rank lattice rules in the sense of having a l...
AbstractWe develop algorithms to construct rank-1 lattice rules in weighted Korobov spaces of period...
We give an explicit formula for the figure of merit ρN of 2-dimensional rank 2 lattice rules in term...
We study the problem of constructing rank- lattice rules which have good bounds on the ``weighted s...
The ‘goodness’ of a set of quadrature points in [0, 1]d may be measured by the weighted star discrep...
We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for t...
AbstractWe establish results on the worst-case errors that can be achieved by well-chosen lattice ru...
We introduce a criterion for the evaluation of multidimensional quadrature, or cu-bature, rules for ...
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 ...
Lattice quadrature rules were introduced by Frolov (1977), Sloan (1985) and Sloan and Kachoyan (1987...
The upper class of a lattice rule is a convenient entity for classification and other purposes. The ...
We introduce a new software tool and library named Lattice Builder, written in C++, that implements ...
Lattice rules are quasi-Monte Carlo methods for numerical multiple integration that are based on the...
In this paper some of the results of a recent computer search [CoLy99] for optimal three- and four-d...
We study the problem of constructing good intermediate-rank lattice rules in the sense of having a l...
AbstractWe develop algorithms to construct rank-1 lattice rules in weighted Korobov spaces of period...
We give an explicit formula for the figure of merit ρN of 2-dimensional rank 2 lattice rules in term...
We study the problem of constructing rank- lattice rules which have good bounds on the ``weighted s...
The ‘goodness’ of a set of quadrature points in [0, 1]d may be measured by the weighted star discrep...
We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for t...
AbstractWe establish results on the worst-case errors that can be achieved by well-chosen lattice ru...
We introduce a criterion for the evaluation of multidimensional quadrature, or cu-bature, rules for ...