Generating correlated gaussian random fields by orthogonal polynomial approximations to the square root of the covariance matrix
- 1 August 1994
- journal article
- research article
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 50 (1) , 91-109
- https://doi.org/10.1080/00949659408811601
Abstract
Monte Carlo simulations in geostatistics often require the generation of realizations of multi-dimensional Gaussian processes with prescribed mean and covariance over a specified grid Ω of sampling points in R:d In principle, given a factorization C = AAT of the process’ covariance matrix C, realizations can always be constructed from the product Aϵ where ϵ is a white noise vector with unit variance. However, this approach generally has a high computational cost when compared with techniques such as the spectral or turning bands methods. Nevertheless, matrix factorization has advantages in that it does not require any special structure, such as isotropy or stationarity of the covariance model, o r regularity of the sampling grid Ω. Therefore, in an effort to speed up the approach at the cost of some loss in accuracy, Davis (1987b) proposed approximating the square root A by a low order matrix polynomial in C. This paper explores the construction of such polynomial approximations in more detail The paper first presents a systematic error analysis which justifies choosing the polynomial to be a best fit to the square root function on the unit interval in either the minimax metric or a particular weighted least squares metric. Given the well known difficulty of constructing arbitrary order minimax polynomial approximations, the paper suggests approximation by Chebychev polynomial expansions to give reasonable minimax solutions, plus approximation by quasi-Jacobi polynomial expansions to give optimal weighted least squares solutions. Rates of convergence are given for both expansions: for continuous covariance models these are restricted by the singularity of the square root function at the origin, but they improve dramatically if a nugget effect is included in the model. Thus the method may well be practical for generation of simulations in irregular problems, especially if high fidelity to the specified covariance model is not required.Keywords
This publication has 13 references indexed in Scilit:
- Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structureJournal of Statistical Computation and Simulation, 1993
- Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement StructureSIAM Journal on Matrix Analysis and Applications, 1991
- Implementation of the three‐dimensional turning bands random field generatorWater Resources Research, 1989
- Computationally exploitable structure of covariance matrices and generalized convariance matrices in spatial modelsJournal of Statistical Computation and Simulation, 1989
- On the Sharpness of Weyl’s Estimates for Eigenvalues of Smooth Kernels, IISIAM Journal on Mathematical Analysis, 1988
- Uses and abuses of cross-validation in geostatisticsMathematical Geology, 1987
- Eigenvalues of Differentiable Positive Definite KernelsSIAM Journal on Mathematical Analysis, 1986
- Algorithms for reconstruction of partially known, band-limited Fourier-transform pairs from noisy dataJournal of the Optical Society of America A, 1985
- Digital simulation of random processes and its applicationsJournal of Sound and Vibration, 1972
- Asymptotic behavior of the eigenvalues of certain integral equations. IIArchive for Rational Mechanics and Analysis, 1964