NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Geometry Entrapment in Walk-on-Subdomains

Published

Author(s)

Walid Keyrouz, Preston Hamlin, W. J. Thrasher, Michael V. Mascagni

Abstract

One method of computing the electrostatic energy of a biomolecule in a solution combines the Walk-On-Spheres and Walk-On-Subdomains Monte Carlo algorithms. In the course of examining an implementation of this method, a performance issue was discovered in the Walk-On-Subdomains portion of the algorithm. The problem occurs when a walker repeatedly oscillates between two subdomains and is trapped eventually in a small area, which causes a large increase in runtime. This issue is described in detail and a potential solution is examined.
Citation
Monte Carlo Methods and Applications
Volume
25
Issue
4
Pub Type
Journals

Download Paper

https://doi.org/10.1515/mcma-2019-2052
Local Download

Keywords

Monte Carlo, Walk on Subdomains, Brownian Motion, Poisson-Boltzmann, Walk Entrapment
Numerical methods and software and Modeling and simulation research

Citation

Keyrouz, W. , Hamlin, P. , Thrasher, W. and Mascagni, M. (2019), Geometry Entrapment in Walk-on-Subdomains, Monte Carlo Methods and Applications, [online], https://doi.org/10.1515/mcma-2019-2052, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=928248 (Accessed October 8, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created November 18, 2019, Updated October 12, 2021
Was this page helpful?