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

Revisiting Kac’s method: A Monte Carlo algorithm for solving the Telegrapher’s equations

Author

Listed:
  • Zhang, Bolong
  • Yu, Wenjian
  • Mascagni, Michael

Abstract

In this work, we use Kac’s stochastic model to derive a Monte Carlo (MC) algorithm for the numerical solution of the telegrapher’s equation. The major ideas are to use random values under exponential distribution to facilitate the calculation of the random time, and to accelerate the simulation for multiple points through recycling random time simulation. Compared with the MC method recently proposed by Acebrón and Ribeiro, the Kac’s model based method is able to handle two-dimensional (2-D) and higher-dimensional problems with unbounded domain, and 2-D bounded-domain problems with the homogeneous boundary condition. Moreover, it has an efficient algorithmic implementation. With numerical experiments, we have validated the accuracy and efficiency of the proposed algorithms, and their applicability to some 2-D telegrapher’s equations.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:156:y:2019:i:c:p:178-193
    DOI: 10.1016/j.matcom.2018.08.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475418302052
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2018.08.007?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.
    2. Hwang, Chi-Ok & Mascagni, Michael & Given, James A., 2003. "A Feynman–Kac path-integral implementation for Poisson’s equation using an h-conditioned Green’s function," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 62(3), pages 347-355.
    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. 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.
    2. Xuxin Yang & Antti Rasila & Tommi Sottinen, 2017. "Walk On Spheres Algorithm for Helmholtz and Yukawa Equations via Duffin Correspondence," Methodology and Computing in Applied Probability, Springer, vol. 19(2), pages 589-602, June.
    3. 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.
    4. Maire Sylvain & Tanré Etienne, 2013. "Monte Carlo approximations of the Neumann problem," Monte Carlo Methods and Applications, De Gruyter, vol. 19(3), pages 201-236, October.
    5. Cameron Martin & Hongyuan Zhang & Julia Costacurta & Mihai Nica & Adam R Stinchcombe, 2022. "Solving Elliptic Equations with Brownian Motion: Bias Reduction and Temporal Difference Learning," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1603-1626, September.
    6. Maire, Sylvain & Nguyen, Giang, 2016. "Stochastic finite differences for elliptic diffusion equations in stratified domains," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 121(C), pages 146-165.

    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:156:y:2019:i:c:p:178-193. 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.