Over-relaxation methods and coupled Markov chains for Monte Carlo simulation

  • Authors:

  • Piero Barone;Giovanni Sebastiani;Julian Stander

  • Affiliations:

  • Istituto per le Applicazioni del Calcolo, Consiglio Nazionale delle Ricerche, Rome, Italy;Istituto per le Applicazioni del Calcolo, Consiglio Nazionale delle Ricerche, Rome, Italy;Department of Mathematics and Statistics, University of Plymouth, Drake Circus, Plymouth, PL4 8AA, UK. j.stander@plymouth.ac.uk

  • Venue:
  • Statistics and Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is concerned with improving the performance of certain Markov chain algorithms for Monte Carlo simulation. We propose a new algorithm for simulating from multivariate Gaussian densities. This algorithm combines ideas from coupled Markov chain methods and from an existing algorithm based only on over-relaxation. The rate of convergence of the proposed and existing algorithms can be measured in terms of the square of the spectral radius of certain matrices. We present examples in which the proposed algorithm converges faster than the existing algorithm and the Gibbs sampler. We also derive an expression for the asymptotic variance of any linear combination of the variables simulated by the proposed algorithm. We outline how the proposed algorithm can be extended to non-Gaussian densities.