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.
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|
When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:37:y:1991:i:2:p:197-222. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.