Efficient simultaneous simulation of markov chains

Monte Carlo and Quasi-Monte Carlo Methods 2006

Volumn , Issue , 2008, Pages 669-684

  Wächter, Carsten ^a   Keller, Alexander ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; MARKOV PROCESSES;

DETERMINISTIC APPROACH; HIGH-DIMENSIONAL; LIGHT TRANSPORT; LOW DIMENSIONAL; LOW-DISCREPANCY POINT SETS; POINT SET; SORTING STRATEGIES;

MONTE CARLO METHODS;

EID: 84892310201     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-74496-2_41     Document Type: Conference Paper

References (45)

1. [Abr95] M. Abrash. BSP Trees. Dr. Dobbs Sourcebook, 20(14):49-52, 1995.
2. [Ben75] J. Bentley. Multidimensional Binary Search Trees used for Associative Searching. Commun. ACM, 18(9):509-517, 1975.
3. [BNN+98] P. Bekaert, L. Neumann, A. Neumann, M. Sbert, and Y. Willems. Hierarchical Monte Carlo Radiosity. Eurographics Rendering Workshop 1998, pages 259-268, June 1998.
4. [CP76] R. Cranley and T. Patterson. Randomization of number theoretic methods for multiple integration. SIAM Journal on Numerical Analysis, 13:904-914, 1976.
5. [DLT05] V. Demers, P. L'Écuyer, and B. Tuffin. A Combination of Randomized quasi-Monte Carlo with Splitting for Rare-Event Simulation. In Proceedings of the 2005 European Simulation and Modelling Conference, pages 25-32. SCS Press, 2005.
6. [DMC91] M. Dorigo, V. Maniezzo, and A. Colorni. Positive Feedback as a Search Strategy. Technical Report 91016, Dipartimento di Elettronica e Informatica, Politecnico di Milano, Italy, 1991.
7. [HLL07] R. El Haddad, C. Lécot, and P. L'Écuyer. Quasi-Monte Carlo Simulation of Discrete-Time Markov Chains in Multidimensional State Spaces. In A. Keller, S. Heinrich, and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods 2006, page in this volume. Springer, 2007.
8. [Kar72] R. Karp. Reducibility among Combinatorial Problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, Advances in Computing Research, pages 85-103. Plenum Press, 1972.
9. [Kel06] A. Keller. Myths of Computer Graphics. In H. Niederreiter, editor, Monte Carlo and Quasi-Monte Carlo Methods 2004, pages 217-243. Springer, 2006.
10. [KK86] T. Kay and J. Kajiya. Ray Tracing Complex Scenes. Computer Graphics (Proceedings of SIGGRAPH 86), 20(4):269-278, August 1986.
11. [KK02a] T. Kollig and A. Keller. Efficient Bidirectional Path Tracing by Randomized Quasi-Monte Carlo Integration. In H. Niederreiter, K. Fang, and F. Hickernell, editors, Monte Carlo and Quasi-Monte Carlo Methods 2000, pages 290-305. Springer, 2002.
12. [KK02b] T. Kollig and A. Keller. Efficient Multidimensional Sampling. Computer Graphics Forum, 21(3):557-563, September 2002.
13. [KK04] T. Kollig and A. Keller. Illumination in the Presence of Weak Singularities. In D. Talay and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods 2004, pages 245-257. Springer, 2004.
14. [KL99] F. El Khettabi and C. Lécot. Quasi-Monte Carlo Simulation of Diffusion. J. Complexity, 15(3):342-359, 1999.
15. [Kol04] T. Kollig. Efficient Sampling and Robust Algorithms for Photorealistic Image Synthesis. PhD thesis, University of Kaiserslautern, Germany, 2004.
16. [KS05] F. Kuo and I. Sloan. Quasi-Monte Carlo Methods can be efficient for Integration over Products of Spheres. J. Complexity, 21(2):196-210, 2005.
17. [LC98] C. Lécot and I. Coulibaly. A quasi-Monte Carlo Scheme using Nets for a linear Boltzmann Equation. SIAM J. Numer. Anal., 35(1):51-70, 1998.
18. [LDT06] P. L'Écuyer, V. Demers, and B. Tuffin. Splitting for Rare-Event Simulation. In Proceedings of the 2006 Winter Simulation Conference, pages 137-148, 2006.
19. [LDT07] P. L'Écuyer, V. Demers, and B. Tuffin. Rare Events, Splitting, and quasi-Monte Carlo. ACM Transactions on Modeling and Computer Simulation, 17(2): Art. No. 9, 2007.
20. [Léc89a] C. Lécot. A Direct Simulation Monte Carlo Scheme and Uniformly Distributed Sequences for Solving the Boltzmann Equation. Computing, 41(1-2):41-57, 1989.
21. [Léc89b] C. Lécot. Low Discrepancy Sequences for solving the Boltzmann Equation. Journal of Computational and Applied Mathematics, 25(2):237-249, 1989.
22. [Léc91] C. Lécot. A quasi-Monte Carlo Method for the Boltzmann Equation. Mathematics of Computation, 56(194):621-644, 1991.
23. [LL02] P. L'Écuyer and C. Lemieux. Recent Advances in Randomized quasi-Monte Carlo methods. In M. Dror, P. L'Ecuyer, and F. Szidarovszky, editors, Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, pages 419-474. Kluwer Academic Publishers, 2002.
24. [LLKS85] E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley, 1985.
25. [LLT05] P. L'Écuyer, C. Lécot, and B. Tuffin. A Randomized quasi-Monte Carlo Simulation Method for Markov Chains. Technical report g-2006-64, to appear in Operations Research, GERAD, Université de Montréal, 2005.
26. [LLT06] P. L'Écuyer, C. Lécot, and B. Tuffin. Randomized quasi-Monte Carlo Simulation of Markov Chains with an Ordered State Space. In H. Niederreiter and D. Talay, editors, Monte Carlo and quasi-Monte Carlo Methods 2004, pages 331-342. Springer, 2006.
27. [LT04a] C. Lécot and B. Tuffin. Comparison of quasi-Monte Carlo-Based Methods for the Simulation of Markov Chains. Monte Carlo Methods and Applications, 10(3-4):377-384, 2004.
28. [LT04b] C. Lécot and B. Tuffin. Quasi-Monte Carlo Methods for Estimating Transient Measures of Discrete Time Markov Chains. In H. Niederreiter, editor, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing 2002, pages 329-344. Springer, 2004.
29. [Mat98] J. Matoušek. On the L2-discrepancy for anchored boxes. J. Complexity, 14(4):527-556, 1998.
30. [MC93] W. Morokoff and R. Caflisch. A Quasi-Monte Carlo Approach to Particle Simulation of the Heat Equation. SIAM Journal on Numerical Analysis, 30(6):1558-1573, 1993.
31. [Nie92] H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992.
32. [Rei94] G. Reinelt. The Traveling Salesman -Computational Solutions for TSP Applications. Springer, 1994.
33. [Rus98] D. Rusin. Topics on Sphere Distributions, http://www.math. niu.edu/~rusin/known-math/95/sphere.faq, 1998.
34. [RW80] S. Rubin and J. Whitted. A 3-dimensional representation for fast rendering of complex scenes. Computer Graphics (Proceedings of SIGGRAPH 80), 14(3):110-116, 1980.
35. [Sag94] H. Sagan. Space-Filling Curves. Springer, 1994.
36. [SBGS69] R. Schumacker, R. Brand, M. Gilliland, and W. Sharp. Study for Applying Computer-Generated Images to Visual Simulation. Technical report AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, 1969.
37. [SC94] P. Shirley, K. Chiu. Notes on Adaptive Quadrature on the Hemisphere. Technical Report TR-411 Dept. of Computer Science Indiana University 1994.
38. [Shi00] P. Shirley. Realistic Ray Tracing. AK Peters, Ltd., 2000.
39. [SKFNC97] L. Szirmay-Kalos, T. Fóris, L. Neumann, and B. Csébfalvi. An Analysis of Quasi-Monte Carlo Integration Applied to the Transillumination Radiosity Method. Computer Graphics Forum, 16(3):271-282, 1997.
40. [SM07] M. Saito and M. Matsumoto. SIMD-oriented Fast Mersenne Twister: A 128-bit Pseudorandom Number Generator. In A. Keller, S. Heinrich, and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods 2006. Springer, in this volume.
41. [Sob67] I. Sobol'. On the Distribution of Points in a Cube and the approximate Evaluation of Integrals. Zh. vychisl. Mat. mat. Fiz., 7(4):784-802, 1967.
42. [Vea97] E. Veach. Robust Monte Carlo Methods for Light Transport Simulation. PhD thesis, Stanford University, 1997.
43. [Wie03] J.-M. Wierum. Anwendung diskreter raumfüllender Kurven -Graphpartitionierung und Kontaktsuche in der Finite-Elemente-Simulation. PhD thesis, Universität Paderborn, 2003.
44. [WK06] C. Wächter and A. Keller. Instant Ray Tracing: The Bounding Interval Hierarchy. In T. Akenine-Möller and W. Heidrich, editors, Rendering Techniques 2006 (Proc. of 17th Eurographics Symposium on Rendering), pages 139-149, 2006.
45. [WK07] C. Wächter, A. Keller. Terminating Spatial Partition Hierarchies by A Priori Bounding Memory. Technical report Ulm University 2007.