IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v31y2025i2p131-143n1004.html
   My bibliography  Save this article

A meshfree Random Walk on Boundary algorithm with iterative refinement

Author

Listed:
  • Shalimova Irina

    (Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Sciences, Novosibirsk, Russia)

  • Sabelfeld Karl K.

    (Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Sciences; and Sobolev Institute of Mathematics, Russian Academy of Sciences, Novosibirsk, Russia)

Abstract

A hybrid continuous Random Walk on Boundary algorithm and iterative refinement method is constructed. In this method, the density of the double layer boundary integral equation for the Laplace equation is resolved by an isotropic Random Walk on Boundary algorithm and calculated for a set of grid points chosen on the boundary. Then, a residual of the boundary integral equation is calculated deterministically, and the same boundary integral equation is solved where the right-hand side is changed with the residual function. This process is repeated several times until the desired accuracy is achieved. This method is compared against the standard Random Walk on Boundary algorithm in terms of their labor intensity. Simulation experiments have shown that the new method is about 200 times more efficient, and this advantage increases with the increase of the desired accuracy. It is noteworthy that the new hybrid algorithm, unlike the standard Random Walk on Boundary algorithm, solves the Laplace equation efficiently also in non-convex domains.

Suggested Citation

  • Shalimova Irina & Sabelfeld Karl K., 2025. "A meshfree Random Walk on Boundary algorithm with iterative refinement," Monte Carlo Methods and Applications, De Gruyter, vol. 31(2), pages 131-143.
    • Handle: RePEc:bpj:mcmeap:v:31:y:2025:i:2:p:131-143:n:1004
    DOI: 10.1515/mcma-2025-2007
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2025-2007
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/mcma-2025-2007?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.

    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:bpj:mcmeap:v:31:y:2025:i:2:p:131-143:n:1004. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.