We develop an efficient computational algorithm that produces efficient Markov chain Monte Carlo (MCMC) transition matrices. The first level of efficinecy is measured in terms of the number of operations needed to produce the resulting matrix. The second level of efficiency is evaluaded in terms of the asymptotic variance of the resulting MCMC estimates. The idea is then extended from finite to general state space.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.