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

IF 0.8 Q3 STATISTICS & PROBABILITY Monte Carlo Methods and Applications Pub Date : 2021-08-08 DOI:10.1515/mcma-2021-2092
K. Sabelfeld, D. Smirnov
{"title":"A global random walk on grid algorithm for second order elliptic equations","authors":"K. Sabelfeld, D. Smirnov","doi":"10.1515/mcma-2021-2092","DOIUrl":null,"url":null,"abstract":"Abstract We suggest in this paper a global random walk on grid (GRWG) method for solving second order elliptic equations. The equation may have constant or variable coefficients. The GRWS method calculates the solution in any desired family of m prescribed points of the gird in contrast to the classical stochastic differential equation based Feynman–Kac formula, and the conventional random walk on spheres (RWS) algorithm as well. The method uses only N trajectories instead of mN trajectories in the RWS algorithm and the Feynman–Kac formula. The idea is based on the symmetry property of the Green function and a double randomization approach.","PeriodicalId":46576,"journal":{"name":"Monte Carlo Methods and Applications","volume":"27 1","pages":"211 - 225"},"PeriodicalIF":0.8000,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Monte Carlo Methods and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/mcma-2021-2092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 5

Abstract

Abstract We suggest in this paper a global random walk on grid (GRWG) method for solving second order elliptic equations. The equation may have constant or variable coefficients. The GRWS method calculates the solution in any desired family of m prescribed points of the gird in contrast to the classical stochastic differential equation based Feynman–Kac formula, and the conventional random walk on spheres (RWS) algorithm as well. The method uses only N trajectories instead of mN trajectories in the RWS algorithm and the Feynman–Kac formula. The idea is based on the symmetry property of the Green function and a double randomization approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二阶椭圆型方程的一种全局随机游走网格算法
摘要本文提出了一种求解二阶椭圆型方程的全局随机网格行走(GRWG)方法。该方程可以具有常数系数或可变系数。与基于经典随机微分方程的Feynman–Kac公式和传统的随机球上行走(RWS)算法相比,GRWS方法计算网格中任意m个指定点族中的解。该方法在RWS算法和Feynman–Kac公式中仅使用N条轨迹,而不是mN条轨迹。这个想法是基于格林函数的对称性和双重随机化方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Monte Carlo Methods and Applications
Monte Carlo Methods and Applications STATISTICS & PROBABILITY-
CiteScore
1.20
自引率
22.20%
发文量
31
期刊最新文献
Asymmetric kernel method in the study of strong stability of the PH/M/1 queuing system Random walk on spheres method for solving anisotropic transient diffusion problems and flux calculations Strong approximation of a two-factor stochastic volatility model under local Lipschitz condition On the estimation of periodic signals in the diffusion process using a high-frequency scheme Stochastic simulation of electron transport in a strong electrical field in low-dimensional heterostructures
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1