IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v26y2020i4p335-353n8.html
   My bibliography  Save this article

Random walk on ellipsoids method for solving elliptic and parabolic equations

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, Novosibirsk, Russia)

Abstract

A Random Walk on Ellipsoids (RWE) algorithm is developed for solving a general class of elliptic equations involving second- and zero-order derivatives. Starting with elliptic equations with constant coefficients, we derive an integral equation which relates the solution in the center of an ellipsoid with the integral of the solution over an ellipsoid defined by the structure of the coefficients of the original differential equation. This integral relation is extended to parabolic equations where a first passage time distribution and survival probability are given in explicit forms. We suggest an efficient simulation method which implements the RWE algorithm by introducing a notion of a separation sphere. We prove that the logarithmic behavior of the mean number of steps for the RWS method remains true for the RWE algorithm. Finally we show how the developed RWE algorithm can be applied to solve elliptic and parabolic equations with variable coefficients. A series of supporting computer simulations are given.

Suggested Citation

  • Shalimova Irina & Sabelfeld Karl K., 2020. "Random walk on ellipsoids method for solving elliptic and parabolic equations," Monte Carlo Methods and Applications, De Gruyter, vol. 26(4), pages 335-353, December.
    • Handle: RePEc:bpj:mcmeap:v:26:y:2020:i:4:p:335-353:n:8
    DOI: 10.1515/mcma-2020-2078
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2020-2078
    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-2020-2078?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:26:y:2020:i:4:p:335-353:n:8. 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.