IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v27y2021i4p325-339n7.html
   My bibliography  Save this article

A global random walk on grid algorithm for second order elliptic equations

Author

Listed:
  • Sabelfeld Karl K.

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

  • Smirnov Dmitry

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

  • Dimov Ivan

    (Department of Parallel Algorithms, Bulgarian Academy of Sciences, Institute of Information and Communication Technologies, Acad. G. Bonchev Str., Block 25 A, 1113, Sofia, Bulgaria)

  • Todorov Venelin

    (Department of Information Modeling, Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Acad. Georgi Bonchev Str., Block 8, 1113; and Department of Parallel Algorithms, Bulgarian Academy of Sciences, Institute of Information and Communication Technologies, Acad. G. Bonchev Str., Block 25 A, 1113, Sofia, Bulgaria)

Abstract

In this paper we develop stochastic simulation methods for solving large systems of linear equations, and focus on two issues: (1) construction of global random walk algorithms (GRW), in particular, for solving systems of elliptic equations on a grid, and (2) development of local stochastic algorithms based on transforms to balanced transition matrix. The GRW method calculates the solution in any desired family of prescribed points of the gird in contrast to the classical stochastic differential equation based Feynman–Kac formula. The use in local random walk methods of balanced transition matrices considerably decreases the variance of the random estimators and hence decreases the computational cost in comparison with the conventional random walk on grids algorithms.

Suggested Citation

  • Sabelfeld Karl K. & Smirnov Dmitry & Dimov Ivan & Todorov Venelin, 2021. "A global random walk on grid algorithm for second order elliptic equations," Monte Carlo Methods and Applications, De Gruyter, vol. 27(4), pages 325-339, December.
    • Handle: RePEc:bpj:mcmeap:v:27:y:2021:i:4:p:325-339:n:7
    DOI: 10.1515/mcma-2021-2097
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2021-2097
    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-2021-2097?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:27:y:2021:i:4:p:325-339:n:7. 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.