Comparing sweep strategies for stochastic relaxation
The rate of convergence of various sweep strategies of stochastic relaxation for simulating multivariate Gaussian measures are calculated and compared. Each sweep strategy prescribes a method for chosing which coordinates of the random vector are to be updated. Deterministic sweep strategies in which the coordinates are updated according to a fixed order are compared to random strategies in which the coordinate to be updated is chosen through some random mechanism. In addition block updating, in which a few coordinates are updated simultaneously, is compared to single coordinate updating.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 37 (1991)
Issue (Month): 2 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|