An optimisation of the Metropolis algorithm for multibit Markov random fields

DOI10.1088/0266-5611/2/2/002MaRDI QIDQ3725307zbMATH OpenOpenAlexFDO

Authors Stephen Luttrell

Publication date 1986

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7c1f6da29f8e87fbf96ea2e5b92ba88b433a2aec

zbMATH Keywords

Metropolis algorithmmultibit Markov random fields

Mathematics Subject Classification ID

Random fields (60G60) Markov processes (60J99) Special processes (60K99)

Recommendations

• A random cluster algorithm for some continuous Markov random fields
• Fast vectorized algorithm for the Monte Carlo simulation of the random field Ising model
• A recursive algorithm for Markov random fields
• Markov chain Monte Carlo algorithms allowing parallel processing. II
• Markov chain Monte Carlo calculations allowing parallel processing using a variant of the Metropolis algorithm

Cited in

(8)

• Fast vectorized algorithm for the Monte Carlo simulation of the random field Ising model
• An algorithm derived from the Metropolis algorithm
• A random cluster algorithm for some continuous Markov random fields
• A recursive algorithm for Markov random fields
• A Repelling–Attracting Metropolis Algorithm for Multimodality
• Markov chain Monte Carlo calculations allowing parallel processing using a variant of the Metropolis algorithm
• A multi-point Metropolis scheme with generic weight functions
• On constrained simulation and optimization by Metropolis chains

This page was built for publication: An optimisation of the Metropolis algorithm for multibit Markov random fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725307)