Random walk on distant mesh points Monte Carlo methods
Journal Article
·
· Journal of Statistical Physics; (United States)
- Center for Informatics and Computer Technology (Bulgaria)
A new technique for obtaining Monte Carlo algorithms based on the Markov chains with a finite number of states is suggested. Instead of the classical random walk on neighboring mesh points,' a general way of constructing Monte Carlo algorithms that could be called random walk on distant mesh points' is considered. It is applied to solve boundary value problems. The numerical examples indicate that the new methods are less laborious and therefore more efficient.
- OSTI ID:
- 6740560
- Journal Information:
- Journal of Statistical Physics; (United States), Journal Name: Journal of Statistical Physics; (United States) Vol. 70:5-6; ISSN JSTPBS; ISSN 0022-4715
- Country of Publication:
- United States
- Language:
- English
Similar Records
Effects of changing the random number stride in Monte Carlo calculations
Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods
An improved random walk algorithm for the implicit Monte Carlo method
Journal Article
·
Sun Sep 01 00:00:00 EDT 1991
· Nuclear Science and Engineering; (United States)
·
OSTI ID:5780879
Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods
Conference
·
Mon Jul 10 00:00:00 EDT 2023
·
OSTI ID:2396329
An improved random walk algorithm for the implicit Monte Carlo method
Journal Article
·
Sat Dec 31 23:00:00 EST 2016
· Journal of Computational Physics
·
OSTI ID:22622229