Likelihood approximation with hierarchical matrices for large spatial datasets

33Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The unknown parameters (variance, smoothness, and covariance length) of a spatial covariance function can be estimated by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, the discretized covariance function is approximated in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and O(knlogn) storage, where the rank k is a small integer, and n is the number of locations. The H-matrix technique can approximate general covariance matrices (also inhomogeneous) discretized on a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse has to be sparse. It is investigated how the H-matrix approximation error influences the estimated parameters. Numerical examples with Monte Carlo simulations, where the true values of the unknown parameters are given, and an application to soil moisture data with unknown parameters are presented. The C, C++ codes and data are freely available.

Cite

CITATION STYLE

APA

Litvinenko, A., Sun, Y., Genton, M. G., & Keyes, D. E. (2019). Likelihood approximation with hierarchical matrices for large spatial datasets. Computational Statistics and Data Analysis, 137, 115–132. https://doi.org/10.1016/j.csda.2019.02.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free