A new Global Random Walk algorithm for calculation of the solution and its derivatives of elliptic equations with constant coefficients in an arbitrary set of points

Standard

A new Global Random Walk algorithm for calculation of the solution and its derivatives of elliptic equations with constant coefficients in an arbitrary set of points. / Sabelfeld, Karl; Kireeva, Anastasya.

In: Applied Mathematics Letters, Vol. 107, 106466, 09.2020.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{2a0b7d5559e84d72947794b9d3395719,

title = "A new Global Random Walk algorithm for calculation of the solution and its derivatives of elliptic equations with constant coefficients in an arbitrary set of points",

abstract = "A new random walk based stochastic algorithm for calculation of the solution and its derivatives of high-dimensional second order elliptic equations with constant coefficients in any desired set of points is suggested. In contrast to the conventional random walk methods the new Global Random Walk (GRW) algorithm is able to find the solution in many points using only one ensemble of random walks. The method is meshless, highly efficient, the cost is of the order of |log(ε)|∕ε2 independent of the complexity of the boundary shape, where ε is the desired accuracy. The method can be used to solve nonlinear equations by applying the GRW algorithm iteratively. We demonstrate this by solving a nonlinear system of semiconductor equations. The system includes drift–diffusion equations for electrons and holes, and the Poisson equation for a potential term whose gradient enters the drift–diffusion equations as a drift velocity. The nonlinear drift–diffusion–Poisson system is solved by the iteration procedure including alternating simulation of the drift–diffusion processes and solving the Poisson equation by the GRW algorithm.",

keywords = "Drift–diffusion–Poisson equation, Fundamental solution, Global Random Walk algorithm, Green's function, Random Walk on Spheres, Drift-diffusion-Poisson equation, Global RandomWalk algorithm, RandomWalk on Spheres",

author = "Karl Sabelfeld and Anastasya Kireeva",

year = "2020",

month = sep,

doi = "10.1016/j.aml.2020.106466",

language = "English",

volume = "107",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

T1 - A new Global Random Walk algorithm for calculation of the solution and its derivatives of elliptic equations with constant coefficients in an arbitrary set of points

AU - Sabelfeld, Karl

AU - Kireeva, Anastasya

PY - 2020/9

Y1 - 2020/9

N2 - A new random walk based stochastic algorithm for calculation of the solution and its derivatives of high-dimensional second order elliptic equations with constant coefficients in any desired set of points is suggested. In contrast to the conventional random walk methods the new Global Random Walk (GRW) algorithm is able to find the solution in many points using only one ensemble of random walks. The method is meshless, highly efficient, the cost is of the order of |log(ε)|∕ε2 independent of the complexity of the boundary shape, where ε is the desired accuracy. The method can be used to solve nonlinear equations by applying the GRW algorithm iteratively. We demonstrate this by solving a nonlinear system of semiconductor equations. The system includes drift–diffusion equations for electrons and holes, and the Poisson equation for a potential term whose gradient enters the drift–diffusion equations as a drift velocity. The nonlinear drift–diffusion–Poisson system is solved by the iteration procedure including alternating simulation of the drift–diffusion processes and solving the Poisson equation by the GRW algorithm.

AB - A new random walk based stochastic algorithm for calculation of the solution and its derivatives of high-dimensional second order elliptic equations with constant coefficients in any desired set of points is suggested. In contrast to the conventional random walk methods the new Global Random Walk (GRW) algorithm is able to find the solution in many points using only one ensemble of random walks. The method is meshless, highly efficient, the cost is of the order of |log(ε)|∕ε2 independent of the complexity of the boundary shape, where ε is the desired accuracy. The method can be used to solve nonlinear equations by applying the GRW algorithm iteratively. We demonstrate this by solving a nonlinear system of semiconductor equations. The system includes drift–diffusion equations for electrons and holes, and the Poisson equation for a potential term whose gradient enters the drift–diffusion equations as a drift velocity. The nonlinear drift–diffusion–Poisson system is solved by the iteration procedure including alternating simulation of the drift–diffusion processes and solving the Poisson equation by the GRW algorithm.

KW - Drift–diffusion–Poisson equation

KW - Fundamental solution

KW - Global Random Walk algorithm

KW - Green's function

KW - Random Walk on Spheres

KW - Drift-diffusion-Poisson equation

KW - Global RandomWalk algorithm

KW - RandomWalk on Spheres

UR - http://www.scopus.com/inward/record.url?scp=85084486539&partnerID=8YFLogxK

U2 - 10.1016/j.aml.2020.106466

DO - 10.1016/j.aml.2020.106466

M3 - Article

AN - SCOPUS:85084486539

VL - 107

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

SN - 0893-9659

M1 - 106466

ER -

ID: 24260071