Bounds on the lattice rule criterion $R$
HTML articles powered by AMS MathViewer
- by Stephen Joe PDF
- Math. Comp. 61 (1993), 821-831 Request permission
Abstract:
Lattice rules are used for the numerical integration of periodic functions over the s-dimensional unit cube. They are normally classified according to their ’rank’; in simple terms, the rank of a lattice rule is the minimum number of sums required to write it down. One criterion for measuring the ’goodness’ of a lattice rule is the quantity R which is the quadrature error for a certain test function. Bounds on R exist for rank-1 and rank-2 lattice rules, but not for lattice rules of higher rank. For $1 \leq m \leq s$, we shall look at certain rank-m rules and obtain bounds on R for them. These rank-m rules have ${n^m}r$ quadrature points, where n and r are relatively prime numbers. In order to obtain these bounds, we make use of a result which shows that R may be considered to be the quadrature error obtained when a modified lattice rule with only r quadrature points is applied to a modified test function. Some numerical results are given.References
- Shaun Disney and Ian H. Sloan, Lattice integration rules of maximal rank formed by copying rank $1$ rules, SIAM J. Numer. Anal. 29 (1992), no. 2, 566–577. MR 1154284, DOI 10.1137/0729036
- Edmund Hlawka, Zur angenäherten Berechnung mehrfacher Integrale, Monatsh. Math. 66 (1962), 140–151 (German). MR 143329, DOI 10.1007/BF01387711
- S. Joe and S. A. R. Disney, Intermediate rank lattice rules for multidimensional integration, SIAM J. Numer. Anal. 30 (1993), no. 2, 569–582. MR 1211405, DOI 10.1137/0730027
- Stephen Joe and Ian H. Sloan, Imbedded lattice rules for multidimensional integration, SIAM J. Numer. Anal. 29 (1992), no. 4, 1119–1135. MR 1173189, DOI 10.1137/0729068
- Stephen Joe and Ian H. Sloan, On computing the lattice rule criterion $R$, Math. Comp. 59 (1992), no. 200, 557–568. MR 1134733, DOI 10.1090/S0025-5718-1992-1134733-2
- N. M. Korobov, Approximate evaluation of repeated integrals, Dokl. Akad. Nauk SSSR 124 (1959), 1207–1210 (Russian). MR 0104086
- Harald Niederreiter, Existence of good lattice points in the sense of Hlawka, Monatsh. Math. 86 (1978/79), no. 3, 203–219. MR 517026, DOI 10.1007/BF01659720
- Harald Niederreiter, The existence of efficient lattice rules for multidimensional numerical integration, Math. Comp. 58 (1992), no. 197, 305–314, S7–S16. MR 1106976, DOI 10.1090/S0025-5718-1992-1106976-5
- Ian H. Sloan and Philip J. Kachoyan, Lattice methods for multiple integration: theory, error analysis and examples, SIAM J. Numer. Anal. 24 (1987), no. 1, 116–128. MR 874739, DOI 10.1137/0724010
- Ian H. Sloan and James N. Lyness, The representation of lattice quadrature rules as multiple sums, Math. Comp. 52 (1989), no. 185, 81–94. MR 947468, DOI 10.1090/S0025-5718-1989-0947468-3
- Ian H. Sloan and Linda Walsh, A computer search of rank-$2$ lattice rules for multidimensional quadrature, Math. Comp. 54 (1990), no. 189, 281–302. MR 1001485, DOI 10.1090/S0025-5718-1990-1001485-4
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 821-831
- MSC: Primary 65D30
- DOI: https://doi.org/10.1090/S0025-5718-1993-1195427-1
- MathSciNet review: 1195427