The Existence of Good Extensible Polynomial Lattice Rules

Monatshefte fur Mathematik

Volumn 139, Issue 4, 2003, Pages 295-307

  Niederreiter, Harald ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Digital nets; Lattice rules; Polynomial lattice rules; Quasi Monte Carlo methods

Indexed keywords

EID: 0345492044     PISSN: 00269255     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00605-002-0530-z     Document Type: Article

References (19)

1. Hansen T, Mullen GL, Niederreiter H (1993) Good parameters for a class of node sets in quasi-Monte Carlo integration. Math Comp 61: 225-234
2. Hickernell FJ, Hong HS, L'Ecuyer P, Lemieux C (2000) Extensible lattice sequences for quasi-Monte Carlo quadrature. SIAM J Sci Comput 22: 1117-1138
3. Hickernell FJ, Niederreiter H (2002) The existence of good extensible rank-1 lattices. J Complexity (to appear)
4. Larcher G (1993) Nets obtained from rational functions over finite fields. Acta Arith 63: 1-13
5. Larcher G, Lauß A, Niederreiter H, Schmid WCh (1996) Optimal polynomials for (t, m, s)-nets and numerical integration of multivariate Walsh series. SIAM J Numer Analysis 33: 2239-2253
6. Larcher G, Niederreiter H (1995) Generalized (t, s)-sequences, Kronecker-type sequences, and diophantine approximations of formal Laurent series. Trans Amer Math Soc 347: 2051-2073
7. L'Ecuyer P, Lemieux C (2002) Recent advances in randomized quasi-Monte Carlo methods. In: Dror M, L'Ecuyer P, Szidarovszky F (eds) Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, pp 419-474. Boston: Kluwer
8. Lemieux C, L'Ecuyer P (2001) Randomized polynomial lattice rules for multivariate integration and simulation. SIAM J Sci Comput (to appear)
9. Lidl R, Niederreiter H (1994) Introduction to Finite Fields and Their Applications, rev edn. Cambridge: Univ Press
10. Niederreiter H (1978) Existence of good lattice points in the sense of Hlawka. Monatsh Math 86: 203-219
11. Niederreiter H (1986) Low-discrepancy point sets. Monatsh Math 102: 155-167
12. Niederreiter H (1992) Low-discrepancy point sets obtained by digital constructions over finite fields. Czechoslovak Math J 42: 143-166
13. Niederreiter H (1992) Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia: SIAM
14. Niederreiter H (1993) Finite fields, pseudorandom numbers, and quasirandom points. In: Mullen GL, Shiue PJ-S (eds) Finite Fields, Coding Theory, and Advances in Communications and Computing, pp 375-394. New York: Dekker
15. Niederreiter H (1993) Improved error bounds for lattice rules. J Complexity 9: 60-75
16. Pirsic G, Schmid WCh (2001) Calculation of the quality parameter of digital nets and application to their construction. J Complexity 17: 827-839
17. Schmid WC (2000) Improvements and extensions of the "Salzburg tables" by using irreducible polynomials. In: Niederreiter H, Spanier J (eds) Monte Carlo and Quasi-Monte Carlo Methods 1998, pp 436-447. Berlin: Springer
18. Sloan IH, Joe S (1994) Lattice Methods for Multiple Integration. Oxford: Oxford University Press
19. Tezuka S (1993) Polynomial arithmetic analogue of Halton sequences. ACM Trans Modeling and Computer Simulation 3: 99-107