Random walk on boundary with iterative refinement for solving interior Dirichlet and exterior Neumann problems for the modified Helmholtz equation

Abstract This paper develops and analyzes a hybrid meshfree Random Walk on Boundary (RWB) algorithm with iterative refinement for solving two-dimensional boundary value problems. The method is applied to the interior Dirichlet problem and the exterior Neumann problem for the modified Helmholtz equation. A rigorous proof of the exponential convergence of the proposed iterative refinement procedure is established, together with error and computational complexity estimates. The convergence analysis applies to both convex and non-convex domains, thereby overcoming a major limitation of the classical RWB algorithm. Compared with the standard RWB method, the proposed approach achieves dramatically higher accuracy and significantly improved computational efficiency, with the advantage increasing as higher solution accuracy is required. Numerical experiments confirm the theoretical predictions and demonstrate the effectiveness of the proposed algorithm. The proposed framework extends straightforwardly to three-dimensional boundary value problems for the modified Helmholtz equation.

Authors

Institutions

Publication Details

Journal
Monte Carlo Methods and Applications
Published
2026-07-28
DOI
https://doi.org/10.1515/mcma-2026-3011
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random walk on boundary with iterative refinement for solving interior Dirichlet and exterior Neumann problems for the modified Helmholtz equation

Karl K. Sabelfeld, Irina Shalimova
Monte Carlo Methods and Applications
Probabilistic and Robust Engineering Design
article

Random walk on boundary with iterative refinement for solving interior Dirichlet and exterior Neumann problems for the modified Helmholtz equation

Karl K. Sabelfeld, Irina Shalimova
article en

Abstract

Abstract This paper develops and analyzes a hybrid meshfree Random Walk on Boundary (RWB) algorithm with iterative refinement for solving two-dimensional boundary value problems. The method is applied to the interior Dirichlet problem and the exterior Neumann problem for the modified Helmholtz equation. A rigorous proof of the exponential convergence of the proposed iterative refinement procedure is established, together with error and computational complexity estimates. The convergence analysis applies to both convex and non-convex domains, thereby overcoming a major limitation of the classical RWB algorithm. Compared with the standard RWB method, the proposed approach achieves dramatically higher accuracy and significantly improved computational efficiency, with the advantage increasing as higher solution accuracy is required. Numerical experiments confirm the theoretical predictions and demonstrate the effectiveness of the proposed algorithm. The proposed framework extends straightforwardly to three-dimensional boundary value problems for the modified Helmholtz equation.

Monte Carlo Methods and Applications
Institute of Computational Mathematics and Mathematical Geophysics (RU)
Sustainable cities and communities
Openalex Percentile: Top 7%
Probabilistic and Robust Engineering Design
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Random walk on boundary with iterative refinement for solving interior Dirichlet and exterior Neumann problems for the modified Helmholtz equation — Karl K. Sabelfeld, Irina Shalimova · Monte Carlo Methods and Applications (2026) | TGRS Research Map | TGRS