.png){kind=icon}
.png){kind=icon}
Return
Variant Monte Carlo algorithm for driven elastic strings in random media
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2005.03.042.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We discuss the non-local 'Variant Monte Carlo' algorithm which has been successfully employed in the study of driven elastic strings in disordered media at the depinning threshold. Here we prove two theorems, which establish that the algorithm satisfies the crucial 'no-passing' rule and that, after some initial time, the string exclusively moves forward. The Variant Monte Carlo algorithm overcomes the shortcomings of local methods, as we show by analyzing the depinning threshold of a single-pin problem. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
elasticity
disorder
depinning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
No organization information available