On the scrambled Soboĺ sequence

Lecture Notes in Computer Science

Volumn 3516, Issue III, 2005, Pages 775-782

  Chi, Hongmei ^a   Beerli, Peter ^b   Evans, Deidre W ^a   Mascagni, Micheal ^b  

^a FLORIDA A AND M UNIVERSITY   (United States)

^b FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; RANDOM PROCESSES; ARTIFICIAL INTELLIGENCE; COMPUTERS;

MULTI-DIGIT SCRAMBLING SCHEMES; SCRAMBLING TECHNIQUES; DERIVATIVE SECURITIES; QUASIRANDOM SEQUENCES; SCRAMBLING ALGORITHM;

COMPUTATIONAL METHODS; ITERATIVE METHODS;

EID: 25144487125     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428862_105     Document Type: Conference Paper

References (23)

1. E. Atanassov. A new efficient algorithm for generating the scrambled soboĺ sequence. In Numerical Methods and Applications (LNCS 2542), pages 81-90, New York, 2003. Springer-Verlag.
2. F. Black and M. Scholes. The pricing of options and corporate liabilities. Journal of Political Economy, 81:637-659, 1973.
3. P. Boyle. New life forms on the option landscape. Journal of Financial Engineering, 2(3):217-252, 1992.
4. P. Bratley and B. Fox. Algorithm 659: Implementing soboĺ's quasirandom sequnence generator. ACM Trans. on Mathematical Software, 14(1):88-100, 1988.
5. J. Cheng and M.J. Druzdzel. Computational investigation of low-discrepancy sequences in simulation algorithms for bayesian networks. In Uncertainty in Artificial Intelligence: Proceedings of the Sixteenth Conference (UAI-2000), pages 72-81, San Francisco, CA, 2000. Morgan Kaufmann Publishers.
6. H. Chi, M. Mascagni, and T. Warnock. On the optimal Halton sequences. Mathematics and Computers in Simulation, To appear, 2005.
7. 31 - 1. SIAM J. Sci. Stat. Comput., 7:24-45, 1986.
8. H. S. Hong and F. J. Hickernell. Algorithm 823: Implementing scrambled digital sequences. ACM Transactions on Mathematical Software, 29(2):95-109, june 2003.
9. J. Hull. Options, Future and Other Derivative Secutrities. Prentice-Hall, New York, 2000.
10. P. Jackel. Monte Carlo Methods in Finance. John Wiley and Sons, New York, 2002.
11. S. Joe and F. Y. Kuo. Remark on Algorithm 659: Implementing Soboĺ's quasirandom sequence generator. ACM Transactions on Mathematical Software, 29(1):49-57, March 2003.
12. D. E. Knuth. The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 1997.
13. R. Lidl and H.Niederreiter. Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, 1994.
14. M. Mascagni. Parallel linear congruential generators with prime moduli. Parallel Computing, 24:923-936, 1998.
15. M. Mascagni and H. Chi. Parallel linear congruential generators with Sophie-Germain moduli. Parallel Computing, 30:1217-1231, 2004.
16. J. Matousek. On the 12-discrepancy for anchored boxes. Journal of Complexity, 14:527-556, 1998.
17. B. Moro. The full monte. Risk, 8(2) (February):57-58, 1995.
18. W.J. Morokoff and R.E. Caflish. Quasirandom sequences and their discrepancy. SIAM Journal on Scientific Computing, 15:1251-1279, 1994.
19. A.B. Owen. Randomly permuted(t,m,s)-netsand (t,s)-sequences. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, 106 in Lecture Notes in Statistics:299-317, 1995.
20. S. H. Paskov and J. F. Traub. Faster valuation of financial derivatives. J. Portfolio Management, 22(1):113-120, Fall 1995.
21. I.M. Soboĺ. On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. and Math. Phy., 7(4):86-112, 1967.
22. I.M. Soboĺ. Uniformly distributed sequences with additional uniformity properties. USSR Comput. Math. and Math. Phy., 16:236-242, 1976.
23. S. Tezuka. Uniform Random Numbers, Theory and Practice. Kluwer Academic Publishers, IBM Japan, 1995.