Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
12 - Construction of a rank-1 lattice sequence based on primitive polynomials
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 204 - 215Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , and , Constructing embedded lattice rules for multivariate integration. SIAM J. Sci. Comput. 28, 2162–2188, 2006.Google Scholar
[2] and , Randomization of number theoretic methods for multiple integration. SIAM J. Numer. Anal. 13, 904–914, 1976.Google Scholar
[3] , and , The construction of good extensible rank-1 lattices. Math. Comp. 77, 2345–2373, 2008.Google Scholar
[4] and , Fast generation of randomized low-discrepancy point sets. In: , and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 257–273. Springer, 2002.
[6] , and , Enumerating quasi-Monte Carlo point sequences in elementary intervals. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 399–408. Springer, 2012.
[7] and , Computing multivariate normal probabilities using rank-1 lattice sequences. In: , , and (eds.), Proceedings of the Workshop on Scientific Computing in Hong Kong, pp. 209–215. Springer Verlag, Singapore, 1997.
[8] and , The existence of good extensible rank-1 lattices. J. Complexity 19, 286–300, 2003.Google Scholar
[9] , , and , Extensible lattice sequences for quasi-Monte Carlo quadrature. SIAM J. Sci. Comput. 22, 1117–1138, 2001.Google Scholar
[10] and , Constructing Sobol' sequences with better two-dimensional projections. SIAM J. Sci. Comput. 30(5), 2635–2654, 2008.Google Scholar
[11] , Quasi-Monte Carlo image synthesis in a nutshell. In: , , and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2012, pp. 203–238. Springer, Heidelberg, 2013.
[12] and , Parallel quasi-Monte Carlo integration by partitioning low discrepancy sequences. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 487–498. Springer, 2012.
[13] and , Efficient multidimensional sampling (Proc. Eurographics 2002). Comput. Graphics Forum 21(3), 557–563, 2002.Google Scholar
[14] and , Constructing adapted lattice rules using problem-dependent criteria. Proceedings of the 2012 Winter Simulation Conference, pp. 373–384. IEEE Press, New York, 2012.
[15] and , Latticebuilder: a general software tool for constructing rank-1 lattice rules. ACM Trans. Math. Software, submitted 2012.Google Scholar
[16] and , Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge, 1986.
[17] , Contributions to the theory of error reduction in quasi-Monte Carlo methods. PhD Thesis, Claremont Graduate School, 1980.
[18] , and , Accelerating the convergence of lattice methods by importance sampling-based transformations. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 557–572. Springer, 2012.
[19] , Quasirandom sampling in computer graphics. Proceedings 3rd International Seminar on Digital Image Processing in Medicine, Remote Sensing and Visualization of Information (Riga, Latvia), pp. 29–34, 1992.Google Scholar
[20] , Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, PA, 1992.
[21] and , Construction algorithms for good extensible lattice rules. Construct. Approx 30, 361–393, 2009.Google Scholar
[22] , Monte Carlo extension of quasi-Monte Carlo. Proceedings of the 1998 Winter Simulation Conference, pp. 571–577. IEEE Press, New York, 1998.
[23] and , SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator. In: , and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 607–622. Springer, 2007.
[24] and , Primitive polynomial generation algorithms implementation and performance analysis. Technical Report, Stanford University, Center for Reliable Computing (CRC), TR 04-03, 2004.
[25] and , Lattice Methods for Multiple Integration. Clarendon Press, Oxford, 1994.
[26] , On the Distribution of points in a cube and the approximate evaluation of integrals. Zh. Vychisl. Mat. Mat. Fiz. 7(4), 784–802, 1967.Google Scholar
- 1
- Cited by