An Algorithm for Simulating Stationary Gaussian Random Fields

From MaRDI portal





This paper describes a Fortran program which determines a suitable circulant embedding matrix and simulates a stationary Gaussian random field on a grid. The proposed procedure is based on the idea of circulant embedding. This approach was used in the work of \textit{R. B. Davies} and \textit{D. S. Harte} [Biometrica, 74, 95-101 (1987; Zbl 0612.62123)] in the one-dimensional case and after that was rediscovered and extended to higher dimensions by \textit{C. R. Dietrich} and \textit{G. N. Newsam} [Wat. Resour. Res. 29, 2861-2869 (1993)] and \textit{A. T. A. Wood} and \textit{G. Chan} [J. Comput. Graph. Statist. 3, 409-432 (1994)]. In this paper both one-dimensional and two-dimensional grids are considered. The authors claim that there is no problem in principle in extending the procedure to grids in more dimensions.




Cited in
(38)








This page was built for publication: An Algorithm for Simulating Stationary Gaussian Random Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390935)