Analysis of Circulant Embedding Methods for Sampling Stationary Random Fields
Publication:4572025
DOI10.1137/17M1149730zbMath1434.60114arXiv1710.00751OpenAlexW2964295897WikidataQ129646751 ScholiaQ129646751MaRDI QIDQ4572025
Frances Y. Kuo, Dirk Nuyens, Ivan G. Graham, Robert Scheichl, Ian H. Sloan
Publication date: 4 July 2018
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00751
fast Fourier transformGaussian random fieldscirculant embeddingMatérn covariancestatistical homogeneity
Random fields (60G60) Computational methods for problems pertaining to statistics (62-08) Stationary stochastic processes (60G10) Monte Carlo methods (65C05)
Related Items (27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients
- Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
- Application of hierarchical matrices for computing the Karhunen-Loève expansion
- Fast random field generation with \(H\)-matrices
- Representations of Gaussian random fields and approximation of elliptic PDEs with lognormal coefficients
- Computational aspects of the stochastic finite element method
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- An Introduction to Computational Stochastic PDEs
- Some Extensions of W. Gautschi's Inequalities for the Gamma Function
- Efficient approximation of random fields for numerical applications
- Fast and Exact Simulation of Stationary Gaussian Processes through Circulant Embedding of the Covariance Matrix
- An Algorithm for Simulating Stationary Gaussian Random Fields
- Scattered Data Approximation
This page was built for publication: Analysis of Circulant Embedding Methods for Sampling Stationary Random Fields