Summary
Conventional wisdom in solving transport problems is to identify unbiased, low variance (or low variation) estimators to estimate unknown functionals of the solution by Monte Carlo (or quasi-Monte Carlo) algorithms. Our adaptive implementations using this approach have involved the iterative improvement of either an approximate solution obtained through correlated sampling (SCS) or of an approximate importance function (AIS) for the problem. Each of these methods has some drawbacks: for SCS, the (required) estimation of the residual creates various problems and for AIS, sampling from the complex expressions that result from the use of an importance function can be extremely costly. In both of these cases, substantial loss of precision may result. A new adaptive method — generalized weighted analog sampling (GWAS) - combines many of the best features of SCS (simple sampling functions) and AIS (rapid error reduction) and makes use of biased (but asymptotically unbiased) estimators in a very flexible and efficient algorithm. In this work we sketch the needed theory and present numerical results that confirm the potential of the new method, at least for some model transport problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Kong and J. Spanier, “Sequential Correlated Sampling Methods for Some Transport Problems”, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds), Springer-Verlag, Berlin, 2000, pp. 238–251.
R. Kong and J. Spanier, “Error analysis of Sequential Monte Carlo Methods for Transport Problems”, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds), Springer-Verlag, Berlin, 2000, pp. 252–272.
Y. Lai and J. Spanier, “Adaptive Importance Sampling Algorithms for Transport Problems”, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds), Springer-Verlag, Berlin, 2000, pp. 273–283.
C.K. Hayakawa and J. Spanier, “Comparison of Monte Carlo Algorithms for Obtaining Geometric Convergence for Model Transport Problems”, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds), Springer-Verlag, Berlin, 2000, pp. 214–226.
J. Spanier, “Geometrically Convergent Learning Algorithms for Global Solutions of Transport Problems”, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds), Springer-Verlag, Berlin, 2000, pp. 98–113.
M.J.D. Powell and J. Swann, “Weighted Uniform Sampling-A Monte Carlo Technique for Reducing Variance”, J. Inst. Math. Applics., 2:228–236, (1966).
B.S. Moskowitz, “Application of Quasi-Random Sequences to Monte Carlo Methods”, Ph.D. dissertation, UCLA, 1993.
J. Spanier, “A New Family of Estimators for Transport Problems”, J. Inst. Maths Applies., 23, 1–31, (1979).
Advanced Monte Carlo Methods, CRIAMS report LANL-03-001 to Los Alamos National Laboratory, February, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spanier, J., Kong, R. (2004). A New Adaptive Method for Geometric Convergence. In: Niederreiter, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18743-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-18743-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20466-4
Online ISBN: 978-3-642-18743-8
eBook Packages: Springer Book Archive