Hostname: page-component-6766d58669-rxg44 Total loading time: 0 Render date: 2026-05-18T20:33:09.421Z Has data issue: false hasContentIssue false
  • English
  • Français

Improving Stochastic Relaxation for Gussian Random Fields

Published online by Cambridge University Press:  27 July 2009

Piero Barone  and
Arnolodo Frigessi
Piero Barone
Affiliation:
Istituto per le Appilcazioni del Calcola Consigio Nazionale delle Ricerche Viale del Pollclinico 137, 00161 Rome, Italy
Arnolodo Frigessi
Affiliation:
Istituto per le Appilcazioni del Calcola Consigio Nazionale delle Ricerche Viale del Pollclinico 137, 00161 Rome, Italy
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we are concerned with the simulation of Gaussian random fields by means of iterative stochastic algorithms, which are compared in terms of rate of convergence. A parametrized class of algorithms, which includes stochastic relaxation (Gibbs sampler), is proposed and its convergence properties are established. A suitable choice for the parameter improves the rate of convergence with respect to stochastic relaxation for special classes of covariance matrices. Some examples and numerical experiments are given.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 4 , Issue 3 , July 1990 , pp. 369 - 389
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Amit, Y. & Grenander, U. (1989). Comparing sweep strategies for stochastic relaxation. Reports in Pattern Analyses No. 149, Brown University, Providence, RI.Google Scholar
Athreya, K.B. & Ney, P. (1978). A new approach to the limit theory of recurrent Markov chains. Transactions of the American Mathematical Society 245: 493–501.CrossRefGoogle Scholar
Besag, J. (1986). On statistical analysis of dirty pictures. Journal of the Royal Statistical Society, Series B, 48: 259–302.Google Scholar
Chow, Y., Grenander, U. & Keenan, D.M. (1988). Hands: A pattern theoretic study of biological shapes. Division of Applied Mathematics, Brown University, Providence, RI.Google Scholar
Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6: 721–741.CrossRefGoogle ScholarPubMed
Goodman, J., Sokal, A.D. (1989). Multigrid Monte Carlo method. Conceptual foundations. Physical Review D 40: 2035–2071.Google Scholar
Grenander, U. (1984). Tutorial in pattern theory. Division of Applied Mathematics, Brown University, Providence, RI.Google Scholar
Hadjidimosa, A. (1987). A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques. Journal of Computational and Applied MathEmatics 20: 37–51.CrossRefGoogle Scholar
Knoerr, A.P. (1988). Global models of natural boundaries: theory and applications. Reports in Pattern Analyses No. 148, Brown University, Providence, RI.Google Scholar
Lancaster, P. (1969). Theory of matrices. New York: Academic Press.Google Scholar
Nichols, N. & Fox, L. (1969). Generalized consistent ordering and the optimum successive over-relaxation factor. Numerische Mathematik 13: 425–433.CrossRefGoogle Scholar
Niki, H., Ikeuchi, M. & Sawami, H. (1982). On the accelerated interactive method for estimating the optimum overrelaxation parameters. Journal of Computational and Applied Mathematics 8: 257–266.CrossRefGoogle Scholar
Stoer, J. & Bulirsch, R. (1980). Introduction to numerical analysis. New York: Springer Verlag.CrossRefGoogle Scholar
Varga, R.S. (1962). Matrix iterative analysis. Englewood Cliffs, N.J.: Prentice-Hall.Google Scholar