IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v63y2003i6p605-613.html
   My bibliography  Save this article

Analysis and comparison of Green’s function first-passage algorithms with “Walk on Spheres” algorithms

Author

Listed:
  • Hwang, Chi-Ok
  • Mascagni, Michael

Abstract

We analyze the optimization of the running times of Green’s function first-passage (GFFP) algorithms. The running times for these new first-passage (FP) algorithms [J. Chem. Phys. 106 (9) (1997) 3721; Phys. Fluids A 12 (7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3–4) (2001) 213], which use exact Green’s functions for the Laplacian to eliminate the absorption layer in the “Walk on Spheres” (WOS) method [Ann. Math. Stat. 27 (1956) 569; J. Heat Transfer 89 (1967) 121; J. Chem. Phys. 100 (5) (1994) 3821; J. Appl. Phys. 71 (6) (1992) 2727; J. Comput. Phys. 39 (1981) 396], are compared with those for WOS algorithms. It has been empirically observed that GFFP algorithms are more efficient than WOS algorithms when high accuracy is required [Phys. Fluids A 12 (7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3–4) (2001) 213]. Additionally, it has been observed that there is always an optimal distance from the surface of the absorbing boundary, δI, for a GFFP algorithm within which a FP surface can be permitted to intersect the boundary [Phys. Fluids A 12(7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3–4) (2001) 213]. In this paper, we will provide a rigorous complexity analysis consistent with these observations. This analysis is based on estimating the numbers of WOS and GFFP steps needed for absorption on the boundary, and the complexity and running times of each WOS and GFFP step. As an illustration, we analyze the running times for calculating the capacitance of the unit cube using both GFFP and WOS.

Suggested Citation

  • Hwang, Chi-Ok & Mascagni, Michael, 2003. "Analysis and comparison of Green’s function first-passage algorithms with “Walk on Spheres” algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(6), pages 605-613.
    • Handle: RePEc:eee:matcom:v:63:y:2003:i:6:p:605-613
    DOI: 10.1016/S0378-4754(03)00091-0
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475403000910
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/S0378-4754(03)00091-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mascagni, Michael & Hwang, Chi-Ok, 2003. "ϵ-Shell error analysis for “Walk On Spheres” algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(2), pages 93-104.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Bolong & Yu, Wenjian & Mascagni, Michael, 2019. "Revisiting Kac’s method: A Monte Carlo algorithm for solving the Telegrapher’s equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 156(C), pages 178-193.
    2. Hwang, Chi-Ok & Mascagni, Michael & Won, Taeyoung, 2010. "Monte Carlo methods for computing the capacitance of the unit cube," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(6), pages 1089-1095.

    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:eee:matcom:v:63:y:2003:i:6:p:605-613. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.