Separable approximations of space‐time covariance matrices
- 8 May 2007
- journal article
- research article
- Published by Wiley in Environmetrics
- Vol. 18 (7) , 681-695
Abstract
Statistical modeling of space‐time data has often been based on separable covariance functions, that is, covariances that can be written as a product of a purely spatial covariance and a purely temporal covariance. The main reason is that the structure of separable covariances dramatically reduces the number of parameters in the covariance matrix and thus facilitates computational procedures for large space‐time data sets. In this paper, we discuss separable approximations of nonseparable space‐time covariance matrices. Specifically, we describe the nearest Kronecker product approximation, in the Frobenius norm, of a space‐time covariance matrix. The algorithm is simple to implement and the solution preserves properties of the space‐time covariance matrix, such as symmetry, positive definiteness, and other structures. The separable approximation allows for fast kriging of large space‐time data sets. We present several illustrative examples based on an application to data of Irish wind speeds, showing that only small differences in prediction error arise while computational savings for large data sets can be obtained. Copyright © 2007 John Wiley & Sons, Ltd.Keywords
This publication has 28 references indexed in Scilit:
- Covariance Tapering for Interpolation of Large Spatial DatasetsJournal of Computational and Graphical Statistics, 2006
- Testing for separability of spatial–temporal covariance functionsJournal of Statistical Planning and Inference, 2006
- Compactly Supported Correlation FunctionsJournal of Multivariate Analysis, 2002
- Nonseparable, Stationary Covariance Functions for Space–Time DataJournal of the American Statistical Association, 2002
- Blur-generated non-separable space–time modelsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2000
- Classes of Nonseparable, Spatio-Temporal Stationary Covariance FunctionsJournal of the American Statistical Association, 1999
- Statistics for Spatial Data1993
- Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB
T
+ CXD
T
= EACM Transactions on Mathematical Software, 1992
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a MatrixACM Transactions on Mathematical Software, 1981
- Harmonic Analysis and the Theory of Probability1955