Abstract
With the development of technology, a large amount of spatial data are usually observed in many applications. These massive spatial data impose a challenge to the traditional spatial data analysis primarily because of the large covariance matrix. One way to overcome the computation burden is to utilize a low rank model. The optimal low rank model is provided by the Karhunen–Loève (KL) expansion of the spatial process. However, the inference and prediction of the spatial data require an efficient algorithm for the KL expansion. In this paper, we compare four algorithms that have been proposed to numerically obtain the KL expansion. It is found that the Gaussian quadrature method outperforms the others for spatial processes.
Funding source: National Science Foundation
Award Identifier / Grant number: US grant IIS-1028291
© 2015 by De Gruyter
