An Algorithm for Simulating Stationary Gaussian Random Fields
DOI10.1111/1467-9876.00057zbMATH Open0913.65142OpenAlexW2058401452MaRDI QIDQ4390935FDOQ4390935
Authors: Grace Chan, Andrew T. A. Wood
Publication date: 10 August 1998
Published in: Journal of the Royal Statistical Society Series C: Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1467-9876.00057
Recommendations
- 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
algorithmfast Fourier transformpositive definite covariance matrixFortran programToeplitz structurestationary Gaussian random fieldcirculant embedding matrix
Probabilistic methods, stochastic differential equations (65C99) Random fields (60G60) Software, source code, etc. for problems pertaining to probability theory (60-04)
Cited In (34)
- Fast sampling of parameterised Gaussian random fields
- On simulation of a fractional Ornstein-Uhlenbeck process of the second kind by the circulant embedding method
- Efficient generation of conditional simulations by Chebyshev matrix polynomial approximations to the symmetric square root of the covariance matrix
- Circulant embedding with QMC: analysis for elliptic PDE with lognormal coefficients
- Multilevel quasi-Monte Carlo for optimization under uncertainty
- Fast and exact synthesis of stationary multivariate Gaussian time series using circulant embedding
- Fast random field generation with \(H\)-matrices
- Analysis of Boundary Effects on PDE-Based Sampling of Whittle--Matérn Random Fields
- High resolution simulation of nonstationary Gaussian random fields
- Exact simulation of complex-valued Gaussian stationary processes via circulant embedding
- Title not available (Why is that?)
- Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
- Fast simulation of Gaussian random fields
- Effective generation of compressed stationary Gaussian fields
- Predicting threshold exceedance by local block means in soil pollution surveys
- An empirical likelihood method for spatial regression
- Testing the correctness of the sequential algorithm for simulating Gaussian random fields
- Models for extremal dependence derived from skew-symmetric families
- Computationally efficient algorithm for Gaussian process regression in case of structured samples
- AS 312
- A Levinson-Type Algorithm for Discrete Stationary Random Fields
- Scaling properties of weakly self-avoiding fractional Brownian motion in one dimension
- Title not available (Why is that?)
- Erratum to: ``Fast simulation of Gaussian random fields
- Title not available (Why is that?)
- Analysis of Circulant Embedding Methods for Sampling Stationary Random Fields
- Initialization of the circulant embedding method to speed up the generation of Gaussian random fields
- Simulation of binary random fields with Gaussian numerical models
- Optimization-Based Markov Chain Monte Carlo Methods for Nonlinear Hierarchical Statistical Inverse Problems
- Regularity and convergence analysis in Sobolev and Hölder spaces for generalized Whittle-Matérn fields
- Generation of random fields defined on a cluster of points when the random field has a given site-to-site correlation
- Special algorithms for the simulation of homogeneous random fields
- On optimal spatial subsample size for variance estimation
- Multilevel approximation of Gaussian random fields: fast simulation
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)