A search for short-period Tausworthe generators over Fb with application to Markov chain quasi-Monte Carlo

References

• Liao JG. Variance reduction in Gibbs sampler using quasi random numbers. J Comput Graphical Stat. 1998;7(3):253–266. doi: 10.1080/10618600.1998.10474775.
   Web of Science ®Google Scholar
• Owen AB, Tribble SD. A quasi-Monte Carlo Metropolis algorithm. Proc Natl Acad Sci USA. 2005;102(25):8844–8849. doi: 10.1073/pnas.0409596102
   PubMed Web of Science ®Google Scholar
• Chen S, Dick J, Owen AB. Consistency of Markov chain quasi-Monte Carlo on continuous state spaces. Ann Statist. 2011;39(2):673–701. doi: 10.1214/10-AOS831
   Web of Science ®Google Scholar
• Levin MB. Discrepancy estimates of completely uniformly distributed and pseudorandom number sequences. Int Math Res Notices. 1999;1999(22):1231–1251. doi: 10.1155/S1073792899000677
   Web of Science ®Google Scholar
• Tribble SD, Owen AB. Construction of weakly CUD sequences for MCMC sampling. Electron J Stat. 2008;2:634–660. doi: 10.1214/07-EJS162
   Web of Science ®Google Scholar
• Tribble SD. Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences [Thesis (Ph.D.)]. Ann Arbor (MI): ProQuest LLC; Stanford University; 2007.
   Google Scholar
• Chen S, Matsumoto M, Nishimura T, et al. New inputs and methods for Markov chain quasi-Monte Carlo. In: Monte Carlo and quasi-Monte Carlo methods 2010. Berlin, Heidelberg: Springer; 2012. p. 313–327. (Springer proc. math. stat.; vol. 23).
   Google Scholar
• L'Ecuyer P, Panneton F. F2-linear random number generators. In: Alexopoulos C, Goldsman D, Wilson JR, editors. Advancing the frontiers of simulation: a festschrift in honor of george samuel fishman. New York: Springer-Verlag; 2009. p. 169–193.
   Google Scholar
• Harase S. A table of short-period Tausworthe generators for Markov chain quasi-Monte Carlo. J Comput Appl Math. 2021;384:Paper No. 113136, 12. doi: 10.1016/j.cam.2020.113136
   Web of Science ®Google Scholar
• Tezuka S, Fushimi M. Calculation of Fibonacci polynomials for GFSR sequences with low discrepancies. Math Comp. 1993;60(202):763–770. doi: 10.1090/S0025-5718-1993-1160278-0
   Web of Science ®Google Scholar
• Lemieux C. Monte Carlo and quasi-Monte Carlo sampling. New York (NY): Springer; 2009. (Springer series in statistics).
   Google Scholar
• Lemieux C, L'Ecuyer P. Randomized polynomial lattice rules for multivariate integration and simulation. SIAM J Sci Comput. 2003;24(5):1768–1789. doi: 10.1137/S1064827501393782
   Web of Science ®Google Scholar
• Niederreiter H. Random number generation and quasi-Monte Carlo methods. Philadelphia (PA): Society for Industrial and Applied Mathematics (SIAM); 1992. (CBMS-NSF regional conference series in applied mathematics; Vol. 63).
   Google Scholar
• Kajiura H, Matsumoto M, Suzuki K. Characterization of matrices B such that (I,B,B2) generates a digital net with t-value zero. Finite Fields Appl. 2018;52:289–300. doi: 10.1016/j.ffa.2018.04.011
   Web of Science ®Google Scholar
• Dick J, Pillichshammer F. Digital nets and sequences. Cambridge: Cambridge University Press; 2010. (Discrepancy theory and quasi-Monte Carlo integration).
   Google Scholar
• Knuth DE. The art of computer programming. Vol. 2. Reading (MA): Addison-Wesley; 1998. (Seminumerical algorithms 3rd ed.).
   Google Scholar
• Dick J, Rudolf D. Discrepancy estimates for variance bounding Markov chain quasi-Monte Carlo. Electron J Probab. 2014;19:no. 105, 24. doi: 10.1214/EJP.v19-3132
   Web of Science ®Google Scholar
• Dick J, Rudolf D, Zhu H. Discrepancy bounds for uniformly ergodic Markov chain quasi-Monte Carlo. Ann Appl Probab. 2016;26(5):3178–3205. doi: 10.1214/16-AAP1173
   Web of Science ®Google Scholar
• Chentsov N. Pseudorandom numbers for modelling Markov chains. USSR Comput Math Math Phys. 1967;7(3):218–233. doi: 10.1016/0041-5553(67)90041-9
   Google Scholar
• L'Ecuyer P. Maximally equidistributed combined Tausworthe generators. Math Comp. 1996;65(213):203–213. doi: 10.1090/S0025-5718-96-00696-5
   Web of Science ®Google Scholar
• L'Ecuyer P. Tables of maximally-equidistributed combined LFSR generators. Math Comp. 1999;68(225):261–269. doi: 10.1090/S0025-5718-99-01039-X
   Web of Science ®Google Scholar
• Tausworthe RC. Random numbers generated by linear recurrence modulo two. Math Comp. 1965;19:201–209. doi: 10.1090/S0025-5718-1965-0184406-1
   Web of Science ®Google Scholar
• L'Ecuyer P, Lemieux C. Quasi-Monte Carlo via linear shift-register sequences. In: Proceedings of the 31st Conference on Winter Simulation: Simulation – a Bridge to the Future -- Volume 1; WSC '99. New York (NY), USA: Association for Computing Machinery; 1999. p. 632–639.
   Google Scholar
• L'Ecuyer P, Panneton F. Construction of equidistributed generators based on linear recurrences modulo 2. In: Fang KT, Niederreiter H, Hickernell FJ, editors. Monte Carlo and Quasi-Monte Carlo Methods 2000; Berlin, Heidelberg: Springer Berlin Heidelberg; 2002. p. 318–330.
   Google Scholar
• L'Ecuyer P, Marion P, Godin M, et al. A tool for custom construction of QMC and RQMC point sets. In: Keller A, editor. Monte Carlo and Quasi-Monte Carlo methods 2020. Cham: Springer International Publishing; 2022. p. 51–70.
   Google Scholar
• Blackburn SR. Orthogonal sequences of polynomials over arbitrary fields. J Number Theory. 1998;68(1):99–111. doi: 10.1006/jnth.1997.2201
   Web of Science ®Google Scholar
• Mesirov JP, Sweet MM. Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2. J Number Theory. 1987;27(2):144–148. doi: 10.1016/0022-314X(87)90058-8
   Web of Science ®Google Scholar
• Friesen C. Rational functions over finite fields having continued fraction expansions with linear partial quotients. J Number Theory. 2007;126(2):185–192. doi: 10.1016/j.jnt.2006.11.009
   Web of Science ®Google Scholar
• Hofer R. Finding both, the continued fraction and the Laurent series expansion of golden ratio analogs in the field of formal power series. J Number Theory. 2021;223:168–194. doi: 10.1016/j.jnt.2020.11.010
   Web of Science ®Google Scholar
• Pirsic G, Schmid WC. Calculation of the quality parameter of digital nets and application to their construction. J Complexity. 2001;17(4):827–839. doi: 10.1006/jcom.2001.0597
   Web of Science ®Google Scholar
• Matsumoto M, Nishimura T. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul. 1998 jan;8(1):3–30. doi: 10.1145/272991.272995
   Google Scholar
• Chen S. Consistency and convergence rate of Markov chain quasi-Monte Carlo with examples [Thesis (Ph.D.)]. Stanford University; 2011.
   Google Scholar
• Nelson R. Probability, stochastic processes, and queueing theory : the mathematics of computer performance modelling. New York: Springer; 1995.
   Google Scholar
• Chib S. Chapter 57 -- Markov Chain Monte carlo methods: computation and inference. Elsevier; 2001. p. 3569–3649. (Handbook of econometrics; Vol. 5).
   Google Scholar
• Hoff PD. A first course in Bayesian statistical methods. New York (NY): Springer; 2009. (Springer texts in statistics).
   Google Scholar
• Harrison D, Rubinfeld DL. Hedonic housing prices and the demand for clean air. J Environ Econ Manage. 1978;5(1):81–102. doi: 10.1016/0095-0696(78)90006-2
   Web of Science ®Google Scholar
• Wang X, Fang KT. The effective dimension and quasi-Monte Carlo integration. J Complexity. 2003;19(2):101–124. doi: 10.1016/S0885-064X(03)00003-7
   Web of Science ®Google Scholar
• Faure H, Lemieux C. Implementation of irreducible Sobol' sequences in prime power bases. Math Comput Simul. 2019;161:13–22. doi: 10.1016/j.matcom.2018.08.015
   Web of Science ®Google Scholar
• Gerber M, Chopin N. Sequential quasi Monte Carlo. J R Stat Soc Ser B Stat Methodol. 2015;77(3):509–579. doi: 10.1111/rssb.12104
   Web of Science ®Google Scholar
• Buchholz A, Chopin N. Improving approximate Bayesian computation via quasi-Monte Carlo. J Comput Graph Statist. 2019;28(1):205–219. doi: 10.1080/10618600.2018.1497511
   Web of Science ®Google Scholar
• L'Ecuyer P, Puchhammer F. Density estimation by Monte Carlo and quasi-Monte Carlo. In: Keller A, editor. Monte Carlo and Quasi-Monte Carlo methods 2020. Cham: Springer International Publishing; 2022. p. 3–21.
   Google Scholar