An Algorithm for Simulating Stationary Gaussian Random Fields
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.
- scientific article; zbMATH DE number 2169696
- Fast simulation of Gaussian random fields
- Special algorithms for the simulation of homogeneous random fields
- ON SIMULATION OF A GAUSSIAN STATIONARY PROCESS
- Simulation of a strictly sub-Gaussian random field
- Uniformly efficient simulation for extremes of Gaussian random fields
- Exact simulation of complex-valued Gaussian stationary processes via circulant embedding
- Generation of random fields defined on a cluster of points when the random field has a given site-to-site correlation
- Circulant embedding with QMC: analysis for elliptic PDE with lognormal coefficients
- Fast random field generation with \(H\)-matrices
- High resolution simulation of nonstationary Gaussian random fields
- On optimal spatial subsample size for variance estimation
- Testing the correctness of the sequential algorithm for simulating Gaussian random fields
- Fast sampling of parameterised Gaussian random fields
- Regularity and convergence analysis in Sobolev and Hölder spaces for generalized Whittle-Matérn fields
- On simulation of a fractional Ornstein-Uhlenbeck process of the second kind by the circulant embedding method
- Initialization of the circulant embedding method to speed up the generation of Gaussian random fields
- Models for extremal dependence derived from skew-symmetric families
- Fast simulation of Gaussian random fields
- Computationally efficient algorithm for Gaussian process regression in case of structured samples
- Simulation of binary random fields with Gaussian numerical models
- scientific article; zbMATH DE number 4070790 (Why is no real title available?)
- scientific article; zbMATH DE number 523921 (Why is no real title available?)
- A Levinson-Type Algorithm for Discrete Stationary Random Fields
- An empirical likelihood method for spatial regression
- AS 312
- Analysis of Circulant Embedding Methods for Sampling Stationary Random Fields
- scientific article; zbMATH DE number 2169696 (Why is no real title available?)
- Erratum to: ``Fast simulation of Gaussian random fields
- Effective generation of compressed stationary Gaussian fields
- Multilevel approximation of Gaussian random fields: fast simulation
- Optimization-Based Markov Chain Monte Carlo Methods for Nonlinear Hierarchical Statistical Inverse Problems
- Analysis of Boundary Effects on PDE-Based Sampling of Whittle--Matérn Random Fields
- Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
- Fast and exact synthesis of stationary multivariate Gaussian time series using circulant embedding
- Special algorithms for the simulation of homogeneous random fields
- Efficient generation of conditional simulations by Chebyshev matrix polynomial approximations to the symmetric square root of the covariance matrix
- Multilevel quasi-Monte Carlo for optimization under uncertainty
- Sparse graphical modelling for global minimum variance portfolio
- Modeling spatio-temporal transport: from rigid advection to realistic dynamics
- Wavelet compression for sampling deep Gaussian processes
- Fast simulation of Gaussian random fields with flexible correlation models in Euclidean spaces
- Scaling properties of weakly self-avoiding fractional Brownian motion in one dimension
- Predicting threshold exceedance by local block means in soil pollution surveys
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)