Error bounds for rank 1 lattice quadrature rules modulo composites (Q2641070): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tables of good lattices in four and five dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for the Method of Good Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A table of good lattice points in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Monte Carlo methods and pseudo-random numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of good lattice points in the sense of Hlawka / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:45, 21 June 2024

scientific article
Language Label Description Also known as
English
Error bounds for rank 1 lattice quadrature rules modulo composites
scientific article

    Statements

    Error bounds for rank 1 lattice quadrature rules modulo composites (English)
    0 references
    0 references
    0 references
    1990
    0 references
    Improved estimates are established regarding the accuracy which can be achieved by a suitable choice of the generator in a single-generator lattice quadrature rule (as used in the ``method of good lattice points'') in the general case where m, the number of quadrature points, is not necessarily prime. The result obtained for the general case is asymptotically the same as the best currently-known result for the prime case. However, it is also shown that when these rules are applied to some customary test functions the mean error (over different rules with the same number of points) can be arbitrarily large compared to the corresponding mean value for rules with a comparable but prime value of m. These mean values are of interest in relation to computerized searches for good generators.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Monte Carlo method
    0 references
    single-generator lattice quadrature rule
    0 references
    method of good lattice points
    0 references
    test functions
    0 references
    mean error
    0 references