IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-18743-8_27.html
   My bibliography  Save this book chapter

A New Adaptive Method for Geometric Convergence

In: Monte Carlo and Quasi-Monte Carlo Methods 2002

Author

Listed:
  • Jerome Spanier

    (Claremont Graduate University, Claremont Research Institute of Applied Mathematical Sciences
    University of California, Beckman Laser Institute and Medical Clinic 1002 Health Sciences Road East)

  • Rong Kong

    (Claremont Graduate University, Claremont Research Institute of Applied Mathematical Sciences)

Abstract

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.

Suggested Citation

  • Jerome Spanier & Rong Kong, 2004. "A New Adaptive Method for Geometric Convergence," Springer Books, in: Harald Niederreiter (ed.), Monte Carlo and Quasi-Monte Carlo Methods 2002, pages 439-449, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-18743-8_27
    DOI: 10.1007/978-3-642-18743-8_27
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-18743-8_27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.